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-fa1c628-m [2019-01-31 17:06:25,470 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-31 17:06:25,472 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-31 17:06:25,483 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-31 17:06:25,484 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-31 17:06:25,485 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-31 17:06:25,487 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-31 17:06:25,489 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-31 17:06:25,491 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-31 17:06:25,493 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-31 17:06:25,495 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-31 17:06:25,496 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-31 17:06:25,496 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-31 17:06:25,498 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-31 17:06:25,500 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-31 17:06:25,501 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-31 17:06:25,503 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-31 17:06:25,505 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-31 17:06:25,507 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-31 17:06:25,509 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-31 17:06:25,510 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-31 17:06:25,511 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-31 17:06:25,513 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-31 17:06:25,513 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-31 17:06:25,514 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-31 17:06:25,514 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-31 17:06:25,515 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-31 17:06:25,516 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-31 17:06:25,517 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-31 17:06:25,518 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-31 17:06:25,518 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-31 17:06:25,519 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-31 17:06:25,519 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-31 17:06:25,519 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-31 17:06:25,520 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-31 17:06:25,521 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-31 17:06:25,521 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-01-31 17:06:25,533 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-31 17:06:25,534 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-31 17:06:25,534 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-31 17:06:25,535 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-31 17:06:25,535 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-31 17:06:25,535 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-31 17:06:25,535 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-31 17:06:25,535 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-31 17:06:25,539 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-31 17:06:25,539 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-31 17:06:25,539 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-31 17:06:25,539 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-31 17:06:25,539 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-31 17:06:25,540 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-31 17:06:25,540 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-31 17:06:25,540 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-31 17:06:25,541 INFO L133 SettingsManager]: * Use SBE=true [2019-01-31 17:06:25,541 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-31 17:06:25,541 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-31 17:06:25,541 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-31 17:06:25,541 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-31 17:06:25,542 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-31 17:06:25,542 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-31 17:06:25,542 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-31 17:06:25,542 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-31 17:06:25,542 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-31 17:06:25,543 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-31 17:06:25,546 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-31 17:06:25,546 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-31 17:06:25,546 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-31 17:06:25,546 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-31 17:06:25,547 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-01-31 17:06:25,547 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-31 17:06:25,547 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-31 17:06:25,547 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-31 17:06:25,547 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-31 17:06:25,548 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-31 17:06:25,548 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in [2019-01-31 17:06:25,548 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-31 17:06:25,548 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-31 17:06:25,582 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-31 17:06:25,596 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-31 17:06:25,599 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-31 17:06:25,600 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-31 17:06:25,601 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-31 17:06:25,601 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-01-31 17:06:25,601 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-4-limited.bpl' [2019-01-31 17:06:25,636 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-31 17:06:25,637 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-31 17:06:25,637 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-31 17:06:25,638 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-31 17:06:25,638 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-31 17:06:25,653 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 31.01 05:06:25" (1/1) ... [2019-01-31 17:06:25,665 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 31.01 05:06:25" (1/1) ... [2019-01-31 17:06:25,690 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-31 17:06:25,690 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-31 17:06:25,691 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-31 17:06:25,691 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-31 17:06:25,702 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 31.01 05:06:25" (1/1) ... [2019-01-31 17:06:25,702 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 31.01 05:06:25" (1/1) ... [2019-01-31 17:06:25,704 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 31.01 05:06:25" (1/1) ... [2019-01-31 17:06:25,704 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 31.01 05:06:25" (1/1) ... [2019-01-31 17:06:25,707 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 31.01 05:06:25" (1/1) ... [2019-01-31 17:06:25,713 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 31.01 05:06:25" (1/1) ... [2019-01-31 17:06:25,715 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 31.01 05:06:25" (1/1) ... [2019-01-31 17:06:25,723 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-31 17:06:25,723 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-31 17:06:25,723 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-31 17:06:25,724 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-31 17:06:25,725 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 31.01 05:06:25" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-01-31 17:06:25,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-31 17:06:25,796 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-31 17:06:26,025 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-31 17:06:26,025 INFO L286 CfgBuilder]: Removed 11 assue(true) statements. [2019-01-31 17:06:26,026 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 05:06:26 BoogieIcfgContainer [2019-01-31 17:06:26,027 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-31 17:06:26,027 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-31 17:06:26,028 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-31 17:06:26,031 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-31 17:06:26,032 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 31.01 05:06:25" (1/2) ... [2019-01-31 17:06:26,033 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1479142b and model type speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 05:06:26, skipping insertion in model container [2019-01-31 17:06:26,033 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 31.01 05:06:26" (2/2) ... [2019-01-31 17:06:26,035 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-4-limited.bpl [2019-01-31 17:06:26,045 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-31 17:06:26,054 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-01-31 17:06:26,071 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-01-31 17:06:26,107 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-31 17:06:26,107 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-31 17:06:26,108 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-31 17:06:26,108 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-31 17:06:26,108 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-31 17:06:26,108 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-31 17:06:26,108 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-31 17:06:26,108 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-31 17:06:26,127 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states. [2019-01-31 17:06:26,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-01-31 17:06:26,137 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:26,138 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-01-31 17:06:26,142 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:26,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:26,151 INFO L82 PathProgramCache]: Analyzing trace with hash 980, now seen corresponding path program 1 times [2019-01-31 17:06:26,153 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:26,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:26,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:26,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:26,192 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:26,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:26,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:26,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 17:06:26,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-31 17:06:26,368 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:06:26,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-31 17:06:26,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-31 17:06:26,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-31 17:06:26,393 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 3 states. [2019-01-31 17:06:26,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:26,562 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2019-01-31 17:06:26,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 17:06:26,564 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-01-31 17:06:26,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:26,578 INFO L225 Difference]: With dead ends: 21 [2019-01-31 17:06:26,578 INFO L226 Difference]: Without dead ends: 16 [2019-01-31 17:06:26,582 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-31 17:06:26,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-01-31 17:06:26,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 10. [2019-01-31 17:06:26,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-31 17:06:26,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 17 transitions. [2019-01-31 17:06:26,619 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 17 transitions. Word has length 2 [2019-01-31 17:06:26,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:26,620 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 17 transitions. [2019-01-31 17:06:26,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-31 17:06:26,621 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 17 transitions. [2019-01-31 17:06:26,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-31 17:06:26,621 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:26,621 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-31 17:06:26,622 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:26,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:26,622 INFO L82 PathProgramCache]: Analyzing trace with hash 30306, now seen corresponding path program 1 times [2019-01-31 17:06:26,623 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:26,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:26,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:26,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:26,624 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:26,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:26,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:26,795 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:26,795 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:06:26,796 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-31 17:06:26,798 INFO L207 CegarAbsIntRunner]: [0], [16], [19] [2019-01-31 17:06:26,836 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:06:26,836 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:06:26,907 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:06:26,908 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-01-31 17:06:26,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:26,914 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:06:26,925 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:26,925 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:06:26,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:26,942 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:06:26,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:26,957 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:06:26,996 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-31 17:06:27,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:27,009 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-01-31 17:06:27,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:27,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:27,033 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-01-31 17:06:27,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:27,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:27,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:27,056 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-31 17:06:27,057 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:27,197 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:27,337 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:27,428 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:27,474 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:27,475 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:25, output treesize:30 [2019-01-31 17:06:27,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:27,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:27,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:27,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:27,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:27,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:27,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:27,580 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-31 17:06:27,581 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:27,637 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:27,638 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-31 17:06:27,764 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:27,764 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:06:27,788 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:27,809 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:06:27,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-31 17:06:27,809 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:06:27,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-31 17:06:27,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-31 17:06:27,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-31 17:06:27,811 INFO L87 Difference]: Start difference. First operand 10 states and 17 transitions. Second operand 6 states. [2019-01-31 17:06:28,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:28,207 INFO L93 Difference]: Finished difference Result 31 states and 44 transitions. [2019-01-31 17:06:28,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-31 17:06:28,208 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-31 17:06:28,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:28,209 INFO L225 Difference]: With dead ends: 31 [2019-01-31 17:06:28,210 INFO L226 Difference]: Without dead ends: 28 [2019-01-31 17:06:28,211 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-31 17:06:28,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-01-31 17:06:28,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 13. [2019-01-31 17:06:28,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-31 17:06:28,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 25 transitions. [2019-01-31 17:06:28,221 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 25 transitions. Word has length 3 [2019-01-31 17:06:28,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:28,222 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 25 transitions. [2019-01-31 17:06:28,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-31 17:06:28,222 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 25 transitions. [2019-01-31 17:06:28,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-31 17:06:28,223 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:28,223 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-31 17:06:28,223 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:28,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:28,224 INFO L82 PathProgramCache]: Analyzing trace with hash 30432, now seen corresponding path program 1 times [2019-01-31 17:06:28,224 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:28,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:28,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:28,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:28,226 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:28,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:28,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:28,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 17:06:28,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-31 17:06:28,262 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:06:28,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-31 17:06:28,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-31 17:06:28,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-31 17:06:28,263 INFO L87 Difference]: Start difference. First operand 13 states and 25 transitions. Second operand 3 states. [2019-01-31 17:06:28,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:28,327 INFO L93 Difference]: Finished difference Result 15 states and 25 transitions. [2019-01-31 17:06:28,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 17:06:28,328 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-31 17:06:28,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:28,328 INFO L225 Difference]: With dead ends: 15 [2019-01-31 17:06:28,328 INFO L226 Difference]: Without dead ends: 14 [2019-01-31 17:06:28,329 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-31 17:06:28,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-01-31 17:06:28,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-01-31 17:06:28,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-31 17:06:28,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 24 transitions. [2019-01-31 17:06:28,334 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 24 transitions. Word has length 3 [2019-01-31 17:06:28,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:28,335 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 24 transitions. [2019-01-31 17:06:28,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-31 17:06:28,335 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 24 transitions. [2019-01-31 17:06:28,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-31 17:06:28,336 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:28,336 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-31 17:06:28,337 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:28,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:28,337 INFO L82 PathProgramCache]: Analyzing trace with hash 29996, now seen corresponding path program 1 times [2019-01-31 17:06:28,337 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:28,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:28,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:28,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:28,339 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:28,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:28,418 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:28,419 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:28,419 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:06:28,419 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-31 17:06:28,419 INFO L207 CegarAbsIntRunner]: [0], [6], [19] [2019-01-31 17:06:28,425 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:06:28,425 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:06:28,435 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:06:28,437 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-01-31 17:06:28,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:28,437 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:06:28,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:28,438 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:06:28,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:28,448 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:06:28,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:28,454 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:06:28,460 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-01-31 17:06:28,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:28,486 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-31 17:06:28,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:28,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:28,550 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-01-31 17:06:28,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:28,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:28,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:28,633 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-01-31 17:06:28,634 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:28,787 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:28,798 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:28,807 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:28,829 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:28,830 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:25, output treesize:30 [2019-01-31 17:06:28,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:28,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:28,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:28,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:28,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:28,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:28,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:28,898 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-31 17:06:28,899 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:28,940 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:28,941 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-31 17:06:28,964 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:28,964 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:06:28,979 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:28,999 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-31 17:06:28,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-01-31 17:06:29,000 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:06:29,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-31 17:06:29,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-31 17:06:29,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-31 17:06:29,001 INFO L87 Difference]: Start difference. First operand 13 states and 24 transitions. Second operand 4 states. [2019-01-31 17:06:29,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:29,060 INFO L93 Difference]: Finished difference Result 18 states and 41 transitions. [2019-01-31 17:06:29,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-31 17:06:29,060 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-31 17:06:29,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:29,061 INFO L225 Difference]: With dead ends: 18 [2019-01-31 17:06:29,061 INFO L226 Difference]: Without dead ends: 17 [2019-01-31 17:06:29,062 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-31 17:06:29,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-31 17:06:29,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-01-31 17:06:29,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-31 17:06:29,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 40 transitions. [2019-01-31 17:06:29,069 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 40 transitions. Word has length 3 [2019-01-31 17:06:29,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:29,069 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 40 transitions. [2019-01-31 17:06:29,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-31 17:06:29,069 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 40 transitions. [2019-01-31 17:06:29,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-31 17:06:29,070 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:29,070 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-31 17:06:29,070 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:29,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:29,071 INFO L82 PathProgramCache]: Analyzing trace with hash 30120, now seen corresponding path program 1 times [2019-01-31 17:06:29,071 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:29,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:29,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:29,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:29,073 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:29,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:29,173 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:29,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:29,174 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:06:29,174 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-31 17:06:29,174 INFO L207 CegarAbsIntRunner]: [0], [10], [19] [2019-01-31 17:06:29,180 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:06:29,180 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:06:29,187 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:06:29,188 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-01-31 17:06:29,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:29,188 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:06:29,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:29,188 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:06:29,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:29,198 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:06:29,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:29,205 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:06:29,213 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-01-31 17:06:29,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:29,219 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-01-31 17:06:29,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:29,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:29,230 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-01-31 17:06:29,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:29,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:29,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:29,245 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-01-31 17:06:29,246 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:29,289 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:29,298 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:29,335 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:29,353 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:29,353 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:25, output treesize:30 [2019-01-31 17:06:29,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:29,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:29,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:29,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:29,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:29,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:29,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:29,403 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-31 17:06:29,404 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:29,470 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:29,471 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-31 17:06:29,533 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:29,534 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:06:29,580 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:29,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:06:29,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-31 17:06:29,599 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:06:29,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-31 17:06:29,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-31 17:06:29,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-31 17:06:29,600 INFO L87 Difference]: Start difference. First operand 16 states and 40 transitions. Second operand 6 states. [2019-01-31 17:06:29,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:29,855 INFO L93 Difference]: Finished difference Result 32 states and 62 transitions. [2019-01-31 17:06:29,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-31 17:06:29,856 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-31 17:06:29,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:29,858 INFO L225 Difference]: With dead ends: 32 [2019-01-31 17:06:29,858 INFO L226 Difference]: Without dead ends: 31 [2019-01-31 17:06:29,859 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-31 17:06:29,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-01-31 17:06:29,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 18. [2019-01-31 17:06:29,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-31 17:06:29,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 50 transitions. [2019-01-31 17:06:29,865 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 50 transitions. Word has length 3 [2019-01-31 17:06:29,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:29,865 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 50 transitions. [2019-01-31 17:06:29,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-31 17:06:29,865 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 50 transitions. [2019-01-31 17:06:29,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:06:29,866 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:29,866 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:06:29,866 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:29,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:29,866 INFO L82 PathProgramCache]: Analyzing trace with hash 939538, now seen corresponding path program 1 times [2019-01-31 17:06:29,867 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:29,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:29,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:29,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:29,867 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:29,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:29,922 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:29,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:29,922 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:06:29,923 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 17:06:29,923 INFO L207 CegarAbsIntRunner]: [0], [16], [20], [21] [2019-01-31 17:06:29,926 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:06:29,926 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:06:29,940 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:06:29,940 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-01-31 17:06:29,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:29,941 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:06:29,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:29,941 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:06:29,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:29,950 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:06:29,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:29,955 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:06:29,959 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-01-31 17:06:29,964 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-01-31 17:06:29,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:29,975 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-01-31 17:06:29,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:29,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:29,997 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-01-31 17:06:29,998 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:30,029 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:30,037 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:30,046 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:30,083 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:30,084 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:22, output treesize:27 [2019-01-31 17:06:30,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:30,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:30,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:30,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:30,183 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-31 17:06:30,184 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:30,204 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:30,205 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-01-31 17:06:30,222 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:30,222 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:06:30,235 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:30,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-31 17:06:30,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-01-31 17:06:30,254 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:06:30,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-31 17:06:30,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-31 17:06:30,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-01-31 17:06:30,255 INFO L87 Difference]: Start difference. First operand 18 states and 50 transitions. Second operand 4 states. [2019-01-31 17:06:30,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:30,297 INFO L93 Difference]: Finished difference Result 22 states and 58 transitions. [2019-01-31 17:06:30,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 17:06:30,298 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-31 17:06:30,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:30,298 INFO L225 Difference]: With dead ends: 22 [2019-01-31 17:06:30,298 INFO L226 Difference]: Without dead ends: 21 [2019-01-31 17:06:30,299 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-01-31 17:06:30,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-01-31 17:06:30,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2019-01-31 17:06:30,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-31 17:06:30,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 57 transitions. [2019-01-31 17:06:30,305 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 57 transitions. Word has length 4 [2019-01-31 17:06:30,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:30,305 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 57 transitions. [2019-01-31 17:06:30,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-31 17:06:30,305 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 57 transitions. [2019-01-31 17:06:30,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:06:30,306 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:30,306 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:06:30,306 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:30,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:30,307 INFO L82 PathProgramCache]: Analyzing trace with hash 939226, now seen corresponding path program 1 times [2019-01-31 17:06:30,307 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:30,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:30,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:30,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:30,308 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:30,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:30,402 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:30,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:30,403 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:06:30,403 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 17:06:30,403 INFO L207 CegarAbsIntRunner]: [0], [10], [16], [19] [2019-01-31 17:06:30,405 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:06:30,405 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:06:30,410 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:06:30,411 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-01-31 17:06:30,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:30,411 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:06:30,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:30,412 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:06:30,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:30,426 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:06:30,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:30,446 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:06:30,465 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-01-31 17:06:30,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:30,477 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-01-31 17:06:30,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:30,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:30,490 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-31 17:06:30,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:30,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:30,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:30,500 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-01-31 17:06:30,501 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:30,530 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:30,539 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:30,550 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:30,564 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:30,564 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-31 17:06:30,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:30,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:30,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:30,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:30,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:30,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:30,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:30,594 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-31 17:06:30,595 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:30,657 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:30,658 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-31 17:06:30,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:30,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:30,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:30,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:30,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:30,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:30,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:30,691 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:06:30,693 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 60 [2019-01-31 17:06:30,694 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:30,808 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:30,808 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-01-31 17:06:30,826 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:30,826 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:06:30,859 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:30,878 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:06:30,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:06:30,878 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:06:30,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:06:30,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:06:30,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:06:30,879 INFO L87 Difference]: Start difference. First operand 20 states and 57 transitions. Second operand 8 states. [2019-01-31 17:06:31,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:31,185 INFO L93 Difference]: Finished difference Result 37 states and 74 transitions. [2019-01-31 17:06:31,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:06:31,185 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-31 17:06:31,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:31,187 INFO L225 Difference]: With dead ends: 37 [2019-01-31 17:06:31,187 INFO L226 Difference]: Without dead ends: 36 [2019-01-31 17:06:31,188 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:06:31,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-31 17:06:31,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 17. [2019-01-31 17:06:31,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-31 17:06:31,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 41 transitions. [2019-01-31 17:06:31,195 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 41 transitions. Word has length 4 [2019-01-31 17:06:31,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:31,195 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 41 transitions. [2019-01-31 17:06:31,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:06:31,196 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 41 transitions. [2019-01-31 17:06:31,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:06:31,196 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:31,196 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:06:31,197 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:31,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:31,197 INFO L82 PathProgramCache]: Analyzing trace with hash 939350, now seen corresponding path program 1 times [2019-01-31 17:06:31,197 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:31,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:31,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:31,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:31,198 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:31,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:31,351 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:31,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:31,352 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:06:31,352 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 17:06:31,352 INFO L207 CegarAbsIntRunner]: [0], [14], [16], [19] [2019-01-31 17:06:31,354 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:06:31,354 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:06:31,361 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:06:31,361 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-01-31 17:06:31,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:31,362 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:06:31,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:31,362 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:06:31,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:31,375 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:06:31,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:31,380 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:06:31,386 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-31 17:06:31,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:31,392 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-01-31 17:06:31,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:31,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:31,399 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-01-31 17:06:31,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:31,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:31,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:31,411 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-01-31 17:06:31,412 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:31,439 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:31,456 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:31,462 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:31,475 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:31,476 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-31 17:06:31,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:31,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:31,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:31,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:31,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:31,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:31,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:31,685 INFO L303 Elim1Store]: Index analysis took 182 ms [2019-01-31 17:06:31,686 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-31 17:06:31,687 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:31,898 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:31,898 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-31 17:06:31,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:31,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:31,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:31,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:31,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:31,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:31,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:31,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:31,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:31,962 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-01-31 17:06:31,964 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:31,996 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:31,996 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-31 17:06:32,012 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:32,012 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:06:32,038 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:32,059 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:06:32,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:06:32,059 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:06:32,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:06:32,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:06:32,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:06:32,060 INFO L87 Difference]: Start difference. First operand 17 states and 41 transitions. Second operand 8 states. [2019-01-31 17:06:32,297 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2019-01-31 17:06:32,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:32,460 INFO L93 Difference]: Finished difference Result 42 states and 89 transitions. [2019-01-31 17:06:32,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:06:32,460 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-31 17:06:32,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:32,462 INFO L225 Difference]: With dead ends: 42 [2019-01-31 17:06:32,462 INFO L226 Difference]: Without dead ends: 38 [2019-01-31 17:06:32,463 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-01-31 17:06:32,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-31 17:06:32,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 22. [2019-01-31 17:06:32,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-31 17:06:32,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 65 transitions. [2019-01-31 17:06:32,471 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 65 transitions. Word has length 4 [2019-01-31 17:06:32,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:32,471 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 65 transitions. [2019-01-31 17:06:32,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:06:32,472 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 65 transitions. [2019-01-31 17:06:32,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:06:32,472 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:32,472 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:06:32,473 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:32,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:32,473 INFO L82 PathProgramCache]: Analyzing trace with hash 929802, now seen corresponding path program 1 times [2019-01-31 17:06:32,473 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:32,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:32,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:32,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:32,474 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:32,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:32,616 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:32,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:32,617 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:06:32,617 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 17:06:32,617 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [19] [2019-01-31 17:06:32,619 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:06:32,619 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:06:32,624 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:06:32,624 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-01-31 17:06:32,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:32,625 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:06:32,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:32,625 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:06:32,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:32,635 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:06:32,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:32,639 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:06:32,644 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-01-31 17:06:32,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:32,650 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-01-31 17:06:32,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:32,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:32,660 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-01-31 17:06:32,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:32,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:32,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:32,679 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-01-31 17:06:32,680 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:32,702 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:32,710 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:32,718 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:32,733 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:32,734 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:25, output treesize:30 [2019-01-31 17:06:32,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:32,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:32,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:32,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:32,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:32,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:32,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:32,821 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-31 17:06:32,822 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:32,848 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:32,849 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-31 17:06:32,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:32,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:32,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:32,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:32,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:32,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:32,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:32,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:32,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:32,893 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-31 17:06:32,894 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:32,943 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:32,943 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-31 17:06:32,956 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:32,957 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:06:32,995 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:33,014 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:06:33,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:06:33,014 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:06:33,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:06:33,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:06:33,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:06:33,015 INFO L87 Difference]: Start difference. First operand 22 states and 65 transitions. Second operand 8 states. [2019-01-31 17:06:33,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:33,395 INFO L93 Difference]: Finished difference Result 51 states and 112 transitions. [2019-01-31 17:06:33,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:06:33,396 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-31 17:06:33,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:33,397 INFO L225 Difference]: With dead ends: 51 [2019-01-31 17:06:33,397 INFO L226 Difference]: Without dead ends: 48 [2019-01-31 17:06:33,398 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-01-31 17:06:33,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-01-31 17:06:33,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 28. [2019-01-31 17:06:33,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-31 17:06:33,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 88 transitions. [2019-01-31 17:06:33,407 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 88 transitions. Word has length 4 [2019-01-31 17:06:33,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:33,407 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 88 transitions. [2019-01-31 17:06:33,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:06:33,407 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 88 transitions. [2019-01-31 17:06:33,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:06:33,408 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:33,408 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:06:33,408 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:33,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:33,409 INFO L82 PathProgramCache]: Analyzing trace with hash 929928, now seen corresponding path program 1 times [2019-01-31 17:06:33,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:33,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:33,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:33,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:33,410 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:33,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:33,480 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:33,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:33,481 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:06:33,481 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 17:06:33,481 INFO L207 CegarAbsIntRunner]: [0], [6], [20], [21] [2019-01-31 17:06:33,487 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:06:33,487 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:06:33,497 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:06:33,497 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-01-31 17:06:33,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:33,498 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:06:33,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:33,498 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:06:33,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:33,514 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:06:33,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:33,520 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:06:33,530 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-01-31 17:06:33,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:33,542 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-01-31 17:06:33,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:33,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:33,554 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-01-31 17:06:33,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:33,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:33,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:33,567 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-01-31 17:06:33,568 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:33,601 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:33,611 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:33,618 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:33,633 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:33,633 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:25, output treesize:30 [2019-01-31 17:06:33,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:33,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:33,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:33,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:33,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:33,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:33,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:33,676 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-31 17:06:33,676 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:33,705 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:33,705 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-31 17:06:33,770 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:33,770 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:06:33,799 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:33,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:06:33,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-31 17:06:33,818 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:06:33,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-31 17:06:33,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-31 17:06:33,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-31 17:06:33,819 INFO L87 Difference]: Start difference. First operand 28 states and 88 transitions. Second operand 6 states. [2019-01-31 17:06:34,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:34,028 INFO L93 Difference]: Finished difference Result 36 states and 98 transitions. [2019-01-31 17:06:34,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-31 17:06:34,029 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-31 17:06:34,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:34,030 INFO L225 Difference]: With dead ends: 36 [2019-01-31 17:06:34,030 INFO L226 Difference]: Without dead ends: 35 [2019-01-31 17:06:34,031 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-01-31 17:06:34,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-31 17:06:34,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 29. [2019-01-31 17:06:34,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-31 17:06:34,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 92 transitions. [2019-01-31 17:06:34,038 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 92 transitions. Word has length 4 [2019-01-31 17:06:34,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:34,038 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 92 transitions. [2019-01-31 17:06:34,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-31 17:06:34,038 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 92 transitions. [2019-01-31 17:06:34,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:06:34,039 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:34,039 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:06:34,039 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:34,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:34,040 INFO L82 PathProgramCache]: Analyzing trace with hash 929616, now seen corresponding path program 1 times [2019-01-31 17:06:34,040 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:34,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:34,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:34,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:34,041 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:34,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:34,114 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:34,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:34,114 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:06:34,114 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 17:06:34,114 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [19] [2019-01-31 17:06:34,115 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:06:34,116 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:06:34,121 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:06:34,122 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-01-31 17:06:34,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:34,122 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:06:34,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:34,122 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:06:34,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:34,135 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:06:34,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:34,141 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:06:34,145 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-01-31 17:06:34,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:34,150 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-01-31 17:06:34,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:34,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:34,205 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-31 17:06:34,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:34,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:34,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:34,224 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-01-31 17:06:34,224 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:34,243 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:34,251 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:34,260 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:34,272 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:34,273 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:25, output treesize:30 [2019-01-31 17:06:34,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:34,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:34,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:34,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:34,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:34,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:34,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:34,299 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-31 17:06:34,300 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:34,328 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:34,328 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-31 17:06:34,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:34,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:34,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:34,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:34,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:34,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:34,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:34,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:34,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:34,360 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-01-31 17:06:34,361 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:34,393 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:34,393 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-31 17:06:34,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-01-31 17:06:34,408 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:06:34,429 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:34,448 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:06:34,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:06:34,448 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:06:34,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:06:34,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:06:34,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:06:34,449 INFO L87 Difference]: Start difference. First operand 29 states and 92 transitions. Second operand 8 states. [2019-01-31 17:06:34,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:34,912 INFO L93 Difference]: Finished difference Result 55 states and 140 transitions. [2019-01-31 17:06:34,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:06:34,912 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-31 17:06:34,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:34,914 INFO L225 Difference]: With dead ends: 55 [2019-01-31 17:06:34,914 INFO L226 Difference]: Without dead ends: 54 [2019-01-31 17:06:34,914 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-01-31 17:06:34,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-01-31 17:06:34,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 34. [2019-01-31 17:06:34,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-01-31 17:06:34,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 117 transitions. [2019-01-31 17:06:34,923 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 117 transitions. Word has length 4 [2019-01-31 17:06:34,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:34,924 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 117 transitions. [2019-01-31 17:06:34,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:06:34,924 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 117 transitions. [2019-01-31 17:06:34,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:06:34,925 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:34,925 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:06:34,925 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:34,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:34,925 INFO L82 PathProgramCache]: Analyzing trace with hash 933584, now seen corresponding path program 1 times [2019-01-31 17:06:34,925 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:34,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:34,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:34,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:34,927 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:34,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:35,040 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:35,040 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:35,040 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:06:35,040 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 17:06:35,041 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [19] [2019-01-31 17:06:35,042 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:06:35,042 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:06:35,046 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:06:35,046 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-01-31 17:06:35,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:35,047 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:06:35,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:35,047 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:06:35,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:35,060 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:06:35,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:35,067 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:06:35,070 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-01-31 17:06:35,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:35,082 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-01-31 17:06:35,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:35,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:35,088 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-01-31 17:06:35,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:35,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:35,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:35,099 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-01-31 17:06:35,100 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:35,119 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:35,130 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:35,140 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:35,156 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:35,156 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-31 17:06:35,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:35,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:35,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:35,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:35,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:35,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:35,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:35,187 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-31 17:06:35,188 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:35,219 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:35,219 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-31 17:06:35,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:35,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:35,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:35,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:35,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:35,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:35,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:35,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:35,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:35,260 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-01-31 17:06:35,262 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:35,318 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:35,318 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-31 17:06:35,335 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:35,336 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:06:35,359 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:35,380 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:06:35,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:06:35,380 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:06:35,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:06:35,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:06:35,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:06:35,381 INFO L87 Difference]: Start difference. First operand 34 states and 117 transitions. Second operand 8 states. [2019-01-31 17:06:35,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:35,720 INFO L93 Difference]: Finished difference Result 56 states and 150 transitions. [2019-01-31 17:06:35,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:06:35,721 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-31 17:06:35,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:35,722 INFO L225 Difference]: With dead ends: 56 [2019-01-31 17:06:35,722 INFO L226 Difference]: Without dead ends: 54 [2019-01-31 17:06:35,723 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:06:35,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-01-31 17:06:35,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 36. [2019-01-31 17:06:35,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-31 17:06:35,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 127 transitions. [2019-01-31 17:06:35,733 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 127 transitions. Word has length 4 [2019-01-31 17:06:35,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:35,733 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 127 transitions. [2019-01-31 17:06:35,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:06:35,734 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 127 transitions. [2019-01-31 17:06:35,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:06:35,734 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:35,734 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:06:35,735 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:35,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:35,735 INFO L82 PathProgramCache]: Analyzing trace with hash 937616, now seen corresponding path program 1 times [2019-01-31 17:06:35,735 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:35,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:35,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:35,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:35,736 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:35,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:35,834 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:35,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:35,835 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:06:35,835 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 17:06:35,835 INFO L207 CegarAbsIntRunner]: [0], [14], [20], [21] [2019-01-31 17:06:35,837 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:06:35,837 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:06:35,841 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:06:35,841 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-01-31 17:06:35,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:35,841 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:06:35,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:35,842 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:06:35,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:35,853 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:06:35,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:35,857 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:06:35,865 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-01-31 17:06:35,871 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-01-31 17:06:35,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:35,876 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-01-31 17:06:35,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:35,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:35,896 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-01-31 17:06:35,896 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:35,908 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:35,915 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:35,923 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:35,935 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:35,935 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:22, output treesize:27 [2019-01-31 17:06:36,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:36,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:36,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:36,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:36,071 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-01-31 17:06:36,071 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:36,113 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:36,113 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-01-31 17:06:36,126 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:36,126 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:06:36,141 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:36,160 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:06:36,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-31 17:06:36,160 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:06:36,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-31 17:06:36,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-31 17:06:36,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-31 17:06:36,161 INFO L87 Difference]: Start difference. First operand 36 states and 127 transitions. Second operand 6 states. [2019-01-31 17:06:36,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:36,290 INFO L93 Difference]: Finished difference Result 48 states and 142 transitions. [2019-01-31 17:06:36,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-31 17:06:36,290 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-31 17:06:36,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:36,291 INFO L225 Difference]: With dead ends: 48 [2019-01-31 17:06:36,291 INFO L226 Difference]: Without dead ends: 47 [2019-01-31 17:06:36,292 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-31 17:06:36,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-31 17:06:36,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 36. [2019-01-31 17:06:36,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-31 17:06:36,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 127 transitions. [2019-01-31 17:06:36,299 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 127 transitions. Word has length 4 [2019-01-31 17:06:36,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:36,299 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 127 transitions. [2019-01-31 17:06:36,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-31 17:06:36,299 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 127 transitions. [2019-01-31 17:06:36,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:06:36,300 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:36,300 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:06:36,300 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:36,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:36,301 INFO L82 PathProgramCache]: Analyzing trace with hash 29112214, now seen corresponding path program 1 times [2019-01-31 17:06:36,301 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:36,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:36,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:36,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:36,302 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:36,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:36,417 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:06:36,417 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:36,417 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:06:36,417 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:06:36,417 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [20], [21] [2019-01-31 17:06:36,418 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:06:36,418 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:06:36,422 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:06:36,423 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-01-31 17:06:36,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:36,423 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:06:36,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:36,423 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:06:36,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:36,435 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:06:36,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:36,439 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:06:36,449 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-01-31 17:06:36,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:36,456 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-01-31 17:06:36,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:36,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:36,461 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-01-31 17:06:36,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:36,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:36,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:36,477 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-01-31 17:06:36,477 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:36,499 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:36,509 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:36,516 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:36,530 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:36,531 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-31 17:06:36,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:36,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:36,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:36,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:36,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:36,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:36,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:36,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-01-31 17:06:36,557 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:36,583 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:36,583 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-31 17:06:36,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:36,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:36,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:36,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:36,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:36,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:36,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:36,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:36,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:36,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 33 treesize of output 59 [2019-01-31 17:06:36,615 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:36,648 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:36,648 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-31 17:06:36,665 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:36,665 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:06:36,719 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:36,737 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:06:36,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:06:36,738 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:06:36,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:06:36,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:06:36,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:06:36,738 INFO L87 Difference]: Start difference. First operand 36 states and 127 transitions. Second operand 8 states. [2019-01-31 17:06:36,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:36,986 INFO L93 Difference]: Finished difference Result 56 states and 161 transitions. [2019-01-31 17:06:36,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:06:36,987 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-31 17:06:36,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:36,988 INFO L225 Difference]: With dead ends: 56 [2019-01-31 17:06:36,989 INFO L226 Difference]: Without dead ends: 55 [2019-01-31 17:06:36,989 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-01-31 17:06:36,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-31 17:06:37,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 39. [2019-01-31 17:06:37,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-31 17:06:37,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 142 transitions. [2019-01-31 17:06:37,001 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 142 transitions. Word has length 5 [2019-01-31 17:06:37,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:37,001 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 142 transitions. [2019-01-31 17:06:37,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:06:37,001 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 142 transitions. [2019-01-31 17:06:37,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:06:37,002 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:37,002 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:06:37,002 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:37,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:37,003 INFO L82 PathProgramCache]: Analyzing trace with hash 29111902, now seen corresponding path program 1 times [2019-01-31 17:06:37,003 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:37,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:37,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:37,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:37,004 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:37,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:37,134 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:37,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:37,135 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:06:37,135 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:06:37,135 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [19] [2019-01-31 17:06:37,136 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:06:37,137 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:06:37,141 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:06:37,141 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-01-31 17:06:37,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:37,141 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:06:37,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:37,142 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:06:37,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:37,155 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:06:37,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:37,161 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:06:37,165 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-01-31 17:06:37,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:37,174 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-01-31 17:06:37,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:37,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:37,178 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-01-31 17:06:37,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:37,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:37,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:37,186 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-31 17:06:37,186 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:37,216 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:37,225 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:37,233 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:37,248 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:37,248 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-31 17:06:37,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:37,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:37,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:37,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:37,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:37,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:37,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:37,309 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-31 17:06:37,310 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:37,335 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:37,336 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-31 17:06:37,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:37,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:37,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:37,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:37,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:37,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:37,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:37,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:37,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:37,378 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-31 17:06:37,378 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:37,407 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:37,407 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-31 17:06:37,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:37,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:37,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:37,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:37,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:37,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:37,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:37,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:37,444 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:06:37,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:37,447 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 72 [2019-01-31 17:06:37,448 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:37,487 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:37,488 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-01-31 17:06:37,503 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:37,504 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:06:37,541 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:37,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:06:37,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-31 17:06:37,561 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:06:37,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:06:37,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:06:37,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:06:37,562 INFO L87 Difference]: Start difference. First operand 39 states and 142 transitions. Second operand 10 states. [2019-01-31 17:06:38,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:38,090 INFO L93 Difference]: Finished difference Result 76 states and 212 transitions. [2019-01-31 17:06:38,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:06:38,090 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-31 17:06:38,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:38,092 INFO L225 Difference]: With dead ends: 76 [2019-01-31 17:06:38,092 INFO L226 Difference]: Without dead ends: 75 [2019-01-31 17:06:38,092 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-01-31 17:06:38,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-01-31 17:06:38,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 41. [2019-01-31 17:06:38,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-31 17:06:38,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 152 transitions. [2019-01-31 17:06:38,104 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 152 transitions. Word has length 5 [2019-01-31 17:06:38,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:38,104 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 152 transitions. [2019-01-31 17:06:38,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:06:38,104 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 152 transitions. [2019-01-31 17:06:38,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:06:38,105 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:38,105 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:06:38,105 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:38,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:38,106 INFO L82 PathProgramCache]: Analyzing trace with hash 29115870, now seen corresponding path program 1 times [2019-01-31 17:06:38,106 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:38,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:38,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:38,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:38,107 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:38,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:38,274 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:38,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:38,274 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:06:38,274 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:06:38,274 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [16], [19] [2019-01-31 17:06:38,276 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:06:38,276 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:06:38,280 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:06:38,281 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-01-31 17:06:38,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:38,281 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:06:38,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:38,281 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:06:38,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:38,291 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:06:38,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:38,296 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:06:38,299 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-01-31 17:06:38,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:38,304 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-01-31 17:06:38,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:38,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:38,311 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-01-31 17:06:38,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:38,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:38,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:38,320 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-01-31 17:06:38,321 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:38,367 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:38,374 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:38,382 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:38,395 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:38,395 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-01-31 17:06:38,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:38,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:38,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:38,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:38,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:38,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:38,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:38,431 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-31 17:06:38,431 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:38,456 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:38,456 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-31 17:06:38,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:38,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:38,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:38,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:38,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:38,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:38,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:38,491 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:06:38,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 33 treesize of output 60 [2019-01-31 17:06:38,493 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:38,523 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:38,524 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:30 [2019-01-31 17:06:38,735 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-01-31 17:06:38,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:38,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:38,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:38,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:38,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:38,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:38,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:38,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:38,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:38,830 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 69 [2019-01-31 17:06:38,831 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:38,877 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:38,877 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-31 17:06:38,899 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:38,899 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:06:38,940 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:38,959 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:06:38,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-31 17:06:38,959 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:06:38,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:06:38,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:06:38,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:06:38,960 INFO L87 Difference]: Start difference. First operand 41 states and 152 transitions. Second operand 10 states. [2019-01-31 17:06:39,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:39,485 INFO L93 Difference]: Finished difference Result 67 states and 187 transitions. [2019-01-31 17:06:39,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:06:39,486 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-31 17:06:39,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:39,487 INFO L225 Difference]: With dead ends: 67 [2019-01-31 17:06:39,487 INFO L226 Difference]: Without dead ends: 65 [2019-01-31 17:06:39,488 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-31 17:06:39,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-31 17:06:39,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 39. [2019-01-31 17:06:39,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-31 17:06:39,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 142 transitions. [2019-01-31 17:06:39,499 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 142 transitions. Word has length 5 [2019-01-31 17:06:39,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:39,499 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 142 transitions. [2019-01-31 17:06:39,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:06:39,499 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 142 transitions. [2019-01-31 17:06:39,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:06:39,500 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:39,500 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:06:39,500 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:39,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:39,501 INFO L82 PathProgramCache]: Analyzing trace with hash 29119902, now seen corresponding path program 1 times [2019-01-31 17:06:39,501 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:39,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:39,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:39,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:39,502 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:39,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:39,618 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:39,619 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:39,619 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:06:39,619 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:06:39,619 INFO L207 CegarAbsIntRunner]: [0], [14], [16], [20], [21] [2019-01-31 17:06:39,620 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:06:39,620 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:06:39,624 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:06:39,624 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-01-31 17:06:39,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:39,625 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:06:39,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:39,625 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:06:39,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:39,634 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:06:39,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:39,647 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:06:39,668 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-31 17:06:39,694 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-01-31 17:06:39,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:39,705 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-01-31 17:06:39,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:39,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:39,719 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-01-31 17:06:39,719 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:39,742 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:39,755 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:39,768 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:39,783 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:39,783 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:22, output treesize:27 [2019-01-31 17:06:39,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:39,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:39,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:39,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:39,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-01-31 17:06:39,827 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:39,853 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:39,853 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-31 17:06:39,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:39,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:39,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:39,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:39,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:39,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:39,897 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-31 17:06:39,897 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:39,928 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:39,929 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-01-31 17:06:39,951 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:39,951 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:06:40,014 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:40,038 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:06:40,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:06:40,039 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:06:40,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:06:40,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:06:40,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:06:40,039 INFO L87 Difference]: Start difference. First operand 39 states and 142 transitions. Second operand 8 states. [2019-01-31 17:06:40,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:40,252 INFO L93 Difference]: Finished difference Result 58 states and 171 transitions. [2019-01-31 17:06:40,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:06:40,253 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-31 17:06:40,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:40,254 INFO L225 Difference]: With dead ends: 58 [2019-01-31 17:06:40,254 INFO L226 Difference]: Without dead ends: 57 [2019-01-31 17:06:40,254 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:06:40,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-01-31 17:06:40,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 41. [2019-01-31 17:06:40,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-31 17:06:40,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 152 transitions. [2019-01-31 17:06:40,266 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 152 transitions. Word has length 5 [2019-01-31 17:06:40,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:40,266 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 152 transitions. [2019-01-31 17:06:40,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:06:40,266 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 152 transitions. [2019-01-31 17:06:40,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:06:40,267 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:40,267 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:06:40,267 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:40,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:40,268 INFO L82 PathProgramCache]: Analyzing trace with hash 28823602, now seen corresponding path program 2 times [2019-01-31 17:06:40,268 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:40,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:40,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:40,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:40,269 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:40,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:40,404 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:40,405 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:40,405 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:06:40,405 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:06:40,405 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:06:40,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:40,406 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:06:40,416 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:06:40,416 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:06:40,422 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-31 17:06:40,422 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:06:40,423 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:06:40,430 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-01-31 17:06:40,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:40,434 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-01-31 17:06:40,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:40,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:40,446 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-01-31 17:06:40,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:40,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:40,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:40,456 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-01-31 17:06:40,456 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:40,480 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:40,492 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:40,501 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:40,513 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:40,513 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-31 17:06:40,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:40,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:40,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:40,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:40,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:40,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:40,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:40,540 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-31 17:06:40,541 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:40,582 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:40,582 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-31 17:06:40,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:40,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:40,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:40,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:40,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:40,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:40,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:40,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:40,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:40,639 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-31 17:06:40,640 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:40,666 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:40,666 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-31 17:06:40,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:40,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:40,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:40,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:40,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:40,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:40,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:40,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:40,695 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:06:40,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:40,698 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 72 [2019-01-31 17:06:40,699 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:40,750 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:40,751 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-01-31 17:06:40,766 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:40,767 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:06:40,802 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:40,820 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:06:40,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-31 17:06:40,821 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:06:40,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:06:40,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:06:40,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:06:40,821 INFO L87 Difference]: Start difference. First operand 41 states and 152 transitions. Second operand 10 states. [2019-01-31 17:06:41,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:41,184 INFO L93 Difference]: Finished difference Result 71 states and 199 transitions. [2019-01-31 17:06:41,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:06:41,187 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-31 17:06:41,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:41,188 INFO L225 Difference]: With dead ends: 71 [2019-01-31 17:06:41,188 INFO L226 Difference]: Without dead ends: 70 [2019-01-31 17:06:41,189 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-01-31 17:06:41,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-01-31 17:06:41,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 30. [2019-01-31 17:06:41,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-31 17:06:41,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 97 transitions. [2019-01-31 17:06:41,198 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 97 transitions. Word has length 5 [2019-01-31 17:06:41,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:41,199 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 97 transitions. [2019-01-31 17:06:41,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:06:41,199 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 97 transitions. [2019-01-31 17:06:41,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:06:41,199 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:41,199 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:06:41,200 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:41,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:41,200 INFO L82 PathProgramCache]: Analyzing trace with hash 28827822, now seen corresponding path program 1 times [2019-01-31 17:06:41,200 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:41,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:41,201 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:06:41,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:41,201 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:41,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:41,250 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:06:41,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 17:06:41,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-31 17:06:41,250 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:06:41,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-31 17:06:41,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-31 17:06:41,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-31 17:06:41,251 INFO L87 Difference]: Start difference. First operand 30 states and 97 transitions. Second operand 4 states. [2019-01-31 17:06:41,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:41,548 INFO L93 Difference]: Finished difference Result 36 states and 106 transitions. [2019-01-31 17:06:41,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 17:06:41,549 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-31 17:06:41,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:41,549 INFO L225 Difference]: With dead ends: 36 [2019-01-31 17:06:41,549 INFO L226 Difference]: Without dead ends: 33 [2019-01-31 17:06:41,550 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-01-31 17:06:41,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-01-31 17:06:41,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2019-01-31 17:06:41,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-31 17:06:41,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 99 transitions. [2019-01-31 17:06:41,560 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 99 transitions. Word has length 5 [2019-01-31 17:06:41,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:41,560 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 99 transitions. [2019-01-31 17:06:41,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-31 17:06:41,561 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 99 transitions. [2019-01-31 17:06:41,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:06:41,561 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:41,561 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:06:41,561 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:41,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:41,562 INFO L82 PathProgramCache]: Analyzing trace with hash 28818148, now seen corresponding path program 1 times [2019-01-31 17:06:41,562 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:41,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:41,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:41,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:41,566 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:41,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:41,675 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:41,676 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:41,676 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:06:41,676 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:06:41,676 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [21] [2019-01-31 17:06:41,678 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:06:41,678 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:06:41,681 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:06:41,681 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-01-31 17:06:41,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:41,682 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:06:41,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:41,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 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:06:41,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:41,690 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:06:41,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:41,699 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:06:41,702 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-31 17:06:41,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:41,707 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-01-31 17:06:41,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:41,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:41,719 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-01-31 17:06:41,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:41,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:41,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:41,731 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-01-31 17:06:41,731 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:41,755 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:41,767 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:41,775 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:41,790 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:41,790 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:25, output treesize:30 [2019-01-31 17:06:41,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:41,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:41,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:41,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:41,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:41,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:41,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:41,814 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-31 17:06:41,815 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:41,844 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:41,844 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-31 17:06:41,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:41,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:41,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:41,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:41,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:41,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:41,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:41,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:41,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:41,871 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-01-31 17:06:41,871 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:42,286 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:42,286 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-31 17:06:42,352 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:42,352 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:06:42,366 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:42,386 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:06:42,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-31 17:06:42,386 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:06:42,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:06:42,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:06:42,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-01-31 17:06:42,387 INFO L87 Difference]: Start difference. First operand 29 states and 99 transitions. Second operand 8 states. [2019-01-31 17:06:42,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:42,623 INFO L93 Difference]: Finished difference Result 44 states and 125 transitions. [2019-01-31 17:06:42,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:06:42,624 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-31 17:06:42,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:42,624 INFO L225 Difference]: With dead ends: 44 [2019-01-31 17:06:42,625 INFO L226 Difference]: Without dead ends: 43 [2019-01-31 17:06:42,625 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:06:42,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-01-31 17:06:42,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 32. [2019-01-31 17:06:42,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-31 17:06:42,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 114 transitions. [2019-01-31 17:06:42,635 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 114 transitions. Word has length 5 [2019-01-31 17:06:42,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:42,636 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 114 transitions. [2019-01-31 17:06:42,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:06:42,636 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 114 transitions. [2019-01-31 17:06:42,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:06:42,636 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:42,636 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:06:42,636 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:42,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:42,637 INFO L82 PathProgramCache]: Analyzing trace with hash 28821992, now seen corresponding path program 1 times [2019-01-31 17:06:42,637 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:42,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:42,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:42,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:42,638 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:42,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:42,868 WARN L181 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 17 [2019-01-31 17:06:42,899 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:06:42,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:42,899 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:06:42,900 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:06:42,900 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [20], [21] [2019-01-31 17:06:42,900 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:06:42,901 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:06:42,904 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:06:42,905 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-01-31 17:06:42,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:42,905 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:06:42,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:42,905 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:06:42,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:42,926 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:06:42,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:42,931 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:06:42,934 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-31 17:06:42,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:42,936 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-31 17:06:42,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:42,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:42,946 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-01-31 17:06:42,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:42,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:42,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:42,964 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-01-31 17:06:42,965 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:42,983 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:42,993 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:43,001 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:43,015 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:43,016 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-31 17:06:43,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:43,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:43,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:43,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:43,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:43,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:43,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:43,047 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-31 17:06:43,048 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:43,077 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:43,077 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-31 17:06:43,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:43,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:43,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:43,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:43,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:43,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:43,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:43,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:43,138 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:06:43,139 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 59 [2019-01-31 17:06:43,140 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:43,306 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:43,306 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-31 17:06:43,326 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:43,326 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:06:43,347 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:43,365 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:06:43,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:06:43,365 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:06:43,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:06:43,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:06:43,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:06:43,366 INFO L87 Difference]: Start difference. First operand 32 states and 114 transitions. Second operand 8 states. [2019-01-31 17:06:43,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:43,653 INFO L93 Difference]: Finished difference Result 49 states and 142 transitions. [2019-01-31 17:06:43,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:06:43,653 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-31 17:06:43,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:43,654 INFO L225 Difference]: With dead ends: 49 [2019-01-31 17:06:43,654 INFO L226 Difference]: Without dead ends: 48 [2019-01-31 17:06:43,655 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:06:43,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-01-31 17:06:43,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 34. [2019-01-31 17:06:43,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-01-31 17:06:43,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 124 transitions. [2019-01-31 17:06:43,667 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 124 transitions. Word has length 5 [2019-01-31 17:06:43,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:43,667 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 124 transitions. [2019-01-31 17:06:43,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:06:43,668 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 124 transitions. [2019-01-31 17:06:43,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:06:43,668 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:43,668 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:06:43,669 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:43,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:43,669 INFO L82 PathProgramCache]: Analyzing trace with hash 28933468, now seen corresponding path program 2 times [2019-01-31 17:06:43,669 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:43,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:43,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:43,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:43,670 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:43,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:43,913 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 14 [2019-01-31 17:06:43,921 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:43,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:43,921 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:06:43,921 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:06:43,921 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:06:43,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:43,921 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:06:43,931 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:06:43,931 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:06:43,935 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-31 17:06:43,936 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:06:43,937 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:06:43,944 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-01-31 17:06:43,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:43,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-01-31 17:06:43,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:43,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:43,967 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-01-31 17:06:43,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:43,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:43,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:43,974 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-01-31 17:06:43,974 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:43,991 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:44,001 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:44,008 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:44,020 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:44,021 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:25, output treesize:30 [2019-01-31 17:06:44,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:44,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:44,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:44,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:44,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:44,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:44,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:44,208 INFO L303 Elim1Store]: Index analysis took 174 ms [2019-01-31 17:06:44,209 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-31 17:06:44,210 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:44,527 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:44,528 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-31 17:06:44,741 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-01-31 17:06:44,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:44,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:44,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:44,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:44,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:44,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:44,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:44,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:44,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:44,981 INFO L303 Elim1Store]: Index analysis took 230 ms [2019-01-31 17:06:44,982 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-01-31 17:06:44,982 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:45,107 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:45,108 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-31 17:06:45,125 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:45,125 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:06:45,160 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:45,179 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:06:45,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:06:45,179 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:06:45,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:06:45,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:06:45,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:06:45,180 INFO L87 Difference]: Start difference. First operand 34 states and 124 transitions. Second operand 8 states. [2019-01-31 17:06:45,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:45,681 INFO L93 Difference]: Finished difference Result 58 states and 161 transitions. [2019-01-31 17:06:45,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:06:45,684 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-31 17:06:45,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:45,685 INFO L225 Difference]: With dead ends: 58 [2019-01-31 17:06:45,685 INFO L226 Difference]: Without dead ends: 57 [2019-01-31 17:06:45,685 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-31 17:06:45,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-01-31 17:06:45,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 36. [2019-01-31 17:06:45,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-31 17:06:45,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 134 transitions. [2019-01-31 17:06:45,699 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 134 transitions. Word has length 5 [2019-01-31 17:06:45,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:45,699 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 134 transitions. [2019-01-31 17:06:45,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:06:45,699 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 134 transitions. [2019-01-31 17:06:45,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:06:45,700 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:45,700 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:06:45,701 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:45,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:45,701 INFO L82 PathProgramCache]: Analyzing trace with hash 28941156, now seen corresponding path program 1 times [2019-01-31 17:06:45,701 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:45,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:45,702 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:06:45,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:45,702 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:45,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:45,820 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:45,820 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:45,820 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:06:45,820 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:06:45,820 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [20], [21] [2019-01-31 17:06:45,822 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:06:45,822 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:06:45,825 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:06:45,825 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-01-31 17:06:45,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:45,826 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:06:45,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:45,826 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:06:45,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:45,842 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:06:45,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:45,860 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:06:45,862 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-01-31 17:06:45,866 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-01-31 17:06:45,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:45,874 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-01-31 17:06:45,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:45,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:45,885 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-01-31 17:06:45,885 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:45,897 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:45,905 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:45,914 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:45,926 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:45,926 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:22, output treesize:27 [2019-01-31 17:06:45,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:45,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:45,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:45,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:45,966 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-01-31 17:06:45,966 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:45,982 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:45,982 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-31 17:06:46,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:46,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:46,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:46,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:46,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:46,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:46,032 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-31 17:06:46,033 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:46,052 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:46,053 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-01-31 17:06:46,066 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:46,066 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:06:46,086 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:46,106 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:06:46,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:06:46,106 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:06:46,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:06:46,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:06:46,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:06:46,107 INFO L87 Difference]: Start difference. First operand 36 states and 134 transitions. Second operand 8 states. [2019-01-31 17:06:46,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:46,359 INFO L93 Difference]: Finished difference Result 59 states and 162 transitions. [2019-01-31 17:06:46,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:06:46,360 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-31 17:06:46,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:46,361 INFO L225 Difference]: With dead ends: 59 [2019-01-31 17:06:46,362 INFO L226 Difference]: Without dead ends: 58 [2019-01-31 17:06:46,362 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-31 17:06:46,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-01-31 17:06:46,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 37. [2019-01-31 17:06:46,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-31 17:06:46,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 139 transitions. [2019-01-31 17:06:46,376 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 139 transitions. Word has length 5 [2019-01-31 17:06:46,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:46,376 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 139 transitions. [2019-01-31 17:06:46,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:06:46,377 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 139 transitions. [2019-01-31 17:06:46,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:06:46,377 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:46,377 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:06:46,378 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:46,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:46,378 INFO L82 PathProgramCache]: Analyzing trace with hash 29066150, now seen corresponding path program 1 times [2019-01-31 17:06:46,378 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:46,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:46,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:46,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:46,380 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:46,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:46,412 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:46,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:46,412 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:06:46,413 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:06:46,413 INFO L207 CegarAbsIntRunner]: [0], [14], [20], [22], [23] [2019-01-31 17:06:46,414 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:06:46,414 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:06:46,418 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:06:46,418 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-01-31 17:06:46,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:46,419 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:06:46,419 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:46,419 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:06:46,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:46,427 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:06:46,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:46,433 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:06:46,436 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-01-31 17:06:46,440 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-01-31 17:06:46,458 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-01-31 17:06:46,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:46,470 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-01-31 17:06:46,470 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:46,481 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:46,498 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:46,508 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:46,519 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:46,519 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:19, output treesize:24 [2019-01-31 17:06:46,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:46,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:46,545 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-31 17:06:46,545 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:46,554 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:46,554 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:14 [2019-01-31 17:06:46,564 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:46,565 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:06:46,568 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:46,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-31 17:06:46,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-01-31 17:06:46,586 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:06:46,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-31 17:06:46,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-31 17:06:46,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-31 17:06:46,587 INFO L87 Difference]: Start difference. First operand 37 states and 139 transitions. Second operand 4 states. [2019-01-31 17:06:46,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:46,856 INFO L93 Difference]: Finished difference Result 74 states and 262 transitions. [2019-01-31 17:06:46,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-31 17:06:46,856 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-31 17:06:46,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:46,857 INFO L225 Difference]: With dead ends: 74 [2019-01-31 17:06:46,857 INFO L226 Difference]: Without dead ends: 73 [2019-01-31 17:06:46,858 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-01-31 17:06:46,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-01-31 17:06:46,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 59. [2019-01-31 17:06:46,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-31 17:06:46,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 250 transitions. [2019-01-31 17:06:46,880 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 250 transitions. Word has length 5 [2019-01-31 17:06:46,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:46,880 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 250 transitions. [2019-01-31 17:06:46,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-31 17:06:46,880 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 250 transitions. [2019-01-31 17:06:46,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:06:46,881 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:46,881 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:06:46,882 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:46,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:46,882 INFO L82 PathProgramCache]: Analyzing trace with hash 29052506, now seen corresponding path program 1 times [2019-01-31 17:06:46,882 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:46,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:46,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:46,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:46,883 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:46,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:47,202 WARN L181 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2019-01-31 17:06:47,267 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:47,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:47,268 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:06:47,268 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:06:47,268 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [16], [19] [2019-01-31 17:06:47,270 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:06:47,270 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:06:47,273 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:06:47,273 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-01-31 17:06:47,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:47,274 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:06:47,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:47,274 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:06:47,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:47,282 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:06:47,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:47,287 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:06:47,290 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-31 17:06:47,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:47,293 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-01-31 17:06:47,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:47,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:47,309 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-01-31 17:06:47,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:47,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:47,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:47,319 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-01-31 17:06:47,320 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:47,337 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:47,347 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:47,354 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:47,368 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:47,368 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-31 17:06:47,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:47,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:47,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:47,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:47,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:47,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:47,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:47,393 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-31 17:06:47,394 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:47,421 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:47,421 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-31 17:06:47,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:47,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:47,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:47,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:47,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:47,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:47,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:47,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:47,446 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:06:47,447 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 59 [2019-01-31 17:06:47,448 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:47,477 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:47,478 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-31 17:06:47,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:47,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:47,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:47,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:47,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:47,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:47,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:47,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:47,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:47,715 INFO L303 Elim1Store]: Index analysis took 221 ms [2019-01-31 17:06:47,716 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-31 17:06:47,717 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:47,766 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:47,766 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-31 17:06:47,782 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:47,782 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:06:47,808 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:47,827 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:06:47,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-31 17:06:47,827 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:06:47,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:06:47,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:06:47,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=90, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:06:47,828 INFO L87 Difference]: Start difference. First operand 59 states and 250 transitions. Second operand 10 states. [2019-01-31 17:06:48,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:48,234 INFO L93 Difference]: Finished difference Result 105 states and 359 transitions. [2019-01-31 17:06:48,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 17:06:48,235 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-31 17:06:48,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:48,236 INFO L225 Difference]: With dead ends: 105 [2019-01-31 17:06:48,236 INFO L226 Difference]: Without dead ends: 97 [2019-01-31 17:06:48,237 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2019-01-31 17:06:48,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-01-31 17:06:48,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 71. [2019-01-31 17:06:48,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-31 17:06:48,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 308 transitions. [2019-01-31 17:06:48,256 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 308 transitions. Word has length 5 [2019-01-31 17:06:48,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:48,256 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 308 transitions. [2019-01-31 17:06:48,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:06:48,256 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 308 transitions. [2019-01-31 17:06:48,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:06:48,256 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:48,256 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-01-31 17:06:48,257 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:48,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:48,257 INFO L82 PathProgramCache]: Analyzing trace with hash 902776598, now seen corresponding path program 1 times [2019-01-31 17:06:48,257 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:48,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:48,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:48,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:48,258 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:48,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:48,389 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:06:48,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:48,390 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:06:48,390 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:06:48,391 INFO L207 CegarAbsIntRunner]: [0], [16], [20], [22], [23] [2019-01-31 17:06:48,393 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:06:48,393 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:06:48,396 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:06:48,396 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-01-31 17:06:48,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:48,396 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:06:48,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:48,396 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:06:48,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:48,413 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:06:48,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:48,418 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:06:48,437 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-01-31 17:06:48,440 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-01-31 17:06:48,446 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-01-31 17:06:48,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:48,470 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-01-31 17:06:48,471 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:48,477 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:48,484 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:48,492 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:48,504 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:48,504 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:19, output treesize:24 [2019-01-31 17:06:48,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:48,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:48,606 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2019-01-31 17:06:48,606 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:48,709 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:48,710 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2019-01-31 17:06:48,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:48,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:48,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:48,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:48,974 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-01-31 17:06:48,975 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:48,990 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:48,990 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:14 [2019-01-31 17:06:49,000 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:49,001 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:06:49,059 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:49,077 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:06:49,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-01-31 17:06:49,078 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:06:49,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-31 17:06:49,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-31 17:06:49,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-01-31 17:06:49,079 INFO L87 Difference]: Start difference. First operand 71 states and 308 transitions. Second operand 7 states. [2019-01-31 17:06:49,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:49,233 INFO L93 Difference]: Finished difference Result 85 states and 324 transitions. [2019-01-31 17:06:49,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:06:49,233 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-01-31 17:06:49,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:49,235 INFO L225 Difference]: With dead ends: 85 [2019-01-31 17:06:49,235 INFO L226 Difference]: Without dead ends: 80 [2019-01-31 17:06:49,236 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-01-31 17:06:49,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-01-31 17:06:49,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 71. [2019-01-31 17:06:49,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-31 17:06:49,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 307 transitions. [2019-01-31 17:06:49,255 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 307 transitions. Word has length 6 [2019-01-31 17:06:49,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:49,256 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 307 transitions. [2019-01-31 17:06:49,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-31 17:06:49,256 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 307 transitions. [2019-01-31 17:06:49,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:06:49,256 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:49,257 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:06:49,257 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:49,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:49,257 INFO L82 PathProgramCache]: Analyzing trace with hash 902478688, now seen corresponding path program 1 times [2019-01-31 17:06:49,257 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:49,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:49,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:49,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:49,258 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:49,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:49,355 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:49,355 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:49,355 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:06:49,355 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:06:49,356 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [20], [22], [23] [2019-01-31 17:06:49,357 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:06:49,357 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:06:49,362 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:06:49,362 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-01-31 17:06:49,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:49,363 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:06:49,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:49,363 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:06:49,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:49,385 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:06:49,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:49,391 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:06:49,395 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-31 17:06:49,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:49,401 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-01-31 17:06:49,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:49,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:49,408 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-01-31 17:06:49,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:49,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:49,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:49,415 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-01-31 17:06:49,416 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:49,482 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:49,500 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:49,509 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:49,523 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:49,523 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-31 17:06:49,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:49,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:49,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:49,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:49,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:49,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:49,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:49,619 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-31 17:06:49,620 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:49,644 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:49,644 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-31 17:06:49,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:49,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:49,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:49,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:49,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:49,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:49,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:49,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:49,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:49,681 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-31 17:06:49,682 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:49,712 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:49,712 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-31 17:06:49,730 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:49,730 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:06:49,762 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:49,780 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:06:49,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:06:49,781 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:06:49,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:06:49,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:06:49,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:06:49,781 INFO L87 Difference]: Start difference. First operand 71 states and 307 transitions. Second operand 8 states. [2019-01-31 17:06:50,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:50,056 INFO L93 Difference]: Finished difference Result 83 states and 322 transitions. [2019-01-31 17:06:50,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:06:50,056 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-31 17:06:50,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:50,057 INFO L225 Difference]: With dead ends: 83 [2019-01-31 17:06:50,057 INFO L226 Difference]: Without dead ends: 82 [2019-01-31 17:06:50,058 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-01-31 17:06:50,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-01-31 17:06:50,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 71. [2019-01-31 17:06:50,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-31 17:06:50,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 307 transitions. [2019-01-31 17:06:50,075 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 307 transitions. Word has length 6 [2019-01-31 17:06:50,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:50,075 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 307 transitions. [2019-01-31 17:06:50,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:06:50,075 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 307 transitions. [2019-01-31 17:06:50,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:06:50,075 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:50,075 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:06:50,076 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:50,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:50,076 INFO L82 PathProgramCache]: Analyzing trace with hash 902469014, now seen corresponding path program 1 times [2019-01-31 17:06:50,076 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:50,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:50,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:50,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:50,077 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:50,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:50,259 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:06:50,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:50,259 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:06:50,260 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:06:50,260 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [20], [21] [2019-01-31 17:06:50,261 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:06:50,261 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:06:50,264 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:06:50,264 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-01-31 17:06:50,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:50,264 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:06:50,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:50,265 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:06:50,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:50,278 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:06:50,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:50,283 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:06:50,285 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-31 17:06:50,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:50,288 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-01-31 17:06:50,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:50,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:50,299 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-01-31 17:06:50,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:50,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:50,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:50,304 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-01-31 17:06:50,304 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:50,320 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:50,329 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:50,337 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:50,351 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:50,351 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-31 17:06:50,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:50,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:50,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:50,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:50,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:50,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:50,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:50,376 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-31 17:06:50,377 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:50,401 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:50,401 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-31 17:06:50,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:50,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:50,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:50,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:50,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:50,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:50,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:50,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:50,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:50,451 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-31 17:06:50,452 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:50,480 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:50,481 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-31 17:06:50,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:50,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:50,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:50,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:50,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:50,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:50,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:50,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:50,510 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:06:50,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:50,511 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 72 [2019-01-31 17:06:50,512 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:50,546 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:50,546 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-01-31 17:06:50,565 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:50,565 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:06:50,662 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:50,681 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:06:50,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-31 17:06:50,681 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:06:50,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:06:50,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:06:50,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=92, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:06:50,682 INFO L87 Difference]: Start difference. First operand 71 states and 307 transitions. Second operand 10 states. [2019-01-31 17:06:51,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:51,051 INFO L93 Difference]: Finished difference Result 97 states and 346 transitions. [2019-01-31 17:06:51,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 17:06:51,052 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-31 17:06:51,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:51,053 INFO L225 Difference]: With dead ends: 97 [2019-01-31 17:06:51,053 INFO L226 Difference]: Without dead ends: 96 [2019-01-31 17:06:51,054 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-01-31 17:06:51,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-01-31 17:06:51,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 71. [2019-01-31 17:06:51,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-31 17:06:51,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 307 transitions. [2019-01-31 17:06:51,072 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 307 transitions. Word has length 6 [2019-01-31 17:06:51,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:51,072 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 307 transitions. [2019-01-31 17:06:51,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:06:51,073 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 307 transitions. [2019-01-31 17:06:51,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:06:51,073 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:51,073 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:06:51,074 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:51,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:51,074 INFO L82 PathProgramCache]: Analyzing trace with hash 902472858, now seen corresponding path program 1 times [2019-01-31 17:06:51,074 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:51,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:51,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:51,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:51,075 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:51,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:51,231 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:06:51,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:51,231 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:06:51,231 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:06:51,231 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [16], [20], [21] [2019-01-31 17:06:51,232 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:06:51,232 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:06:51,234 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:06:51,235 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-01-31 17:06:51,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:51,235 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:06:51,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:51,236 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:06:51,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:51,246 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:06:51,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:51,251 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:06:51,254 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-01-31 17:06:51,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:51,261 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-01-31 17:06:51,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:51,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:51,266 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-01-31 17:06:51,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:51,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:51,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:51,273 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-01-31 17:06:51,273 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:51,288 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:51,295 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:51,303 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:51,316 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:51,317 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-01-31 17:06:51,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:51,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:51,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:51,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:51,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:51,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:51,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:51,344 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-31 17:06:51,345 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:51,370 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:51,371 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-31 17:06:51,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:51,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:51,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:51,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:51,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:51,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:51,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:51,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:51,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:51,445 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-31 17:06:51,446 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:51,476 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:51,476 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-31 17:06:51,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:51,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:51,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:51,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:51,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:51,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:51,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:51,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:51,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:51,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:51,510 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:06:51,511 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-01-31 17:06:51,512 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:51,545 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:51,545 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-31 17:06:51,565 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:51,565 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:06:51,609 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:51,628 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:06:51,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-31 17:06:51,628 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:06:51,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:06:51,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:06:51,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:06:51,629 INFO L87 Difference]: Start difference. First operand 71 states and 307 transitions. Second operand 10 states. [2019-01-31 17:06:52,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:52,043 INFO L93 Difference]: Finished difference Result 102 states and 389 transitions. [2019-01-31 17:06:52,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:06:52,044 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-31 17:06:52,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:52,045 INFO L225 Difference]: With dead ends: 102 [2019-01-31 17:06:52,045 INFO L226 Difference]: Without dead ends: 101 [2019-01-31 17:06:52,045 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2019-01-31 17:06:52,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-01-31 17:06:52,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 81. [2019-01-31 17:06:52,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-01-31 17:06:52,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 357 transitions. [2019-01-31 17:06:52,079 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 357 transitions. Word has length 6 [2019-01-31 17:06:52,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:52,079 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 357 transitions. [2019-01-31 17:06:52,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:06:52,079 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 357 transitions. [2019-01-31 17:06:52,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:06:52,080 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:52,080 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:06:52,080 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:52,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:52,081 INFO L82 PathProgramCache]: Analyzing trace with hash 902592022, now seen corresponding path program 1 times [2019-01-31 17:06:52,081 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:52,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:52,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:52,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:52,082 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:52,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:52,372 WARN L181 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 17 [2019-01-31 17:06:52,419 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:52,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:52,420 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:06:52,420 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:06:52,420 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [16], [20], [21] [2019-01-31 17:06:52,422 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:06:52,422 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:06:52,425 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:06:52,425 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-01-31 17:06:52,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:52,425 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:06:52,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:52,426 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:06:52,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:52,435 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:06:52,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:52,441 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:06:52,445 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-01-31 17:06:52,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, 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-01-31 17:06:52,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:52,455 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-01-31 17:06:52,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:52,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:52,462 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-01-31 17:06:52,462 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:52,478 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:52,487 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:52,495 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:52,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-01-31 17:06:52,508 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:22, output treesize:27 [2019-01-31 17:06:52,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:52,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:52,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:52,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:52,542 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-31 17:06:52,542 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:52,555 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:52,556 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-31 17:06:52,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:52,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:52,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:52,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:52,579 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:06:52,580 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-01-31 17:06:52,580 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:52,599 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:52,599 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:22 [2019-01-31 17:06:52,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:52,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:52,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:52,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:52,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:52,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:52,625 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-01-31 17:06:52,625 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:52,643 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:52,643 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:26 [2019-01-31 17:06:52,659 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:52,660 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:06:52,696 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:52,716 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:06:52,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-31 17:06:52,716 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:06:52,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:06:52,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:06:52,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:06:52,717 INFO L87 Difference]: Start difference. First operand 81 states and 357 transitions. Second operand 10 states. [2019-01-31 17:06:53,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:53,167 INFO L93 Difference]: Finished difference Result 108 states and 386 transitions. [2019-01-31 17:06:53,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:06:53,167 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-31 17:06:53,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:53,169 INFO L225 Difference]: With dead ends: 108 [2019-01-31 17:06:53,169 INFO L226 Difference]: Without dead ends: 107 [2019-01-31 17:06:53,169 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:06:53,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-01-31 17:06:53,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 77. [2019-01-31 17:06:53,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-31 17:06:53,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 337 transitions. [2019-01-31 17:06:53,194 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 337 transitions. Word has length 6 [2019-01-31 17:06:53,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:53,195 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 337 transitions. [2019-01-31 17:06:53,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:06:53,195 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 337 transitions. [2019-01-31 17:06:53,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:06:53,196 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:53,196 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:06:53,196 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:53,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:53,196 INFO L82 PathProgramCache]: Analyzing trace with hash 902591586, now seen corresponding path program 1 times [2019-01-31 17:06:53,196 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:53,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:53,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:53,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:53,197 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:53,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:53,344 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:53,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:53,344 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:06:53,344 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:06:53,344 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [16], [19] [2019-01-31 17:06:53,345 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:06:53,345 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:06:53,348 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:06:53,348 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-01-31 17:06:53,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:53,348 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:06:53,349 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:53,349 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:06:53,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:53,361 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:06:53,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:53,367 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:06:53,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-01-31 17:06:53,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:53,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-01-31 17:06:53,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:53,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:53,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-01-31 17:06:53,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:53,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:53,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:53,393 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-01-31 17:06:53,394 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:53,416 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:53,426 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:53,434 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:53,449 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:53,449 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-01-31 17:06:53,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:53,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:53,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:53,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:53,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:53,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:53,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:53,621 INFO L303 Elim1Store]: Index analysis took 152 ms [2019-01-31 17:06:53,622 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-31 17:06:53,622 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:53,663 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:53,663 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-31 17:06:53,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:53,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:53,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:53,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:53,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:53,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:53,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:53,693 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:06:53,694 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 60 [2019-01-31 17:06:53,695 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:53,723 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:53,724 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:30 [2019-01-31 17:06:53,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:53,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:53,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:53,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:53,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:53,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:53,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:53,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:53,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:53,756 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 69 [2019-01-31 17:06:53,757 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:53,786 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:53,787 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-31 17:06:53,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:53,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:53,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:53,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:53,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:53,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:53,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:53,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:53,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:53,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:53,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:53,821 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:06:53,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, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 75 [2019-01-31 17:06:53,822 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:53,863 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:53,863 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-31 17:06:53,942 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:53,943 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:06:54,036 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:54,056 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:06:54,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-31 17:06:54,056 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:06:54,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-31 17:06:54,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-31 17:06:54,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:06:54,057 INFO L87 Difference]: Start difference. First operand 77 states and 337 transitions. Second operand 12 states. [2019-01-31 17:06:55,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:55,682 INFO L93 Difference]: Finished difference Result 120 states and 459 transitions. [2019-01-31 17:06:55,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 17:06:55,682 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-31 17:06:55,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:55,684 INFO L225 Difference]: With dead ends: 120 [2019-01-31 17:06:55,684 INFO L226 Difference]: Without dead ends: 119 [2019-01-31 17:06:55,684 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-01-31 17:06:55,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-01-31 17:06:55,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 82. [2019-01-31 17:06:55,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-01-31 17:06:55,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 362 transitions. [2019-01-31 17:06:55,710 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 362 transitions. Word has length 6 [2019-01-31 17:06:55,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:55,710 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 362 transitions. [2019-01-31 17:06:55,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-31 17:06:55,710 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 362 transitions. [2019-01-31 17:06:55,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:06:55,711 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:55,711 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:06:55,711 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:55,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:55,711 INFO L82 PathProgramCache]: Analyzing trace with hash 902703186, now seen corresponding path program 2 times [2019-01-31 17:06:55,712 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:55,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:55,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:55,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:55,712 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:55,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:56,390 WARN L181 SmtUtils]: Spent 639.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 21 [2019-01-31 17:06:56,471 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:56,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:56,471 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:06:56,471 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:06:56,471 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:06:56,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:56,472 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:06:56,491 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:06:56,491 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:06:56,497 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-31 17:06:56,498 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:06:56,499 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:06:56,503 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-01-31 17:06:56,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:56,508 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-31 17:06:56,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:56,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:56,514 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-01-31 17:06:56,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:56,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:56,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:56,527 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-31 17:06:56,528 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:56,547 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:56,557 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:56,565 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:56,579 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:56,579 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-01-31 17:06:56,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:56,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:56,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:56,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:56,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:56,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:56,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:56,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, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-31 17:06:56,627 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:56,653 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:56,654 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-31 17:06:56,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:56,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:56,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:56,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:56,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:56,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:56,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:56,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:56,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:56,687 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-01-31 17:06:56,687 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:56,720 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:56,721 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-31 17:06:56,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:56,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:56,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:56,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:56,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:56,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:56,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:56,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:56,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:56,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:56,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:56,753 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:06:56,754 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 73 [2019-01-31 17:06:56,754 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:56,787 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:56,788 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-31 17:06:56,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:56,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:56,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:56,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:56,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:56,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:56,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:56,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:56,819 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:06:56,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:56,821 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 72 [2019-01-31 17:06:56,821 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:56,855 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:56,856 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-01-31 17:06:56,871 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:56,872 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:06:56,927 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:56,947 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:06:56,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-31 17:06:56,948 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:06:56,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-31 17:06:56,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-31 17:06:56,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2019-01-31 17:06:56,949 INFO L87 Difference]: Start difference. First operand 82 states and 362 transitions. Second operand 12 states. [2019-01-31 17:06:57,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:57,529 INFO L93 Difference]: Finished difference Result 146 states and 556 transitions. [2019-01-31 17:06:57,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 17:06:57,529 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-31 17:06:57,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:57,531 INFO L225 Difference]: With dead ends: 146 [2019-01-31 17:06:57,532 INFO L226 Difference]: Without dead ends: 145 [2019-01-31 17:06:57,532 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-01-31 17:06:57,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-01-31 17:06:57,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 98. [2019-01-31 17:06:57,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-01-31 17:06:57,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 442 transitions. [2019-01-31 17:06:57,558 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 442 transitions. Word has length 6 [2019-01-31 17:06:57,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:57,558 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 442 transitions. [2019-01-31 17:06:57,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-31 17:06:57,558 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 442 transitions. [2019-01-31 17:06:57,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:06:57,559 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:57,559 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:06:57,559 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:57,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:57,560 INFO L82 PathProgramCache]: Analyzing trace with hash 893362642, now seen corresponding path program 1 times [2019-01-31 17:06:57,560 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:57,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:57,561 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:06:57,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:57,561 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:57,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:57,857 WARN L181 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 17 [2019-01-31 17:06:57,882 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:06:57,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:57,882 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:06:57,882 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:06:57,883 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [22], [23] [2019-01-31 17:06:57,883 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:06:57,883 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:06:57,885 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:06:57,885 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-01-31 17:06:57,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:57,886 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:06:57,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:57,886 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:06:57,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:57,894 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:06:57,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:57,898 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:06:57,902 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-31 17:06:57,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:57,912 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-31 17:06:57,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:57,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:57,919 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-01-31 17:06:57,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:57,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:57,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:57,934 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-31 17:06:57,934 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:57,950 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:57,959 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:57,967 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:57,981 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:57,982 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-31 17:06:58,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,011 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-31 17:06:58,011 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:58,040 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:58,041 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-31 17:06:58,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,070 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-01-31 17:06:58,070 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:58,102 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:58,102 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-31 17:06:58,120 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:58,120 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:06:58,139 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:58,158 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:06:58,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-01-31 17:06:58,158 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:06:58,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-31 17:06:58,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-31 17:06:58,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-01-31 17:06:58,159 INFO L87 Difference]: Start difference. First operand 98 states and 442 transitions. Second operand 7 states. [2019-01-31 17:06:58,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:58,407 INFO L93 Difference]: Finished difference Result 111 states and 462 transitions. [2019-01-31 17:06:58,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:06:58,407 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-01-31 17:06:58,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:58,409 INFO L225 Difference]: With dead ends: 111 [2019-01-31 17:06:58,409 INFO L226 Difference]: Without dead ends: 110 [2019-01-31 17:06:58,410 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-01-31 17:06:58,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-01-31 17:06:58,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 100. [2019-01-31 17:06:58,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-01-31 17:06:58,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 452 transitions. [2019-01-31 17:06:58,435 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 452 transitions. Word has length 6 [2019-01-31 17:06:58,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:58,435 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 452 transitions. [2019-01-31 17:06:58,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-31 17:06:58,435 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 452 transitions. [2019-01-31 17:06:58,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:06:58,436 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:58,436 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:06:58,436 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:58,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:58,436 INFO L82 PathProgramCache]: Analyzing trace with hash 893472132, now seen corresponding path program 1 times [2019-01-31 17:06:58,437 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:58,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:58,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:58,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:58,438 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:58,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:58,668 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 17 [2019-01-31 17:06:58,711 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:06:58,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:58,711 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:06:58,711 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:06:58,712 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [20], [21] [2019-01-31 17:06:58,714 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:06:58,714 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:06:58,717 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:06:58,717 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-01-31 17:06:58,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:58,718 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:06:58,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:58,718 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:06:58,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:58,727 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:06:58,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:58,731 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:06:58,735 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-01-31 17:06:58,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,737 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-01-31 17:06:58,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,743 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-01-31 17:06:58,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,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, 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-01-31 17:06:58,752 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:58,770 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:58,819 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:58,826 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:58,840 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:58,840 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-31 17:06:58,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,868 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-31 17:06:58,869 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:58,923 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:58,923 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-31 17:06:58,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,952 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:06:58,955 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 59 [2019-01-31 17:06:58,956 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:58,987 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:58,988 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-31 17:06:59,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:59,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:59,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:59,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:59,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:59,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:59,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:59,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:59,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:59,022 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-01-31 17:06:59,023 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:59,058 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:59,059 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-31 17:06:59,083 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:59,083 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:06:59,111 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:59,136 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:06:59,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-31 17:06:59,136 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:06:59,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:06:59,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:06:59,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:06:59,137 INFO L87 Difference]: Start difference. First operand 100 states and 452 transitions. Second operand 10 states. [2019-01-31 17:06:59,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:59,545 INFO L93 Difference]: Finished difference Result 153 states and 620 transitions. [2019-01-31 17:06:59,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 17:06:59,545 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-31 17:06:59,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:59,548 INFO L225 Difference]: With dead ends: 153 [2019-01-31 17:06:59,548 INFO L226 Difference]: Without dead ends: 152 [2019-01-31 17:06:59,549 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:06:59,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-01-31 17:06:59,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 127. [2019-01-31 17:06:59,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-01-31 17:06:59,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 589 transitions. [2019-01-31 17:06:59,584 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 589 transitions. Word has length 6 [2019-01-31 17:06:59,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:59,584 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 589 transitions. [2019-01-31 17:06:59,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:06:59,585 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 589 transitions. [2019-01-31 17:06:59,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:06:59,585 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:59,585 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:06:59,585 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:59,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:59,585 INFO L82 PathProgramCache]: Analyzing trace with hash 897235472, now seen corresponding path program 1 times [2019-01-31 17:06:59,586 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:59,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:59,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:59,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:59,586 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:59,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:59,673 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:06:59,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:59,673 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:06:59,673 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:06:59,673 INFO L207 CegarAbsIntRunner]: [0], [10], [16], [20], [22], [23] [2019-01-31 17:06:59,678 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:06:59,678 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:06:59,681 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:06:59,681 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-01-31 17:06:59,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:59,681 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:06:59,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:59,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 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:06:59,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:59,690 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:06:59,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:59,696 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:06:59,698 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-01-31 17:06:59,707 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-01-31 17:06:59,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:59,718 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-01-31 17:06:59,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:59,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:59,731 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-01-31 17:06:59,732 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:59,745 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:59,752 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:59,760 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:59,771 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:59,772 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:22, output treesize:27 [2019-01-31 17:06:59,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:59,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:59,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:59,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:59,802 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-01-31 17:06:59,803 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:59,872 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:59,873 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-31 17:06:59,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:59,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:59,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:59,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:59,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:59,916 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:06:59,917 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-01-31 17:06:59,918 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:59,937 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:59,937 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-01-31 17:06:59,954 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:59,954 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:06:59,978 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:59,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:06:59,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:06:59,996 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:06:59,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:06:59,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:06:59,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:06:59,997 INFO L87 Difference]: Start difference. First operand 127 states and 589 transitions. Second operand 8 states. [2019-01-31 17:07:00,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:00,245 INFO L93 Difference]: Finished difference Result 143 states and 607 transitions. [2019-01-31 17:07:00,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:07:00,246 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-31 17:07:00,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:00,247 INFO L225 Difference]: With dead ends: 143 [2019-01-31 17:07:00,247 INFO L226 Difference]: Without dead ends: 138 [2019-01-31 17:07:00,247 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:07:00,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-01-31 17:07:00,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 127. [2019-01-31 17:07:00,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-01-31 17:07:00,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 588 transitions. [2019-01-31 17:07:00,276 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 588 transitions. Word has length 6 [2019-01-31 17:07:00,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:00,276 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 588 transitions. [2019-01-31 17:07:00,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:07:00,277 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 588 transitions. [2019-01-31 17:07:00,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:07:00,277 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:00,277 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:07:00,278 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:00,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:00,278 INFO L82 PathProgramCache]: Analyzing trace with hash 896931732, now seen corresponding path program 2 times [2019-01-31 17:07:00,278 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:00,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:00,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:00,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:00,279 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:00,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:00,481 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:07:00,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:00,481 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:00,481 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:07:00,482 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:07:00,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:00,482 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:07:00,491 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:07:00,491 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:07:00,498 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-31 17:07:00,498 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:07:00,499 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:00,501 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-01-31 17:07:00,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:00,503 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-31 17:07:00,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:00,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:00,508 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-01-31 17:07:00,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:00,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:00,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:00,515 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-01-31 17:07:00,515 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:00,533 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:00,543 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:00,550 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:00,564 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:00,564 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-31 17:07:00,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:00,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:00,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:00,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:00,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:00,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:00,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:00,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 51 [2019-01-31 17:07:00,592 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:00,620 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:00,621 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-31 17:07:00,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:00,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:00,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:00,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:00,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:00,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:00,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:00,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:00,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:00,651 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-01-31 17:07:00,651 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:00,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-01-31 17:07:00,684 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-31 17:07:00,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:00,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:00,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:00,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:00,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:00,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:00,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:00,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:00,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:00,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:00,715 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:00,716 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-01-31 17:07:00,717 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:00,745 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:00,745 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-31 17:07:00,765 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:00,766 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:00,829 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:00,846 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:00,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-31 17:07:00,847 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:00,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:07:00,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:07:00,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:07:00,847 INFO L87 Difference]: Start difference. First operand 127 states and 588 transitions. Second operand 10 states. [2019-01-31 17:07:01,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:01,273 INFO L93 Difference]: Finished difference Result 196 states and 812 transitions. [2019-01-31 17:07:01,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-31 17:07:01,273 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-31 17:07:01,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:01,276 INFO L225 Difference]: With dead ends: 196 [2019-01-31 17:07:01,276 INFO L226 Difference]: Without dead ends: 195 [2019-01-31 17:07:01,276 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2019-01-31 17:07:01,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-01-31 17:07:01,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 141. [2019-01-31 17:07:01,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-01-31 17:07:01,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 664 transitions. [2019-01-31 17:07:01,319 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 664 transitions. Word has length 6 [2019-01-31 17:07:01,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:01,319 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 664 transitions. [2019-01-31 17:07:01,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:07:01,319 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 664 transitions. [2019-01-31 17:07:01,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:07:01,320 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:01,320 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:07:01,320 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:01,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:01,320 INFO L82 PathProgramCache]: Analyzing trace with hash 897162246, now seen corresponding path program 3 times [2019-01-31 17:07:01,320 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:01,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:01,321 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:07:01,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:01,321 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:01,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:01,506 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:01,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:01,506 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:01,507 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:07:01,507 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:07:01,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:01,507 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:07:01,517 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:07:01,517 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:07:01,521 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:07:01,521 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:07:01,522 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:01,524 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-01-31 17:07:01,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:01,554 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-01-31 17:07:01,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:01,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:01,560 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-31 17:07:01,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:01,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:01,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:01,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-01-31 17:07:01,566 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:01,584 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:01,592 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:01,600 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:01,614 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:01,615 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-01-31 17:07:01,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:01,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:01,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:01,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:01,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:01,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:01,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:01,640 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-31 17:07:01,641 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:01,668 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:01,668 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-31 17:07:01,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:01,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:01,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:01,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:01,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:01,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:01,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:01,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:01,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:01,698 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-01-31 17:07:01,698 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:01,728 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:01,729 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-31 17:07:01,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:01,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:01,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:01,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:01,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:01,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:01,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:01,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:01,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:01,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:01,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:01,758 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:01,759 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 83 [2019-01-31 17:07:01,760 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:01,795 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:01,795 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-31 17:07:01,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:01,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:01,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:01,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:01,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:01,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:01,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:01,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:01,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:01,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:01,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:01,828 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:01,829 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 78 [2019-01-31 17:07:01,829 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:01,862 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:01,863 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-31 17:07:01,879 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:01,879 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:01,925 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:01,944 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:01,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-31 17:07:01,945 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:01,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-31 17:07:01,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-31 17:07:01,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=142, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:07:01,945 INFO L87 Difference]: Start difference. First operand 141 states and 664 transitions. Second operand 12 states. [2019-01-31 17:07:02,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:02,452 INFO L93 Difference]: Finished difference Result 205 states and 871 transitions. [2019-01-31 17:07:02,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-31 17:07:02,453 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-31 17:07:02,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:02,455 INFO L225 Difference]: With dead ends: 205 [2019-01-31 17:07:02,455 INFO L226 Difference]: Without dead ends: 197 [2019-01-31 17:07:02,456 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=131, Invalid=211, Unknown=0, NotChecked=0, Total=342 [2019-01-31 17:07:02,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-01-31 17:07:02,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 149. [2019-01-31 17:07:02,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-01-31 17:07:02,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 702 transitions. [2019-01-31 17:07:02,490 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 702 transitions. Word has length 6 [2019-01-31 17:07:02,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:02,490 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 702 transitions. [2019-01-31 17:07:02,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-31 17:07:02,490 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 702 transitions. [2019-01-31 17:07:02,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:07:02,491 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:02,491 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:07:02,491 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:02,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:02,492 INFO L82 PathProgramCache]: Analyzing trace with hash 900929556, now seen corresponding path program 1 times [2019-01-31 17:07:02,492 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:02,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:02,493 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:07:02,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:02,493 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:02,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:02,571 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:02,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:02,572 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:02,572 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:07:02,572 INFO L207 CegarAbsIntRunner]: [0], [14], [16], [20], [22], [23] [2019-01-31 17:07:02,573 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:02,573 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:02,576 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:02,576 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-01-31 17:07:02,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:02,576 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:02,576 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:02,576 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:07:02,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:02,593 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:02,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:02,597 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:02,603 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-01-31 17:07:02,609 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-01-31 17:07:02,618 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-01-31 17:07:02,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:02,633 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-01-31 17:07:02,634 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:02,644 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:02,652 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:02,660 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:02,670 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:02,670 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:19, output treesize:24 [2019-01-31 17:07:02,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:02,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:02,693 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-31 17:07:02,694 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:02,701 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:02,701 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2019-01-31 17:07:02,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:02,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:02,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:02,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:02,718 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-31 17:07:02,719 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:02,729 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:02,729 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:14 [2019-01-31 17:07:02,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-01-31 17:07:02,741 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:02,760 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:02,780 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:02,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:07:02,780 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:02,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:07:02,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:07:02,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:07:02,781 INFO L87 Difference]: Start difference. First operand 149 states and 702 transitions. Second operand 8 states. [2019-01-31 17:07:02,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:02,957 INFO L93 Difference]: Finished difference Result 165 states and 720 transitions. [2019-01-31 17:07:02,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:07:02,958 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-31 17:07:02,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:02,960 INFO L225 Difference]: With dead ends: 165 [2019-01-31 17:07:02,960 INFO L226 Difference]: Without dead ends: 164 [2019-01-31 17:07:02,960 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-01-31 17:07:02,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-01-31 17:07:02,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 149. [2019-01-31 17:07:02,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-01-31 17:07:02,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 702 transitions. [2019-01-31 17:07:02,998 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 702 transitions. Word has length 6 [2019-01-31 17:07:02,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:02,998 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 702 transitions. [2019-01-31 17:07:02,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:07:02,999 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 702 transitions. [2019-01-31 17:07:02,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:07:02,999 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:02,999 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:07:03,000 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:03,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:03,000 INFO L82 PathProgramCache]: Analyzing trace with hash 900750810, now seen corresponding path program 1 times [2019-01-31 17:07:03,000 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:03,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:03,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:03,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:03,001 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:03,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:03,073 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:03,073 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:03,074 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:03,074 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:07:03,074 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [20], [22], [23] [2019-01-31 17:07:03,075 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:03,075 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:03,078 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:03,078 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-01-31 17:07:03,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:03,078 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:03,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:03,078 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:07:03,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:03,087 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:03,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:03,092 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:03,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-01-31 17:07:03,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, 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-01-31 17:07:03,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:03,111 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-01-31 17:07:03,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:03,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:03,123 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-01-31 17:07:03,124 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:03,141 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:03,147 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:03,154 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:03,166 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:03,166 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:22, output treesize:27 [2019-01-31 17:07:03,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:03,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:03,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:03,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:03,196 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-01-31 17:07:03,197 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:03,211 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:03,212 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-31 17:07:03,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:03,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:03,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:03,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:03,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:03,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:03,233 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-01-31 17:07:03,234 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:03,254 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:03,254 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-01-31 17:07:03,270 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:03,270 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:03,288 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:03,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:03,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:07:03,307 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:03,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:07:03,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:07:03,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:07:03,308 INFO L87 Difference]: Start difference. First operand 149 states and 702 transitions. Second operand 8 states. [2019-01-31 17:07:03,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:03,561 INFO L93 Difference]: Finished difference Result 174 states and 765 transitions. [2019-01-31 17:07:03,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:07:03,562 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-31 17:07:03,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:03,565 INFO L225 Difference]: With dead ends: 174 [2019-01-31 17:07:03,565 INFO L226 Difference]: Without dead ends: 173 [2019-01-31 17:07:03,566 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-31 17:07:03,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-01-31 17:07:03,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 158. [2019-01-31 17:07:03,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-01-31 17:07:03,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 747 transitions. [2019-01-31 17:07:03,613 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 747 transitions. Word has length 6 [2019-01-31 17:07:03,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:03,613 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 747 transitions. [2019-01-31 17:07:03,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:07:03,613 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 747 transitions. [2019-01-31 17:07:03,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:07:03,614 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:03,614 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-01-31 17:07:03,615 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:03,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:03,615 INFO L82 PathProgramCache]: Analyzing trace with hash -2078696478, now seen corresponding path program 1 times [2019-01-31 17:07:03,615 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:03,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:03,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:03,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:03,616 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:03,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:03,681 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:03,681 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:03,681 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:03,681 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-31 17:07:03,681 INFO L207 CegarAbsIntRunner]: [0], [16], [20], [22], [24], [25] [2019-01-31 17:07:03,682 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:03,682 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:03,684 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:03,685 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-01-31 17:07:03,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:03,685 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:03,685 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:03,686 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:07:03,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:03,695 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:03,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:03,702 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:03,704 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-31 17:07:03,708 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-01-31 17:07:03,717 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-01-31 17:07:03,728 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-01-31 17:07:03,729 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:03,741 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:03,751 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:03,759 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:03,766 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:03,767 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:15, output treesize:21 [2019-01-31 17:07:03,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:03,772 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2019-01-31 17:07:03,773 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:03,774 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:03,774 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-01-31 17:07:03,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:03,781 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-01-31 17:07:03,781 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:03,783 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:03,783 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:5 [2019-01-31 17:07:03,789 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:03,789 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:03,804 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:03,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-31 17:07:03,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 8 [2019-01-31 17:07:03,823 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:07:03,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-31 17:07:03,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-31 17:07:03,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-01-31 17:07:03,824 INFO L87 Difference]: Start difference. First operand 158 states and 747 transitions. Second operand 5 states. [2019-01-31 17:07:03,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:03,978 INFO L93 Difference]: Finished difference Result 357 states and 1628 transitions. [2019-01-31 17:07:03,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-31 17:07:03,978 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-01-31 17:07:03,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:03,981 INFO L225 Difference]: With dead ends: 357 [2019-01-31 17:07:03,981 INFO L226 Difference]: Without dead ends: 353 [2019-01-31 17:07:03,982 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-01-31 17:07:03,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2019-01-31 17:07:04,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 329. [2019-01-31 17:07:04,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-01-31 17:07:04,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 1593 transitions. [2019-01-31 17:07:04,109 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 1593 transitions. Word has length 7 [2019-01-31 17:07:04,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:04,110 INFO L480 AbstractCegarLoop]: Abstraction has 329 states and 1593 transitions. [2019-01-31 17:07:04,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-31 17:07:04,110 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 1593 transitions. [2019-01-31 17:07:04,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:07:04,112 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:04,112 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:07:04,112 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:04,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:04,113 INFO L82 PathProgramCache]: Analyzing trace with hash -2087931688, now seen corresponding path program 1 times [2019-01-31 17:07:04,113 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:04,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:04,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:04,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:04,114 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:04,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:04,384 WARN L181 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 9 [2019-01-31 17:07:04,461 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:04,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:04,461 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:04,462 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-31 17:07:04,462 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [20], [22], [24], [25] [2019-01-31 17:07:04,463 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:04,464 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:04,466 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:04,466 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-01-31 17:07:04,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:04,467 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:04,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:04,467 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:07:04,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:04,479 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:04,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:04,487 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:04,504 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-01-31 17:07:04,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:04,541 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-01-31 17:07:04,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:04,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:04,574 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-01-31 17:07:04,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:04,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:04,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:04,646 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-01-31 17:07:04,647 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:04,758 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:04,766 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:04,773 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:04,786 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:04,786 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:25, output treesize:30 [2019-01-31 17:07:04,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:04,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:04,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:04,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:04,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:04,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:04,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:04,810 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-31 17:07:04,811 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:04,836 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:04,837 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-31 17:07:04,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:04,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:04,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:04,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:04,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:04,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:04,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:04,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:04,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:04,861 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-31 17:07:04,862 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:04,893 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:04,893 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-31 17:07:04,910 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:04,911 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:04,927 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:04,945 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:04,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:07:04,945 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:04,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:07:04,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:07:04,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:07:04,946 INFO L87 Difference]: Start difference. First operand 329 states and 1593 transitions. Second operand 8 states. [2019-01-31 17:07:05,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:05,231 INFO L93 Difference]: Finished difference Result 348 states and 1627 transitions. [2019-01-31 17:07:05,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:07:05,232 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-01-31 17:07:05,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:05,235 INFO L225 Difference]: With dead ends: 348 [2019-01-31 17:07:05,235 INFO L226 Difference]: Without dead ends: 338 [2019-01-31 17:07:05,236 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-31 17:07:05,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-01-31 17:07:05,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 333. [2019-01-31 17:07:05,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2019-01-31 17:07:05,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 1604 transitions. [2019-01-31 17:07:05,329 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 1604 transitions. Word has length 7 [2019-01-31 17:07:05,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:05,329 INFO L480 AbstractCegarLoop]: Abstraction has 333 states and 1604 transitions. [2019-01-31 17:07:05,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:07:05,329 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 1604 transitions. [2019-01-31 17:07:05,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:07:05,330 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:05,330 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:07:05,330 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:05,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:05,331 INFO L82 PathProgramCache]: Analyzing trace with hash -2088231584, now seen corresponding path program 1 times [2019-01-31 17:07:05,331 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:05,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:05,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:05,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:05,332 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:05,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:05,895 WARN L181 SmtUtils]: Spent 524.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 21 [2019-01-31 17:07:05,968 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:07:05,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:05,969 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:05,969 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-31 17:07:05,969 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [20], [22], [23] [2019-01-31 17:07:05,970 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:05,970 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:05,973 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:05,973 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-01-31 17:07:05,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:05,973 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:05,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:05,973 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:07:05,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:05,983 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:05,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:05,987 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:05,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-01-31 17:07:05,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:05,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-01-31 17:07:05,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:06,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:06,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-01-31 17:07:06,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:06,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:06,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:06,009 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-01-31 17:07:06,009 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:06,041 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:06,049 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:06,056 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:06,070 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:06,070 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-01-31 17:07:06,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:06,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:06,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:06,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:06,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:06,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:06,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:06,097 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-31 17:07:06,098 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:06,122 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:06,122 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-31 17:07:06,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:06,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:06,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:06,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:06,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:06,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:06,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:06,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:06,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:06,156 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-31 17:07:06,157 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:06,188 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:06,189 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-31 17:07:06,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:06,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:06,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:06,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:06,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:06,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:06,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:06,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:06,221 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:06,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:06,223 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 72 [2019-01-31 17:07:06,223 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:06,257 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:06,257 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-01-31 17:07:06,281 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:06,282 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:06,317 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:06,335 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:06,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-31 17:07:06,335 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:06,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:07:06,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:07:06,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:07:06,336 INFO L87 Difference]: Start difference. First operand 333 states and 1604 transitions. Second operand 10 states. [2019-01-31 17:07:06,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:06,750 INFO L93 Difference]: Finished difference Result 348 states and 1634 transitions. [2019-01-31 17:07:06,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:07:06,751 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-31 17:07:06,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:06,753 INFO L225 Difference]: With dead ends: 348 [2019-01-31 17:07:06,753 INFO L226 Difference]: Without dead ends: 343 [2019-01-31 17:07:06,754 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-01-31 17:07:06,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2019-01-31 17:07:06,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 334. [2019-01-31 17:07:06,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-01-31 17:07:06,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 1603 transitions. [2019-01-31 17:07:06,876 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 1603 transitions. Word has length 7 [2019-01-31 17:07:06,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:06,877 INFO L480 AbstractCegarLoop]: Abstraction has 334 states and 1603 transitions. [2019-01-31 17:07:06,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:07:06,877 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 1603 transitions. [2019-01-31 17:07:06,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:07:06,878 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:06,878 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:07:06,878 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:06,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:06,879 INFO L82 PathProgramCache]: Analyzing trace with hash -2088122094, now seen corresponding path program 1 times [2019-01-31 17:07:06,879 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:06,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:06,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:06,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:06,880 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:06,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:07,038 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 21 [2019-01-31 17:07:07,117 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:07:07,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:07,117 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:07,117 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-31 17:07:07,117 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [16], [20], [21] [2019-01-31 17:07:07,119 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:07,119 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:07,122 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:07,122 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-01-31 17:07:07,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:07,122 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:07,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:07,122 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:07:07,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:07,130 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:07,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:07,136 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:07,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-01-31 17:07:07,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,141 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-01-31 17:07:07,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,145 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-01-31 17:07:07,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,150 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-01-31 17:07:07,151 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:07,264 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:07,272 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:07,281 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:07,294 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:07,295 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-01-31 17:07:07,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,418 INFO L303 Elim1Store]: Index analysis took 105 ms [2019-01-31 17:07:07,419 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-31 17:07:07,419 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:07,445 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:07,445 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-31 17:07:07,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,477 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-31 17:07:07,477 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:07,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-01-31 17:07:07,525 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-31 17:07:07,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,559 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:07,560 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-01-31 17:07:07,561 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:07,594 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:07,595 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-31 17:07:07,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,626 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:07,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,628 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 72 [2019-01-31 17:07:07,629 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:07,662 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:07,662 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-01-31 17:07:07,682 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:07,682 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:07,725 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:07,744 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:07,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-31 17:07:07,745 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:07,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-31 17:07:07,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-31 17:07:07,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:07:07,745 INFO L87 Difference]: Start difference. First operand 334 states and 1603 transitions. Second operand 12 states. [2019-01-31 17:07:08,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:08,374 INFO L93 Difference]: Finished difference Result 457 states and 2102 transitions. [2019-01-31 17:07:08,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-31 17:07:08,375 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-31 17:07:08,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:08,379 INFO L225 Difference]: With dead ends: 457 [2019-01-31 17:07:08,379 INFO L226 Difference]: Without dead ends: 456 [2019-01-31 17:07:08,380 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-01-31 17:07:08,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2019-01-31 17:07:08,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 329. [2019-01-31 17:07:08,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-01-31 17:07:08,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 1582 transitions. [2019-01-31 17:07:08,466 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 1582 transitions. Word has length 7 [2019-01-31 17:07:08,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:08,466 INFO L480 AbstractCegarLoop]: Abstraction has 329 states and 1582 transitions. [2019-01-31 17:07:08,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-31 17:07:08,467 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 1582 transitions. [2019-01-31 17:07:08,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:07:08,467 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:08,467 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:07:08,468 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:08,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:08,468 INFO L82 PathProgramCache]: Analyzing trace with hash -2084662494, now seen corresponding path program 2 times [2019-01-31 17:07:08,468 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:08,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:08,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:08,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:08,469 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:08,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:08,709 WARN L181 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 20 [2019-01-31 17:07:08,781 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:07:08,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:08,781 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:08,782 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:07:08,782 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:07:08,782 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:08,782 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:07:08,791 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:07:08,791 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:07:08,804 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-31 17:07:08,804 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:07:08,805 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:08,807 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-01-31 17:07:08,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,812 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-01-31 17:07:08,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,817 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-01-31 17:07:08,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,823 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-31 17:07:08,824 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:08,842 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:08,852 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:08,860 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:08,874 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:08,875 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-01-31 17:07:08,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,902 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-31 17:07:08,904 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:08,927 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:08,928 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-31 17:07:08,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,959 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:08,960 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 60 [2019-01-31 17:07:08,960 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:08,990 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:08,990 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:30 [2019-01-31 17:07:09,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:09,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:09,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:09,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:09,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:09,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:09,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:09,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:09,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:09,021 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 61 [2019-01-31 17:07:09,021 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:09,048 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:09,048 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:34 [2019-01-31 17:07:09,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:09,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:09,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:09,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:09,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:09,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:09,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:09,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:09,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:09,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:09,084 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:09,085 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 75 [2019-01-31 17:07:09,085 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:09,115 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:09,115 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-31 17:07:09,136 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:09,136 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:09,185 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:09,203 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:09,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-31 17:07:09,204 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:09,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-31 17:07:09,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-31 17:07:09,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:07:09,205 INFO L87 Difference]: Start difference. First operand 329 states and 1582 transitions. Second operand 11 states. [2019-01-31 17:07:09,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:09,829 INFO L93 Difference]: Finished difference Result 346 states and 1608 transitions. [2019-01-31 17:07:09,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 17:07:09,830 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-01-31 17:07:09,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:09,834 INFO L225 Difference]: With dead ends: 346 [2019-01-31 17:07:09,834 INFO L226 Difference]: Without dead ends: 345 [2019-01-31 17:07:09,835 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2019-01-31 17:07:09,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2019-01-31 17:07:09,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 213. [2019-01-31 17:07:09,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-01-31 17:07:09,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 1003 transitions. [2019-01-31 17:07:09,909 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 1003 transitions. Word has length 7 [2019-01-31 17:07:09,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:09,909 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 1003 transitions. [2019-01-31 17:07:09,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-31 17:07:09,909 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 1003 transitions. [2019-01-31 17:07:09,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:07:09,910 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:09,910 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:07:09,910 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:09,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:09,910 INFO L82 PathProgramCache]: Analyzing trace with hash -2084418336, now seen corresponding path program 1 times [2019-01-31 17:07:09,910 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:09,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:09,911 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:07:09,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:09,911 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:09,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:10,099 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 17 [2019-01-31 17:07:10,142 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:07:10,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:10,142 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:10,142 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-31 17:07:10,143 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [16], [20], [22], [23] [2019-01-31 17:07:10,144 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:10,144 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:10,146 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:10,146 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-01-31 17:07:10,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:10,147 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:10,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:10,147 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:07:10,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:10,156 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:10,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:10,162 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:10,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-01-31 17:07:10,167 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-01-31 17:07:10,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:10,172 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-01-31 17:07:10,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:10,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:10,181 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-01-31 17:07:10,182 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:10,195 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:10,204 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:10,212 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:10,222 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:10,222 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:22, output treesize:27 [2019-01-31 17:07:10,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:10,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:10,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:10,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:10,249 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-31 17:07:10,249 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:10,265 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:10,265 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-31 17:07:10,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:10,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:10,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:10,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:10,284 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:10,284 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-01-31 17:07:10,285 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:10,303 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:10,304 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:22 [2019-01-31 17:07:10,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:10,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:10,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:10,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:10,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:10,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:10,327 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-01-31 17:07:10,327 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:10,343 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:10,343 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:26 [2019-01-31 17:07:10,363 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:10,363 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:10,406 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:10,425 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:10,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-31 17:07:10,425 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:10,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:07:10,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:07:10,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:07:10,426 INFO L87 Difference]: Start difference. First operand 213 states and 1003 transitions. Second operand 10 states. [2019-01-31 17:07:10,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:10,870 INFO L93 Difference]: Finished difference Result 280 states and 1278 transitions. [2019-01-31 17:07:10,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 17:07:10,870 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-31 17:07:10,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:10,873 INFO L225 Difference]: With dead ends: 280 [2019-01-31 17:07:10,873 INFO L226 Difference]: Without dead ends: 277 [2019-01-31 17:07:10,874 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:07:10,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-01-31 17:07:10,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 242. [2019-01-31 17:07:10,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-01-31 17:07:10,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 1141 transitions. [2019-01-31 17:07:10,966 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 1141 transitions. Word has length 7 [2019-01-31 17:07:10,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:10,966 INFO L480 AbstractCegarLoop]: Abstraction has 242 states and 1141 transitions. [2019-01-31 17:07:10,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:07:10,966 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 1141 transitions. [2019-01-31 17:07:10,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:07:10,967 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:10,967 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:07:10,967 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:10,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:10,967 INFO L82 PathProgramCache]: Analyzing trace with hash -2080543520, now seen corresponding path program 1 times [2019-01-31 17:07:10,968 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:10,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:10,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:10,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:10,968 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:10,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:11,060 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:11,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:11,060 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:11,060 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-31 17:07:11,061 INFO L207 CegarAbsIntRunner]: [0], [14], [16], [20], [22], [24], [25] [2019-01-31 17:07:11,062 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:11,062 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:11,064 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:11,065 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-01-31 17:07:11,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:11,065 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:11,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:11,065 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:07:11,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:11,076 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:11,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:11,080 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:11,086 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-01-31 17:07:11,090 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-01-31 17:07:11,102 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-01-31 17:07:11,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,110 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-01-31 17:07:11,111 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:11,119 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:11,126 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:11,134 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:11,144 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:11,144 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:19, output treesize:24 [2019-01-31 17:07:11,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,166 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2019-01-31 17:07:11,166 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:11,172 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:11,172 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2019-01-31 17:07:11,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,187 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-31 17:07:11,188 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:11,198 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:11,198 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:16 [2019-01-31 17:07:11,212 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:11,213 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:11,226 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:11,245 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:11,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2019-01-31 17:07:11,246 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:11,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-31 17:07:11,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-31 17:07:11,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:07:11,246 INFO L87 Difference]: Start difference. First operand 242 states and 1141 transitions. Second operand 9 states. [2019-01-31 17:07:11,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:11,581 INFO L93 Difference]: Finished difference Result 390 states and 1798 transitions. [2019-01-31 17:07:11,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:07:11,581 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 7 [2019-01-31 17:07:11,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:11,584 INFO L225 Difference]: With dead ends: 390 [2019-01-31 17:07:11,585 INFO L226 Difference]: Without dead ends: 377 [2019-01-31 17:07:11,585 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-01-31 17:07:11,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2019-01-31 17:07:11,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 367. [2019-01-31 17:07:11,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-01-31 17:07:11,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 1654 transitions. [2019-01-31 17:07:11,711 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 1654 transitions. Word has length 7 [2019-01-31 17:07:11,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:11,711 INFO L480 AbstractCegarLoop]: Abstraction has 367 states and 1654 transitions. [2019-01-31 17:07:11,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-31 17:07:11,711 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 1654 transitions. [2019-01-31 17:07:11,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:07:11,712 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:11,712 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-01-31 17:07:11,713 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:11,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:11,713 INFO L82 PathProgramCache]: Analyzing trace with hash -2080966800, now seen corresponding path program 4 times [2019-01-31 17:07:11,713 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:11,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:11,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:11,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:11,714 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:11,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:12,018 WARN L181 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 21 [2019-01-31 17:07:12,106 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:07:12,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:12,106 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:12,106 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:07:12,106 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:07:12,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:12,106 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:07:12,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:12,115 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:12,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:12,120 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:12,126 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-01-31 17:07:12,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,128 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-01-31 17:07:12,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,132 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-31 17:07:12,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,138 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-01-31 17:07:12,139 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:12,156 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:12,165 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:12,173 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:12,186 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:12,186 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-01-31 17:07:12,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,217 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-31 17:07:12,217 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:12,244 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:12,244 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:30 [2019-01-31 17:07:12,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,277 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-01-31 17:07:12,277 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:12,307 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:12,307 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:32 [2019-01-31 17:07:12,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,345 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:12,346 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-01-31 17:07:12,347 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:12,380 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:12,381 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:32 [2019-01-31 17:07:12,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,431 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-01-31 17:07:12,432 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:12,499 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:12,500 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:30 [2019-01-31 17:07:12,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,537 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-01-31 17:07:12,538 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:12,573 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:12,573 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-31 17:07:12,592 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:12,592 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:12,673 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:12,691 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:12,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 17 [2019-01-31 17:07:12,691 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:12,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-31 17:07:12,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-31 17:07:12,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=220, Unknown=0, NotChecked=0, Total=342 [2019-01-31 17:07:12,692 INFO L87 Difference]: Start difference. First operand 367 states and 1654 transitions. Second operand 13 states. [2019-01-31 17:07:13,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:13,343 INFO L93 Difference]: Finished difference Result 375 states and 1668 transitions. [2019-01-31 17:07:13,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-31 17:07:13,344 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 7 [2019-01-31 17:07:13,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:13,348 INFO L225 Difference]: With dead ends: 375 [2019-01-31 17:07:13,348 INFO L226 Difference]: Without dead ends: 374 [2019-01-31 17:07:13,349 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=157, Invalid=305, Unknown=0, NotChecked=0, Total=462 [2019-01-31 17:07:13,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2019-01-31 17:07:13,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 147. [2019-01-31 17:07:13,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-01-31 17:07:13,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 607 transitions. [2019-01-31 17:07:13,465 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 607 transitions. Word has length 7 [2019-01-31 17:07:13,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:13,465 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 607 transitions. [2019-01-31 17:07:13,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-31 17:07:13,465 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 607 transitions. [2019-01-31 17:07:13,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:07:13,466 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:13,466 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:07:13,466 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:13,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:13,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1924438182, now seen corresponding path program 1 times [2019-01-31 17:07:13,466 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:13,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:13,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:13,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:13,468 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:13,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:13,613 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 17 [2019-01-31 17:07:13,664 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:07:13,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:13,665 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:13,665 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-31 17:07:13,665 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [22], [24], [25] [2019-01-31 17:07:13,665 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:13,666 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:13,667 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:13,668 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-01-31 17:07:13,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:13,668 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:13,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:13,669 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:07:13,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:13,677 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:13,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:13,682 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:13,685 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-01-31 17:07:13,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,728 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-01-31 17:07:13,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,769 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-01-31 17:07:13,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,778 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-01-31 17:07:13,779 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:13,795 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:13,805 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:13,813 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:13,827 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:13,828 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-31 17:07:13,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,854 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-31 17:07:13,855 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:13,884 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:13,885 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-31 17:07:13,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,915 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-01-31 17:07:13,916 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:13,948 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:13,948 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-31 17:07:13,964 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:13,965 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:13,982 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:14,000 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:14,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-01-31 17:07:14,001 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:14,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-31 17:07:14,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-31 17:07:14,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-01-31 17:07:14,001 INFO L87 Difference]: Start difference. First operand 147 states and 607 transitions. Second operand 7 states. [2019-01-31 17:07:14,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:14,294 INFO L93 Difference]: Finished difference Result 157 states and 628 transitions. [2019-01-31 17:07:14,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:07:14,294 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-01-31 17:07:14,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:14,296 INFO L225 Difference]: With dead ends: 157 [2019-01-31 17:07:14,296 INFO L226 Difference]: Without dead ends: 150 [2019-01-31 17:07:14,297 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-01-31 17:07:14,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-01-31 17:07:14,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2019-01-31 17:07:14,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-01-31 17:07:14,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 611 transitions. [2019-01-31 17:07:14,426 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 611 transitions. Word has length 7 [2019-01-31 17:07:14,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:14,426 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 611 transitions. [2019-01-31 17:07:14,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-31 17:07:14,427 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 611 transitions. [2019-01-31 17:07:14,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:07:14,427 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:14,427 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:07:14,428 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:14,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:14,428 INFO L82 PathProgramCache]: Analyzing trace with hash 1928011116, now seen corresponding path program 1 times [2019-01-31 17:07:14,428 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:14,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:14,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:14,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:14,429 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:14,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:14,598 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 17 [2019-01-31 17:07:14,654 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:07:14,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:14,655 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:14,655 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-31 17:07:14,655 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [16], [20], [22], [23] [2019-01-31 17:07:14,656 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:14,656 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:14,658 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:14,659 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-01-31 17:07:14,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:14,659 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:14,659 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:14,659 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:07:14,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:14,668 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:14,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:14,672 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:14,683 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-01-31 17:07:14,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:14,686 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-31 17:07:14,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:14,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:14,691 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-01-31 17:07:14,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:14,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:14,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:14,697 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-01-31 17:07:14,697 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:14,715 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:14,723 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:14,731 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:14,746 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:14,746 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-31 17:07:14,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:14,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:14,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:14,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:14,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:14,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:14,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:14,776 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-31 17:07:14,777 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:14,806 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:14,806 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-31 17:07:14,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:14,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:14,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:14,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:14,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:14,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:14,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:14,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:14,834 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:14,834 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 59 [2019-01-31 17:07:14,835 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:14,864 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:14,865 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-31 17:07:14,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:14,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:14,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:14,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:14,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:14,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:14,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:14,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:14,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:14,897 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-31 17:07:14,897 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:14,929 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:14,929 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-31 17:07:14,951 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:14,951 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:15,015 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:15,034 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:15,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-31 17:07:15,034 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:15,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:07:15,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:07:15,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:07:15,035 INFO L87 Difference]: Start difference. First operand 149 states and 611 transitions. Second operand 10 states. [2019-01-31 17:07:15,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:15,542 INFO L93 Difference]: Finished difference Result 206 states and 810 transitions. [2019-01-31 17:07:15,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:07:15,543 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-31 17:07:15,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:15,545 INFO L225 Difference]: With dead ends: 206 [2019-01-31 17:07:15,545 INFO L226 Difference]: Without dead ends: 199 [2019-01-31 17:07:15,546 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2019-01-31 17:07:15,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-01-31 17:07:15,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 158. [2019-01-31 17:07:15,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-01-31 17:07:15,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 646 transitions. [2019-01-31 17:07:15,718 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 646 transitions. Word has length 7 [2019-01-31 17:07:15,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:15,719 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 646 transitions. [2019-01-31 17:07:15,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:07:15,719 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 646 transitions. [2019-01-31 17:07:15,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:07:15,719 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:15,719 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:07:15,719 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:15,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:15,720 INFO L82 PathProgramCache]: Analyzing trace with hash 2042527720, now seen corresponding path program 2 times [2019-01-31 17:07:15,720 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:15,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:15,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:15,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:15,721 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:15,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:15,898 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:07:15,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:15,898 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:15,898 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:07:15,899 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:07:15,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:15,899 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:07:15,907 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:07:15,907 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:07:15,933 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-31 17:07:15,934 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:07:15,935 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:15,944 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-01-31 17:07:15,947 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-01-31 17:07:15,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,952 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-01-31 17:07:15,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,960 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-01-31 17:07:15,961 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:15,973 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:15,981 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:15,987 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:16,004 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:16,004 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:22, output treesize:27 [2019-01-31 17:07:16,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:16,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:16,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:16,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:16,033 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-01-31 17:07:16,033 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:16,050 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:16,050 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-31 17:07:16,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:16,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:16,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:16,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:16,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:16,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:16,074 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-31 17:07:16,075 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:16,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-01-31 17:07:16,095 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:24 [2019-01-31 17:07:16,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:16,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:16,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:16,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:16,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:16,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:16,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:16,121 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:16,122 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-01-31 17:07:16,122 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:16,143 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:16,144 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-01-31 17:07:16,162 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:16,162 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:16,191 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:16,211 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:16,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-31 17:07:16,211 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:16,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:07:16,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:07:16,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:07:16,212 INFO L87 Difference]: Start difference. First operand 158 states and 646 transitions. Second operand 10 states. [2019-01-31 17:07:16,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:16,668 INFO L93 Difference]: Finished difference Result 161 states and 653 transitions. [2019-01-31 17:07:16,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:07:16,669 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-31 17:07:16,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:16,671 INFO L225 Difference]: With dead ends: 161 [2019-01-31 17:07:16,671 INFO L226 Difference]: Without dead ends: 156 [2019-01-31 17:07:16,671 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-01-31 17:07:16,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-01-31 17:07:16,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 33. [2019-01-31 17:07:16,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-31 17:07:16,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 119 transitions. [2019-01-31 17:07:16,734 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 119 transitions. Word has length 7 [2019-01-31 17:07:16,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:16,734 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 119 transitions. [2019-01-31 17:07:16,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:07:16,735 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 119 transitions. [2019-01-31 17:07:16,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-31 17:07:16,735 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:16,735 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:07:16,735 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:16,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:16,735 INFO L82 PathProgramCache]: Analyzing trace with hash -305786232, now seen corresponding path program 1 times [2019-01-31 17:07:16,736 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:16,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:16,736 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:07:16,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:16,736 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:16,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:16,874 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:16,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:16,874 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:16,874 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-31 17:07:16,874 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [16], [20], [22], [24], [25] [2019-01-31 17:07:16,875 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:16,875 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:16,877 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:16,877 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-01-31 17:07:16,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:16,878 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:16,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:16,878 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:07:16,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:16,890 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:16,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:16,895 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:16,898 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-31 17:07:16,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:16,904 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-31 17:07:16,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:16,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:16,910 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-01-31 17:07:16,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:16,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:16,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:16,917 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-01-31 17:07:16,917 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:16,932 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:16,941 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:16,950 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:16,964 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:16,964 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-31 17:07:16,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:16,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:16,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:16,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:16,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:16,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:16,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:16,992 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-31 17:07:16,993 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:17,020 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:17,021 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-31 17:07:17,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,049 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-31 17:07:17,050 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:17,079 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:17,080 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-31 17:07:17,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,108 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:17,109 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-01-31 17:07:17,110 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:17,145 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:17,146 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-31 17:07:17,163 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:17,164 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:17,196 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:17,214 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:17,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-31 17:07:17,214 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:17,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:07:17,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:07:17,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:07:17,215 INFO L87 Difference]: Start difference. First operand 33 states and 119 transitions. Second operand 10 states. [2019-01-31 17:07:17,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:17,582 INFO L93 Difference]: Finished difference Result 62 states and 209 transitions. [2019-01-31 17:07:17,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:07:17,583 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-01-31 17:07:17,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:17,584 INFO L225 Difference]: With dead ends: 62 [2019-01-31 17:07:17,584 INFO L226 Difference]: Without dead ends: 52 [2019-01-31 17:07:17,585 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-01-31 17:07:17,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-01-31 17:07:17,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 45. [2019-01-31 17:07:17,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-31 17:07:17,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 167 transitions. [2019-01-31 17:07:17,695 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 167 transitions. Word has length 8 [2019-01-31 17:07:17,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:17,696 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 167 transitions. [2019-01-31 17:07:17,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:07:17,696 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 167 transitions. [2019-01-31 17:07:17,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-31 17:07:17,696 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:17,696 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:07:17,697 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:17,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:17,697 INFO L82 PathProgramCache]: Analyzing trace with hash -477561138, now seen corresponding path program 1 times [2019-01-31 17:07:17,697 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:17,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:17,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:17,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:17,698 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:17,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:17,853 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-31 17:07:17,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:17,853 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:17,853 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-31 17:07:17,854 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [20], [22], [24], [25] [2019-01-31 17:07:17,854 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:17,854 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:17,857 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:17,857 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-01-31 17:07:17,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:17,857 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:17,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:17,858 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:07:17,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:17,867 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:17,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:17,872 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:17,876 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-01-31 17:07:17,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,880 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-01-31 17:07:17,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,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, 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-01-31 17:07:17,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,895 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-31 17:07:17,896 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:17,912 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:17,921 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:17,929 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:17,943 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:17,943 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-01-31 17:07:17,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,972 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-31 17:07:17,973 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:18,000 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:18,001 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-31 17:07:18,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,033 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-01-31 17:07:18,034 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:18,065 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:18,065 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-31 17:07:18,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,094 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:18,095 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-01-31 17:07:18,095 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:18,126 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:18,126 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-31 17:07:18,147 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:18,147 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:18,179 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:18,198 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:18,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 4, 4] total 10 [2019-01-31 17:07:18,198 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:18,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:07:18,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:07:18,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-01-31 17:07:18,199 INFO L87 Difference]: Start difference. First operand 45 states and 167 transitions. Second operand 8 states. [2019-01-31 17:07:18,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:18,601 INFO L93 Difference]: Finished difference Result 59 states and 204 transitions. [2019-01-31 17:07:18,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:07:18,602 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-01-31 17:07:18,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:18,603 INFO L225 Difference]: With dead ends: 59 [2019-01-31 17:07:18,603 INFO L226 Difference]: Without dead ends: 52 [2019-01-31 17:07:18,603 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-01-31 17:07:18,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-01-31 17:07:18,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 45. [2019-01-31 17:07:18,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-31 17:07:18,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 167 transitions. [2019-01-31 17:07:18,727 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 167 transitions. Word has length 8 [2019-01-31 17:07:18,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:18,727 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 167 transitions. [2019-01-31 17:07:18,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:07:18,728 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 167 transitions. [2019-01-31 17:07:18,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-31 17:07:18,728 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:18,728 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:07:18,728 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:18,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:18,729 INFO L82 PathProgramCache]: Analyzing trace with hash -1160942496, now seen corresponding path program 2 times [2019-01-31 17:07:18,729 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:18,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:18,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:18,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:18,729 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:18,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:18,855 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-31 17:07:18,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:18,856 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:18,856 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:07:18,856 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:07:18,856 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:18,856 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:07:18,864 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:07:18,865 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:07:18,870 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-31 17:07:18,870 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:07:18,871 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:18,878 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-01-31 17:07:18,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,886 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-01-31 17:07:18,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,896 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-01-31 17:07:18,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,904 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-01-31 17:07:18,904 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:18,942 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:18,952 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:18,959 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:18,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-01-31 17:07:18,973 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-31 17:07:18,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,001 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-31 17:07:19,001 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:19,026 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:19,027 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-31 17:07:19,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,055 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-31 17:07:19,056 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:19,086 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:19,086 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:32 [2019-01-31 17:07:19,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,120 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-01-31 17:07:19,121 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:19,157 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:19,157 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-31 17:07:19,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,191 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-01-31 17:07:19,191 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:19,228 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:19,228 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-31 17:07:19,250 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:19,250 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:19,314 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:19,334 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:19,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 5, 5] total 13 [2019-01-31 17:07:19,334 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:19,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:07:19,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:07:19,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2019-01-31 17:07:19,335 INFO L87 Difference]: Start difference. First operand 45 states and 167 transitions. Second operand 10 states. [2019-01-31 17:07:19,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:19,834 INFO L93 Difference]: Finished difference Result 67 states and 237 transitions. [2019-01-31 17:07:19,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 17:07:19,834 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-01-31 17:07:19,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:19,835 INFO L225 Difference]: With dead ends: 67 [2019-01-31 17:07:19,835 INFO L226 Difference]: Without dead ends: 32 [2019-01-31 17:07:19,836 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-01-31 17:07:19,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-01-31 17:07:19,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2019-01-31 17:07:19,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-31 17:07:19,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 100 transitions. [2019-01-31 17:07:19,935 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 100 transitions. Word has length 9 [2019-01-31 17:07:19,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:19,935 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 100 transitions. [2019-01-31 17:07:19,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:07:19,935 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 100 transitions. [2019-01-31 17:07:19,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-31 17:07:19,935 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:19,935 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:07:19,936 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:19,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:19,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1292813016, now seen corresponding path program 1 times [2019-01-31 17:07:19,936 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:19,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:19,937 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:07:19,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:19,937 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:19,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:20,066 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-31 17:07:20,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:20,067 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:20,067 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-31 17:07:20,067 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [20], [22], [24], [25] [2019-01-31 17:07:20,068 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:20,068 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:20,070 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:20,071 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-01-31 17:07:20,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:20,071 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:20,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:20,071 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:07:20,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:20,081 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:20,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:20,086 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:20,090 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-01-31 17:07:20,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-31 17:07:20,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,098 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-01-31 17:07:20,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,104 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-31 17:07:20,104 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:20,122 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:20,130 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:20,138 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:20,152 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:20,152 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-31 17:07:20,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,178 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-31 17:07:20,179 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:20,207 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:20,207 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-31 17:07:20,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,241 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-31 17:07:20,241 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:20,271 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:20,271 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-31 17:07:20,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,300 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-01-31 17:07:20,300 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:20,332 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:20,332 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-31 17:07:20,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,366 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:20,367 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 78 [2019-01-31 17:07:20,367 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:20,403 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:20,403 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-31 17:07:20,421 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:20,421 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:20,461 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:20,480 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:20,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 5, 5] total 13 [2019-01-31 17:07:20,480 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:20,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:07:20,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:07:20,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=131, Unknown=0, NotChecked=0, Total=210 [2019-01-31 17:07:20,481 INFO L87 Difference]: Start difference. First operand 30 states and 100 transitions. Second operand 10 states. [2019-01-31 17:07:20,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:20,876 INFO L93 Difference]: Finished difference Result 47 states and 147 transitions. [2019-01-31 17:07:20,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 17:07:20,877 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-01-31 17:07:20,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:20,878 INFO L225 Difference]: With dead ends: 47 [2019-01-31 17:07:20,878 INFO L226 Difference]: Without dead ends: 40 [2019-01-31 17:07:20,878 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-01-31 17:07:20,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-01-31 17:07:21,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 36. [2019-01-31 17:07:21,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-31 17:07:21,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 122 transitions. [2019-01-31 17:07:21,019 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 122 transitions. Word has length 9 [2019-01-31 17:07:21,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:21,019 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 122 transitions. [2019-01-31 17:07:21,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:07:21,019 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 122 transitions. [2019-01-31 17:07:21,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-31 17:07:21,019 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:21,020 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:07:21,020 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:21,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:21,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1875225892, now seen corresponding path program 2 times [2019-01-31 17:07:21,020 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:21,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:21,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:21,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:21,021 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:21,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:21,146 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-31 17:07:21,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:21,146 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:21,146 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:07:21,147 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:07:21,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:21,147 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:07:21,156 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:07:21,157 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:07:21,163 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-31 17:07:21,163 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:07:21,164 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:21,166 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-01-31 17:07:21,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,175 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-01-31 17:07:21,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,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-01-31 17:07:21,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,190 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-31 17:07:21,191 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:21,213 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:21,222 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:21,229 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:21,243 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:21,243 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:25, output treesize:30 [2019-01-31 17:07:21,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,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 51 [2019-01-31 17:07:21,270 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:21,298 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:21,298 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-31 17:07:21,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,332 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-01-31 17:07:21,332 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:21,362 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:21,363 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-31 17:07:21,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,414 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:21,415 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 78 [2019-01-31 17:07:21,416 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:21,451 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:21,452 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-31 17:07:21,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,480 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-01-31 17:07:21,481 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:21,517 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:21,517 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-31 17:07:21,540 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:21,541 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:21,591 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:21,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:21,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-31 17:07:21,611 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:21,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-31 17:07:21,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-31 17:07:21,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:07:21,612 INFO L87 Difference]: Start difference. First operand 36 states and 122 transitions. Second operand 11 states. [2019-01-31 17:07:22,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:22,064 INFO L93 Difference]: Finished difference Result 52 states and 168 transitions. [2019-01-31 17:07:22,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 17:07:22,066 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 9 [2019-01-31 17:07:22,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:22,067 INFO L225 Difference]: With dead ends: 52 [2019-01-31 17:07:22,067 INFO L226 Difference]: Without dead ends: 45 [2019-01-31 17:07:22,067 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=194, Unknown=0, NotChecked=0, Total=306 [2019-01-31 17:07:22,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-01-31 17:07:22,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 40. [2019-01-31 17:07:22,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-31 17:07:22,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 138 transitions. [2019-01-31 17:07:22,196 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 138 transitions. Word has length 9 [2019-01-31 17:07:22,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:22,196 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 138 transitions. [2019-01-31 17:07:22,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-31 17:07:22,196 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 138 transitions. [2019-01-31 17:07:22,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-31 17:07:22,197 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:22,197 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:07:22,197 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:22,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:22,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1867837724, now seen corresponding path program 1 times [2019-01-31 17:07:22,197 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:22,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:22,198 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:07:22,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:22,198 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:22,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:22,389 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:07:22,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:22,390 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:22,390 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-31 17:07:22,390 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [16], [20], [22], [24], [25] [2019-01-31 17:07:22,391 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:22,391 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:22,394 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:22,394 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-01-31 17:07:22,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:22,395 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:22,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:22,395 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:07:22,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:22,404 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:22,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:22,409 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:22,413 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-01-31 17:07:22,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:22,419 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-01-31 17:07:22,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:22,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:22,430 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-01-31 17:07:22,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:22,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:22,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:22,443 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-01-31 17:07:22,444 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:22,459 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:22,469 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:22,475 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:22,489 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:22,490 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-01-31 17:07:22,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:22,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:22,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:22,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:22,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:22,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:22,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:22,516 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-31 17:07:22,517 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:22,543 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:22,544 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-31 17:07:22,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:22,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:22,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:22,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:22,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:22,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:22,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:22,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:22,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:22,789 INFO L303 Elim1Store]: Index analysis took 226 ms [2019-01-31 17:07:22,790 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-01-31 17:07:22,791 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:22,859 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:22,860 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-31 17:07:22,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:22,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:22,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:22,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:22,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:22,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:22,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:22,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:22,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:22,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:22,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:22,891 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:22,892 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 78 [2019-01-31 17:07:22,892 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:22,926 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:22,927 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-31 17:07:22,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:22,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:22,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:22,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:22,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:22,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:22,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:22,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:22,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:22,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:22,960 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:22,960 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 75 [2019-01-31 17:07:22,961 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:23,004 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:23,004 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-31 17:07:23,025 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:23,026 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:23,137 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:23,156 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:23,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-31 17:07:23,156 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:23,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-31 17:07:23,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-31 17:07:23,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=145, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:07:23,157 INFO L87 Difference]: Start difference. First operand 40 states and 138 transitions. Second operand 12 states. [2019-01-31 17:07:23,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:23,717 INFO L93 Difference]: Finished difference Result 66 states and 218 transitions. [2019-01-31 17:07:23,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-31 17:07:23,717 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-01-31 17:07:23,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:23,718 INFO L225 Difference]: With dead ends: 66 [2019-01-31 17:07:23,718 INFO L226 Difference]: Without dead ends: 56 [2019-01-31 17:07:23,718 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-01-31 17:07:23,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-01-31 17:07:23,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 40. [2019-01-31 17:07:23,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-31 17:07:23,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 140 transitions. [2019-01-31 17:07:23,874 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 140 transitions. Word has length 9 [2019-01-31 17:07:23,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:23,875 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 140 transitions. [2019-01-31 17:07:23,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-31 17:07:23,875 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 140 transitions. [2019-01-31 17:07:23,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-31 17:07:23,875 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:23,875 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:07:23,875 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:23,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:23,875 INFO L82 PathProgramCache]: Analyzing trace with hash 638911500, now seen corresponding path program 2 times [2019-01-31 17:07:23,876 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:23,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:23,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:23,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:23,876 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:23,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:24,169 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-31 17:07:24,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:24,170 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:24,170 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:07:24,170 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:07:24,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:24,170 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:07:24,181 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:07:24,181 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:07:24,189 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-31 17:07:24,189 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:07:24,190 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:24,192 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-01-31 17:07:24,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,198 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-01-31 17:07:24,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,207 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-01-31 17:07:24,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,211 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-01-31 17:07:24,212 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:24,230 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:24,240 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:24,248 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:24,262 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:24,263 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2019-01-31 17:07:24,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,293 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-31 17:07:24,293 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:24,320 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:24,321 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-31 17:07:24,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,377 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:24,378 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 58 [2019-01-31 17:07:24,378 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:24,407 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:24,407 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:32 [2019-01-31 17:07:24,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,438 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 61 [2019-01-31 17:07:24,438 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:24,469 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:24,470 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:44, output treesize:34 [2019-01-31 17:07:24,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,507 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-01-31 17:07:24,508 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:24,546 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:24,546 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:34 [2019-01-31 17:07:24,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:24,582 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-01-31 17:07:24,583 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:24,620 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:24,621 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-31 17:07:24,645 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:24,646 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:24,711 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:24,730 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:24,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 16 [2019-01-31 17:07:24,730 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:24,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-31 17:07:24,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-31 17:07:24,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=200, Unknown=0, NotChecked=0, Total=306 [2019-01-31 17:07:24,731 INFO L87 Difference]: Start difference. First operand 40 states and 140 transitions. Second operand 12 states. [2019-01-31 17:07:25,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:25,356 INFO L93 Difference]: Finished difference Result 48 states and 164 transitions. [2019-01-31 17:07:25,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-31 17:07:25,356 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 10 [2019-01-31 17:07:25,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:25,357 INFO L225 Difference]: With dead ends: 48 [2019-01-31 17:07:25,357 INFO L226 Difference]: Without dead ends: 0 [2019-01-31 17:07:25,357 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-01-31 17:07:25,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-31 17:07:25,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-31 17:07:25,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-31 17:07:25,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-31 17:07:25,358 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 10 [2019-01-31 17:07:25,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:25,358 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-31 17:07:25,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-31 17:07:25,358 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-31 17:07:25,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 17:07:25,363 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-31 17:07:25,401 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:07:25,408 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:07:25,429 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:07:25,744 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:07:25,745 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:07:25,762 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:07:25,810 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:07:25,993 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:07:26,025 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:07:26,027 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:07:26,038 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:07:26,040 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:07:26,136 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:07:26,143 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:07:26,148 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:07:26,162 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:07:26,166 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:07:26,195 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:07:26,200 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:07:26,201 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:07:26,341 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:07:26,341 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:07:26,359 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:07:26,414 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:07:26,472 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:07:27,450 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:07:27,461 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:07:27,603 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:07:27,713 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:07:27,713 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:07:27,730 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:07:27,749 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:07:27,751 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:07:27,797 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:07:27,810 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:07:27,924 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:07:27,937 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:07:28,373 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:07:28,423 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:07:28,478 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:07:28,530 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:07:28,560 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:07:28,742 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:07:29,090 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:07:29,156 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:07:29,431 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:07:29,432 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:07:29,432 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:07:29,514 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:07:29,650 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:07:29,977 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:07:29,980 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:07:30,097 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:07:30,152 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:07:30,180 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:07:30,207 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:07:30,254 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:07:30,255 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:07:30,255 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:07:30,262 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:07:30,267 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:07:30,299 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:07:30,830 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:07:30,862 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:07:30,879 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:07:30,900 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:07:30,900 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:07:31,269 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:07:31,418 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:07:31,487 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:07:31,917 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:07:32,153 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:07:32,154 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:07:32,358 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:07:32,853 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:07:32,855 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:07:32,855 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:07:33,441 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:07:33,505 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:07:33,508 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:07:34,037 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:07:34,040 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:07:34,040 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:07:34,064 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:07:35,055 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:07:35,059 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:07:35,166 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:07:35,919 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:07:35,925 WARN L181 SmtUtils]: Spent 10.56 s on a formula simplification. DAG size of input: 1855 DAG size of output: 1101 [2019-01-31 17:08:00,130 WARN L181 SmtUtils]: Spent 24.19 s on a formula simplification. DAG size of input: 1000 DAG size of output: 85 [2019-01-31 17:08:00,133 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 7 9) no Hoare annotation was computed. [2019-01-31 17:08:00,133 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONASSERT(line 44) no Hoare annotation was computed. [2019-01-31 17:08:00,133 INFO L448 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-01-31 17:08:00,134 INFO L448 ceAbstractionStarter]: For program point L44(line 44) no Hoare annotation was computed. [2019-01-31 17:08:00,134 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-01-31 17:08:00,134 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONASSERT(line 46) no Hoare annotation was computed. [2019-01-31 17:08:00,134 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 7 9) no Hoare annotation was computed. [2019-01-31 17:08:00,134 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 43) no Hoare annotation was computed. [2019-01-31 17:08:00,134 INFO L448 ceAbstractionStarter]: For program point L14(lines 7 48) no Hoare annotation was computed. [2019-01-31 17:08:00,134 INFO L448 ceAbstractionStarter]: For program point L45(line 45) no Hoare annotation was computed. [2019-01-31 17:08:00,134 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONASSERT(line 45) no Hoare annotation was computed. [2019-01-31 17:08:00,149 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 05:08:00 BoogieIcfgContainer [2019-01-31 17:08:00,149 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-31 17:08:00,150 INFO L168 Benchmark]: Toolchain (without parser) took 94514.21 ms. Allocated memory was 133.7 MB in the beginning and 864.0 MB in the end (delta: 730.3 MB). Free memory was 109.0 MB in the beginning and 598.9 MB in the end (delta: -489.9 MB). Peak memory consumption was 792.3 MB. Max. memory is 7.1 GB. [2019-01-31 17:08:00,151 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.13 ms. Allocated memory is still 133.7 MB. Free memory is still 110.2 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-31 17:08:00,151 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.62 ms. Allocated memory is still 133.7 MB. Free memory was 108.8 MB in the beginning and 106.5 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. [2019-01-31 17:08:00,151 INFO L168 Benchmark]: Boogie Preprocessor took 32.32 ms. Allocated memory is still 133.7 MB. Free memory was 106.5 MB in the beginning and 105.4 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-01-31 17:08:00,152 INFO L168 Benchmark]: RCFGBuilder took 303.49 ms. Allocated memory is still 133.7 MB. Free memory was 105.4 MB in the beginning and 95.3 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. [2019-01-31 17:08:00,152 INFO L168 Benchmark]: TraceAbstraction took 94122.16 ms. Allocated memory was 133.7 MB in the beginning and 864.0 MB in the end (delta: 730.3 MB). Free memory was 95.0 MB in the beginning and 598.9 MB in the end (delta: -503.8 MB). Peak memory consumption was 778.4 MB. Max. memory is 7.1 GB. [2019-01-31 17:08:00,153 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.13 ms. Allocated memory is still 133.7 MB. Free memory is still 110.2 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 52.62 ms. Allocated memory is still 133.7 MB. Free memory was 108.8 MB in the beginning and 106.5 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 32.32 ms. Allocated memory is still 133.7 MB. Free memory was 106.5 MB in the beginning and 105.4 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 303.49 ms. Allocated memory is still 133.7 MB. Free memory was 105.4 MB in the beginning and 95.3 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 94122.16 ms. Allocated memory was 133.7 MB in the beginning and 864.0 MB in the end (delta: 730.3 MB). Free memory was 95.0 MB in the beginning and 598.9 MB in the end (delta: -503.8 MB). Peak memory consumption was 778.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 43]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 44]: 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, 94.0s OverallTime, 57 OverallIterations, 2 TraceHistogramMax, 21.7s AutomataDifference, 0.0s DeadEndRemovalTime, 34.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 210 SDtfs, 857 SDslu, 1 SDs, 0 SdLazy, 8790 SolverSat, 608 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 875 GetRequests, 174 SyntacticMatches, 38 SemanticMatches, 663 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2487 ImplicationChecksByTransitivity, 18.9s 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.3s 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.5s HoareSimplificationTime, 1 FomulaSimplificationsInter, 10044512 FormulaSimplificationTreeSizeReductionInter, 24.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 31.7s 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...