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/real-life/divisibilityWithArray.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-a9d37a5-m [2019-02-28 10:10:11,444 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-28 10:10:11,448 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-28 10:10:11,460 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-28 10:10:11,460 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-28 10:10:11,462 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-28 10:10:11,463 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-28 10:10:11,465 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-28 10:10:11,467 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-28 10:10:11,468 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-28 10:10:11,469 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-28 10:10:11,469 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-28 10:10:11,470 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-28 10:10:11,471 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-28 10:10:11,472 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-28 10:10:11,476 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-28 10:10:11,477 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-28 10:10:11,479 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-28 10:10:11,484 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-28 10:10:11,487 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-28 10:10:11,490 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-28 10:10:11,491 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-28 10:10:11,495 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-28 10:10:11,496 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-28 10:10:11,496 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-28 10:10:11,498 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-28 10:10:11,499 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-28 10:10:11,501 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-28 10:10:11,503 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-28 10:10:11,504 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-28 10:10:11,505 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-28 10:10:11,508 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-28 10:10:11,509 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-28 10:10:11,509 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-28 10:10:11,510 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-28 10:10:11,511 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-28 10:10:11,511 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-02-28 10:10:11,534 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-28 10:10:11,534 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-28 10:10:11,535 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-28 10:10:11,535 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-28 10:10:11,536 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-28 10:10:11,536 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-28 10:10:11,536 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-28 10:10:11,537 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-28 10:10:11,537 INFO L133 SettingsManager]: * Explicit value domain=true [2019-02-28 10:10:11,537 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-28 10:10:11,537 INFO L133 SettingsManager]: * Octagon Domain=false [2019-02-28 10:10:11,538 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-02-28 10:10:11,538 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-28 10:10:11,538 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-28 10:10:11,539 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-28 10:10:11,540 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-28 10:10:11,540 INFO L133 SettingsManager]: * Use SBE=true [2019-02-28 10:10:11,540 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-28 10:10:11,540 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-28 10:10:11,540 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-28 10:10:11,541 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-28 10:10:11,542 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-28 10:10:11,542 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-28 10:10:11,543 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-28 10:10:11,543 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-28 10:10:11,543 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-28 10:10:11,543 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-28 10:10:11,544 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-28 10:10:11,544 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-28 10:10:11,544 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-28 10:10:11,544 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-28 10:10:11,544 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 [2019-02-28 10:10:11,545 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-28 10:10:11,545 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-28 10:10:11,545 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-28 10:10:11,545 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-28 10:10:11,545 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-28 10:10:11,546 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in [2019-02-28 10:10:11,546 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-28 10:10:11,546 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-28 10:10:11,588 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-28 10:10:11,600 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-28 10:10:11,604 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-28 10:10:11,606 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-28 10:10:11,606 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-28 10:10:11,607 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/divisibilityWithArray.bpl [2019-02-28 10:10:11,607 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/divisibilityWithArray.bpl' [2019-02-28 10:10:11,637 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-28 10:10:11,639 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-28 10:10:11,639 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-28 10:10:11,640 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-28 10:10:11,640 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-28 10:10:11,656 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:10:11" (1/1) ... [2019-02-28 10:10:11,667 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:10:11" (1/1) ... [2019-02-28 10:10:11,672 WARN L165 Inliner]: Program contained no entry procedure! [2019-02-28 10:10:11,673 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-02-28 10:10:11,673 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-02-28 10:10:11,675 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-28 10:10:11,676 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-28 10:10:11,676 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-28 10:10:11,676 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-28 10:10:11,687 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:10:11" (1/1) ... [2019-02-28 10:10:11,688 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:10:11" (1/1) ... [2019-02-28 10:10:11,688 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:10:11" (1/1) ... [2019-02-28 10:10:11,688 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:10:11" (1/1) ... [2019-02-28 10:10:11,691 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:10:11" (1/1) ... [2019-02-28 10:10:11,695 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:10:11" (1/1) ... [2019-02-28 10:10:11,696 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:10:11" (1/1) ... [2019-02-28 10:10:11,698 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-28 10:10:11,698 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-28 10:10:11,698 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-28 10:10:11,698 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-28 10:10:11,699 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:10:11" (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:16092 -smt2 -in -t:200000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 [2019-02-28 10:10:11,760 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-02-28 10:10:11,761 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-02-28 10:10:11,761 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-02-28 10:10:11,904 INFO L278 CfgBuilder]: Using library mode [2019-02-28 10:10:11,905 INFO L286 CfgBuilder]: Removed 0 assue(true) statements. [2019-02-28 10:10:11,906 INFO L202 PluginConnector]: Adding new model divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 10:10:11 BoogieIcfgContainer [2019-02-28 10:10:11,906 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-28 10:10:11,907 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-28 10:10:11,907 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-28 10:10:11,911 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-28 10:10:11,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:10:11" (1/2) ... [2019-02-28 10:10:11,912 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32215493 and model type divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.02 10:10:11, skipping insertion in model container [2019-02-28 10:10:11,912 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 10:10:11" (2/2) ... [2019-02-28 10:10:11,914 INFO L112 eAbstractionObserver]: Analyzing ICFG divisibilityWithArray.bpl [2019-02-28 10:10:11,924 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-28 10:10:11,932 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-02-28 10:10:11,948 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-02-28 10:10:11,986 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-28 10:10:11,987 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-28 10:10:11,987 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-28 10:10:11,987 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-28 10:10:11,987 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-28 10:10:11,988 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-28 10:10:11,988 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-28 10:10:11,988 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-28 10:10:12,006 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-02-28 10:10:12,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-28 10:10:12,019 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:12,021 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-28 10:10:12,023 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:12,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:12,034 INFO L82 PathProgramCache]: Analyzing trace with hash 29920, now seen corresponding path program 1 times [2019-02-28 10:10:12,037 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:12,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:12,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:12,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:12,092 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:12,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:12,572 WARN L181 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 19 [2019-02-28 10:10:12,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:12,645 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-28 10:10:12,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-28 10:10:12,646 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:10:12,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-28 10:10:12,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-28 10:10:12,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-02-28 10:10:12,664 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 4 states. [2019-02-28 10:10:12,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:12,771 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-02-28 10:10:12,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-28 10:10:12,774 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-02-28 10:10:12,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:12,785 INFO L225 Difference]: With dead ends: 14 [2019-02-28 10:10:12,785 INFO L226 Difference]: Without dead ends: 7 [2019-02-28 10:10:12,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-02-28 10:10:12,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-02-28 10:10:12,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. [2019-02-28 10:10:12,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-02-28 10:10:12,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-02-28 10:10:12,821 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 3 [2019-02-28 10:10:12,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:12,821 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-02-28 10:10:12,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-28 10:10:12,822 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-02-28 10:10:12,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-28 10:10:12,822 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:12,822 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-02-28 10:10:12,822 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:12,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:12,823 INFO L82 PathProgramCache]: Analyzing trace with hash 28754210, now seen corresponding path program 1 times [2019-02-28 10:10:12,823 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:12,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:12,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:12,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:12,825 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:12,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:13,323 WARN L181 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 21 [2019-02-28 10:10:13,482 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 17 [2019-02-28 10:10:13,624 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 7 [2019-02-28 10:10:13,625 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:13,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:13,626 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:13,627 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-28 10:10:13,629 INFO L207 CegarAbsIntRunner]: [0], [4], [5], [6] [2019-02-28 10:10:13,663 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:10:13,663 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:10:13,756 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:10:13,758 INFO L272 AbstractInterpreter]: Visited 4 different actions 11 times. Merged at 3 different actions 7 times. Never widened. Performed 46 root evaluator evaluations with a maximum evaluation depth of 3. Performed 46 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-28 10:10:13,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:13,765 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:10:13,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:13,766 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:10:13,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:13,787 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:10:13,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:13,816 WARN L254 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 9 conjunts are in the unsatisfiable core [2019-02-28 10:10:13,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:13,894 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:10:13,894 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:10:13,970 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:10:13,971 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:10:14,177 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:10:14,178 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:10:14,189 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:10:14,189 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:10:14,231 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:14,232 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:14,363 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:14,385 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:14,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-28 10:10:14,386 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:14,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-28 10:10:14,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-28 10:10:14,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-02-28 10:10:14,388 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 9 states. [2019-02-28 10:10:14,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:14,708 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-02-28 10:10:14,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-28 10:10:14,708 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2019-02-28 10:10:14,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:14,709 INFO L225 Difference]: With dead ends: 10 [2019-02-28 10:10:14,709 INFO L226 Difference]: Without dead ends: 9 [2019-02-28 10:10:14,710 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-02-28 10:10:14,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-02-28 10:10:14,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2019-02-28 10:10:14,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-02-28 10:10:14,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-02-28 10:10:14,713 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 5 [2019-02-28 10:10:14,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:14,714 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-02-28 10:10:14,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-28 10:10:14,714 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-02-28 10:10:14,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-28 10:10:14,714 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:14,715 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1] [2019-02-28 10:10:14,715 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:14,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:14,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1862993124, now seen corresponding path program 2 times [2019-02-28 10:10:14,715 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:14,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:14,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:14,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:14,717 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:14,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:15,043 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:15,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:15,044 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:15,045 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:15,045 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:15,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:15,045 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:10:15,063 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:10:15,063 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:10:15,073 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-28 10:10:15,073 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:15,074 WARN L254 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 11 conjunts are in the unsatisfiable core [2019-02-28 10:10:15,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:15,078 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:10:15,079 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:10:15,086 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:10:15,087 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:10:15,193 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:10:15,194 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:10:15,204 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:10:15,205 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:10:15,220 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:15,221 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:15,403 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:15,422 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:15,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-28 10:10:15,423 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:15,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-28 10:10:15,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-28 10:10:15,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2019-02-28 10:10:15,424 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 11 states. [2019-02-28 10:10:15,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:15,522 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-02-28 10:10:15,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-28 10:10:15,525 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-02-28 10:10:15,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:15,526 INFO L225 Difference]: With dead ends: 12 [2019-02-28 10:10:15,526 INFO L226 Difference]: Without dead ends: 11 [2019-02-28 10:10:15,527 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2019-02-28 10:10:15,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-02-28 10:10:15,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2019-02-28 10:10:15,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-02-28 10:10:15,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-02-28 10:10:15,532 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 7 [2019-02-28 10:10:15,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:15,533 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-02-28 10:10:15,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-28 10:10:15,533 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-02-28 10:10:15,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-28 10:10:15,533 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:15,533 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1] [2019-02-28 10:10:15,534 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:15,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:15,535 INFO L82 PathProgramCache]: Analyzing trace with hash -664969178, now seen corresponding path program 3 times [2019-02-28 10:10:15,535 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:15,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:15,614 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:15,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:15,614 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:15,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:15,994 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:15,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:15,995 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:15,995 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:15,995 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:15,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:15,996 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:10:16,011 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:10:16,012 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:10:16,020 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:10:16,020 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:16,021 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-28 10:10:16,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:16,025 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:10:16,026 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:10:16,031 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:10:16,032 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:10:16,268 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:10:16,269 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:10:16,272 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:10:16,273 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:10:16,281 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:16,281 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:16,386 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:16,413 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:16,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2019-02-28 10:10:16,414 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:16,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-02-28 10:10:16,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-02-28 10:10:16,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2019-02-28 10:10:16,415 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 13 states. [2019-02-28 10:10:16,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:16,541 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-02-28 10:10:16,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-28 10:10:16,542 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 9 [2019-02-28 10:10:16,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:16,542 INFO L225 Difference]: With dead ends: 14 [2019-02-28 10:10:16,542 INFO L226 Difference]: Without dead ends: 13 [2019-02-28 10:10:16,543 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2019-02-28 10:10:16,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-02-28 10:10:16,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2019-02-28 10:10:16,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-02-28 10:10:16,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-02-28 10:10:16,547 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 9 [2019-02-28 10:10:16,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:16,547 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-02-28 10:10:16,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-02-28 10:10:16,547 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-02-28 10:10:16,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-02-28 10:10:16,548 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:16,548 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 1, 1] [2019-02-28 10:10:16,548 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:16,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:16,549 INFO L82 PathProgramCache]: Analyzing trace with hash 914748136, now seen corresponding path program 4 times [2019-02-28 10:10:16,549 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:16,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:16,550 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:16,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:16,550 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:16,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:16,898 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:16,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:16,899 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:16,899 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:16,899 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:16,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:16,900 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:10:16,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:16,909 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:10:16,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:16,916 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-28 10:10:16,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:16,926 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:10:16,927 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:10:16,966 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:10:16,967 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:10:17,143 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:10:17,144 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:10:17,150 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:10:17,150 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:10:17,160 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:17,161 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:17,347 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:17,367 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:17,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2019-02-28 10:10:17,368 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:17,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-02-28 10:10:17,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-02-28 10:10:17,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2019-02-28 10:10:17,370 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 15 states. [2019-02-28 10:10:17,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:17,493 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-02-28 10:10:17,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-28 10:10:17,493 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 11 [2019-02-28 10:10:17,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:17,494 INFO L225 Difference]: With dead ends: 16 [2019-02-28 10:10:17,494 INFO L226 Difference]: Without dead ends: 15 [2019-02-28 10:10:17,495 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2019-02-28 10:10:17,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-02-28 10:10:17,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2019-02-28 10:10:17,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-02-28 10:10:17,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-02-28 10:10:17,499 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2019-02-28 10:10:17,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:17,499 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-02-28 10:10:17,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-02-28 10:10:17,499 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-02-28 10:10:17,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-02-28 10:10:17,500 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:17,500 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 1, 1] [2019-02-28 10:10:17,500 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:17,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:17,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1395335894, now seen corresponding path program 5 times [2019-02-28 10:10:17,501 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:17,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:17,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:17,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:17,502 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:17,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:17,815 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:17,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:17,816 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:17,816 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:17,816 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:17,816 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:17,816 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:10:17,826 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:10:17,826 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:10:17,840 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-02-28 10:10:17,840 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:17,841 WARN L254 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 17 conjunts are in the unsatisfiable core [2019-02-28 10:10:17,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:17,846 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:10:17,846 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:10:17,849 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:10:17,850 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:10:18,079 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:10:18,081 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:10:18,085 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:10:18,086 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:10:18,096 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:18,097 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:18,285 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:18,305 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:18,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 23 [2019-02-28 10:10:18,306 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:18,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-02-28 10:10:18,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-02-28 10:10:18,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=488, Unknown=0, NotChecked=0, Total=600 [2019-02-28 10:10:18,307 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 17 states. [2019-02-28 10:10:18,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:18,431 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-02-28 10:10:18,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-28 10:10:18,432 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 13 [2019-02-28 10:10:18,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:18,433 INFO L225 Difference]: With dead ends: 18 [2019-02-28 10:10:18,434 INFO L226 Difference]: Without dead ends: 17 [2019-02-28 10:10:18,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=112, Invalid=488, Unknown=0, NotChecked=0, Total=600 [2019-02-28 10:10:18,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-02-28 10:10:18,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-02-28 10:10:18,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-02-28 10:10:18,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-02-28 10:10:18,439 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 13 [2019-02-28 10:10:18,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:18,439 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-02-28 10:10:18,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-02-28 10:10:18,440 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-02-28 10:10:18,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-02-28 10:10:18,440 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:18,440 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 1, 1] [2019-02-28 10:10:18,441 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:18,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:18,441 INFO L82 PathProgramCache]: Analyzing trace with hash -887996692, now seen corresponding path program 6 times [2019-02-28 10:10:18,441 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:18,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:18,442 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:18,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:18,442 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:18,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:18,927 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:18,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:18,928 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:18,928 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:18,928 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:18,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:18,928 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:10:18,937 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:10:18,937 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:10:18,960 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:10:18,960 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:18,961 WARN L254 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 19 conjunts are in the unsatisfiable core [2019-02-28 10:10:18,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:18,965 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:10:18,965 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:10:18,975 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:10:18,976 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:10:19,514 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:10:19,515 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:10:19,522 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:10:19,523 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:10:19,537 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:19,537 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:19,840 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:19,859 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:19,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2019-02-28 10:10:19,859 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:19,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-02-28 10:10:19,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-02-28 10:10:19,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=622, Unknown=0, NotChecked=0, Total=756 [2019-02-28 10:10:19,861 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 19 states. [2019-02-28 10:10:20,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:20,179 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-02-28 10:10:20,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-28 10:10:20,180 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 15 [2019-02-28 10:10:20,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:20,180 INFO L225 Difference]: With dead ends: 20 [2019-02-28 10:10:20,181 INFO L226 Difference]: Without dead ends: 19 [2019-02-28 10:10:20,181 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=134, Invalid=622, Unknown=0, NotChecked=0, Total=756 [2019-02-28 10:10:20,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-02-28 10:10:20,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2019-02-28 10:10:20,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-02-28 10:10:20,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-02-28 10:10:20,185 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 15 [2019-02-28 10:10:20,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:20,185 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-02-28 10:10:20,185 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-02-28 10:10:20,186 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-02-28 10:10:20,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-02-28 10:10:20,186 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:20,186 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 1, 1] [2019-02-28 10:10:20,186 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:20,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:20,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1333671982, now seen corresponding path program 7 times [2019-02-28 10:10:20,187 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:20,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:20,188 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:20,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:20,188 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:20,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:20,526 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:20,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:20,527 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:20,527 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:20,527 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:20,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:20,528 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:10:20,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:20,544 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:10:20,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:20,564 WARN L254 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 21 conjunts are in the unsatisfiable core [2019-02-28 10:10:20,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:20,581 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:10:20,582 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:10:20,593 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:10:20,594 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:10:20,766 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:10:20,767 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:10:20,772 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:10:20,772 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:10:20,785 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:20,785 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:21,071 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:21,089 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:21,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 29 [2019-02-28 10:10:21,090 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:21,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-02-28 10:10:21,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-02-28 10:10:21,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=772, Unknown=0, NotChecked=0, Total=930 [2019-02-28 10:10:21,091 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 21 states. [2019-02-28 10:10:21,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:21,597 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-02-28 10:10:21,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-02-28 10:10:21,598 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 17 [2019-02-28 10:10:21,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:21,599 INFO L225 Difference]: With dead ends: 22 [2019-02-28 10:10:21,599 INFO L226 Difference]: Without dead ends: 21 [2019-02-28 10:10:21,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=158, Invalid=772, Unknown=0, NotChecked=0, Total=930 [2019-02-28 10:10:21,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-02-28 10:10:21,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2019-02-28 10:10:21,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-02-28 10:10:21,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-02-28 10:10:21,608 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 17 [2019-02-28 10:10:21,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:21,608 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-02-28 10:10:21,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-02-28 10:10:21,609 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-02-28 10:10:21,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-02-28 10:10:21,610 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:21,610 INFO L402 BasicCegarLoop]: trace histogram [9, 8, 1, 1] [2019-02-28 10:10:21,611 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:21,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:21,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1758521584, now seen corresponding path program 8 times [2019-02-28 10:10:21,611 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:21,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:21,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:21,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:21,613 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:21,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:22,058 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:22,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:22,058 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:22,059 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:22,059 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:22,059 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:22,059 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:10:22,068 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:10:22,068 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:10:22,078 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-02-28 10:10:22,079 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:22,079 WARN L254 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 23 conjunts are in the unsatisfiable core [2019-02-28 10:10:22,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:22,083 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:10:22,083 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:10:22,086 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:10:22,086 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:10:22,307 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:10:22,308 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:10:22,316 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:10:22,317 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:10:22,332 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:22,333 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:22,863 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:22,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:22,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 32 [2019-02-28 10:10:22,884 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:22,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-02-28 10:10:22,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-02-28 10:10:22,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=938, Unknown=0, NotChecked=0, Total=1122 [2019-02-28 10:10:22,886 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 23 states. [2019-02-28 10:10:23,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:23,247 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-02-28 10:10:23,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-02-28 10:10:23,249 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 19 [2019-02-28 10:10:23,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:23,250 INFO L225 Difference]: With dead ends: 24 [2019-02-28 10:10:23,250 INFO L226 Difference]: Without dead ends: 23 [2019-02-28 10:10:23,251 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=184, Invalid=938, Unknown=0, NotChecked=0, Total=1122 [2019-02-28 10:10:23,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-02-28 10:10:23,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-02-28 10:10:23,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-02-28 10:10:23,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-02-28 10:10:23,255 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 19 [2019-02-28 10:10:23,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:23,255 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-02-28 10:10:23,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-02-28 10:10:23,256 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-02-28 10:10:23,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-02-28 10:10:23,256 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:23,256 INFO L402 BasicCegarLoop]: trace histogram [10, 9, 1, 1] [2019-02-28 10:10:23,257 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:23,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:23,257 INFO L82 PathProgramCache]: Analyzing trace with hash 2017095986, now seen corresponding path program 9 times [2019-02-28 10:10:23,257 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:23,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:23,258 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:23,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:23,258 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:23,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:23,619 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:23,619 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:23,620 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:23,620 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:23,620 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:23,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:23,620 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:10:23,630 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:10:23,630 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:10:23,638 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:10:23,639 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:23,639 WARN L254 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 25 conjunts are in the unsatisfiable core [2019-02-28 10:10:23,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:23,644 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:10:23,645 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:10:23,654 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:10:23,655 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:10:24,108 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:10:24,109 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:10:24,121 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:10:24,121 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:10:24,155 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:24,155 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:24,560 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:24,578 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:24,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 35 [2019-02-28 10:10:24,579 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:24,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-02-28 10:10:24,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-02-28 10:10:24,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=1120, Unknown=0, NotChecked=0, Total=1332 [2019-02-28 10:10:24,581 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 25 states. [2019-02-28 10:10:24,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:24,848 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-02-28 10:10:24,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-02-28 10:10:24,848 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 21 [2019-02-28 10:10:24,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:24,849 INFO L225 Difference]: With dead ends: 26 [2019-02-28 10:10:24,850 INFO L226 Difference]: Without dead ends: 25 [2019-02-28 10:10:24,851 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=212, Invalid=1120, Unknown=0, NotChecked=0, Total=1332 [2019-02-28 10:10:24,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-02-28 10:10:24,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2019-02-28 10:10:24,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-02-28 10:10:24,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-02-28 10:10:24,855 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 21 [2019-02-28 10:10:24,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:24,855 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-02-28 10:10:24,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-02-28 10:10:24,855 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-02-28 10:10:24,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-02-28 10:10:24,856 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:24,856 INFO L402 BasicCegarLoop]: trace histogram [11, 10, 1, 1] [2019-02-28 10:10:24,856 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:24,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:24,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1398993140, now seen corresponding path program 10 times [2019-02-28 10:10:24,857 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:24,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:24,858 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:24,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:24,858 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:24,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:25,323 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:25,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:25,324 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:25,324 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:25,324 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:25,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:25,325 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:10:25,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:25,336 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:10:25,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:25,346 WARN L254 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 27 conjunts are in the unsatisfiable core [2019-02-28 10:10:25,347 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:25,355 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:10:25,355 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:10:25,370 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:10:25,370 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:10:25,657 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:10:25,658 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:10:25,663 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:10:25,663 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:10:25,681 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:25,681 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:26,199 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:26,219 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:26,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 38 [2019-02-28 10:10:26,219 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:26,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-02-28 10:10:26,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-02-28 10:10:26,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=1318, Unknown=0, NotChecked=0, Total=1560 [2019-02-28 10:10:26,221 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 27 states. [2019-02-28 10:10:26,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:26,529 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-02-28 10:10:26,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-02-28 10:10:26,530 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 23 [2019-02-28 10:10:26,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:26,531 INFO L225 Difference]: With dead ends: 28 [2019-02-28 10:10:26,531 INFO L226 Difference]: Without dead ends: 27 [2019-02-28 10:10:26,532 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=242, Invalid=1318, Unknown=0, NotChecked=0, Total=1560 [2019-02-28 10:10:26,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-02-28 10:10:26,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2019-02-28 10:10:26,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-02-28 10:10:26,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-02-28 10:10:26,536 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 23 [2019-02-28 10:10:26,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:26,537 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-02-28 10:10:26,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-02-28 10:10:26,537 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-02-28 10:10:26,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-02-28 10:10:26,537 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:26,538 INFO L402 BasicCegarLoop]: trace histogram [12, 11, 1, 1] [2019-02-28 10:10:26,538 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:26,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:26,538 INFO L82 PathProgramCache]: Analyzing trace with hash 107644982, now seen corresponding path program 11 times [2019-02-28 10:10:26,538 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:26,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:26,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:26,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:26,539 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:26,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:26,842 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-28 10:10:27,265 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:27,265 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:27,266 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:27,266 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:27,266 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:27,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:27,266 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:10:27,274 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:10:27,275 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:10:27,288 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-02-28 10:10:27,288 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:27,290 WARN L254 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 29 conjunts are in the unsatisfiable core [2019-02-28 10:10:27,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:27,294 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:10:27,294 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:10:27,301 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:10:27,301 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:10:27,673 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:10:27,674 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:10:27,678 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:10:27,678 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:10:27,695 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:27,695 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:28,284 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:28,303 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:28,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 41 [2019-02-28 10:10:28,304 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:28,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-02-28 10:10:28,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-02-28 10:10:28,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=1532, Unknown=0, NotChecked=0, Total=1806 [2019-02-28 10:10:28,305 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 29 states. [2019-02-28 10:10:28,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:28,645 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-02-28 10:10:28,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-02-28 10:10:28,646 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 25 [2019-02-28 10:10:28,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:28,647 INFO L225 Difference]: With dead ends: 30 [2019-02-28 10:10:28,647 INFO L226 Difference]: Without dead ends: 29 [2019-02-28 10:10:28,649 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=274, Invalid=1532, Unknown=0, NotChecked=0, Total=1806 [2019-02-28 10:10:28,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-02-28 10:10:28,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-02-28 10:10:28,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-02-28 10:10:28,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-02-28 10:10:28,653 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 25 [2019-02-28 10:10:28,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:28,654 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-02-28 10:10:28,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-02-28 10:10:28,654 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-02-28 10:10:28,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-02-28 10:10:28,655 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:28,655 INFO L402 BasicCegarLoop]: trace histogram [13, 12, 1, 1] [2019-02-28 10:10:28,655 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:28,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:28,655 INFO L82 PathProgramCache]: Analyzing trace with hash 367613688, now seen corresponding path program 12 times [2019-02-28 10:10:28,655 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:28,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:28,656 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:28,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:28,657 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:28,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:29,308 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:29,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:29,308 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:29,309 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:29,309 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:29,309 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:29,309 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:10:29,317 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:10:29,317 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:10:29,333 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:10:29,333 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:29,334 WARN L254 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 31 conjunts are in the unsatisfiable core [2019-02-28 10:10:29,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:29,342 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:10:29,342 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:10:29,348 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:10:29,348 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:10:29,676 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:10:29,676 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:10:29,681 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:10:29,681 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:10:29,702 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:29,703 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:30,332 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:30,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:30,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 44 [2019-02-28 10:10:30,351 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:30,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-02-28 10:10:30,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-02-28 10:10:30,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=308, Invalid=1762, Unknown=0, NotChecked=0, Total=2070 [2019-02-28 10:10:30,352 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 31 states. [2019-02-28 10:10:30,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:30,835 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-02-28 10:10:30,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-02-28 10:10:30,835 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 27 [2019-02-28 10:10:30,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:30,836 INFO L225 Difference]: With dead ends: 32 [2019-02-28 10:10:30,836 INFO L226 Difference]: Without dead ends: 31 [2019-02-28 10:10:30,838 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 476 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=308, Invalid=1762, Unknown=0, NotChecked=0, Total=2070 [2019-02-28 10:10:30,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-02-28 10:10:30,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-02-28 10:10:30,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-02-28 10:10:30,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-02-28 10:10:30,842 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 27 [2019-02-28 10:10:30,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:30,843 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-02-28 10:10:30,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-02-28 10:10:30,843 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-02-28 10:10:30,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-02-28 10:10:30,844 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:30,844 INFO L402 BasicCegarLoop]: trace histogram [14, 13, 1, 1] [2019-02-28 10:10:30,844 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:30,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:30,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1089436986, now seen corresponding path program 13 times [2019-02-28 10:10:30,844 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:30,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:30,845 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:30,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:30,846 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:30,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:31,123 WARN L181 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-28 10:10:31,385 WARN L181 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-28 10:10:31,677 WARN L181 SmtUtils]: Spent 219.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-28 10:10:31,990 WARN L181 SmtUtils]: Spent 219.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-28 10:10:32,257 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-28 10:10:32,743 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:32,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:32,744 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:32,744 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:32,744 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:32,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:32,744 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:10:32,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:32,753 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:10:32,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:32,763 WARN L254 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 33 conjunts are in the unsatisfiable core [2019-02-28 10:10:32,764 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:32,767 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:10:32,767 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:10:32,771 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:10:32,771 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:10:33,253 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:10:33,254 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:10:33,258 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:10:33,258 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:10:33,279 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:33,279 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:33,876 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:33,894 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:33,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 47 [2019-02-28 10:10:33,894 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:33,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-02-28 10:10:33,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-02-28 10:10:33,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=344, Invalid=2008, Unknown=0, NotChecked=0, Total=2352 [2019-02-28 10:10:33,896 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 33 states. [2019-02-28 10:10:34,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:34,730 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-02-28 10:10:34,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-02-28 10:10:34,731 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 29 [2019-02-28 10:10:34,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:34,732 INFO L225 Difference]: With dead ends: 34 [2019-02-28 10:10:34,732 INFO L226 Difference]: Without dead ends: 33 [2019-02-28 10:10:34,738 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 540 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=344, Invalid=2008, Unknown=0, NotChecked=0, Total=2352 [2019-02-28 10:10:34,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-02-28 10:10:34,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2019-02-28 10:10:34,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-02-28 10:10:34,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-02-28 10:10:34,742 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 29 [2019-02-28 10:10:34,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:34,742 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-02-28 10:10:34,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-02-28 10:10:34,743 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-02-28 10:10:34,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-02-28 10:10:34,743 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:34,743 INFO L402 BasicCegarLoop]: trace histogram [15, 14, 1, 1] [2019-02-28 10:10:34,744 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:34,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:34,744 INFO L82 PathProgramCache]: Analyzing trace with hash -1023075588, now seen corresponding path program 14 times [2019-02-28 10:10:34,744 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:34,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:34,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:34,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:34,745 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:34,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:35,518 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:35,519 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:35,519 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:35,519 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:35,519 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:35,519 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:35,519 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:10:35,528 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:10:35,528 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:10:35,549 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-02-28 10:10:35,549 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:35,550 WARN L254 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 35 conjunts are in the unsatisfiable core [2019-02-28 10:10:35,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:35,555 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:10:35,556 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:10:35,562 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:10:35,562 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:10:35,964 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:10:35,965 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:10:35,969 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:10:35,969 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:10:35,990 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:35,991 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:36,985 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:37,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:37,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 50 [2019-02-28 10:10:37,004 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:37,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-02-28 10:10:37,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-02-28 10:10:37,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=382, Invalid=2270, Unknown=0, NotChecked=0, Total=2652 [2019-02-28 10:10:37,005 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 35 states. [2019-02-28 10:10:37,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:37,642 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-02-28 10:10:37,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-02-28 10:10:37,643 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 31 [2019-02-28 10:10:37,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:37,644 INFO L225 Difference]: With dead ends: 36 [2019-02-28 10:10:37,644 INFO L226 Difference]: Without dead ends: 35 [2019-02-28 10:10:37,646 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 608 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=382, Invalid=2270, Unknown=0, NotChecked=0, Total=2652 [2019-02-28 10:10:37,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-02-28 10:10:37,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2019-02-28 10:10:37,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-02-28 10:10:37,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-02-28 10:10:37,650 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 31 [2019-02-28 10:10:37,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:37,650 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-02-28 10:10:37,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-02-28 10:10:37,650 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-02-28 10:10:37,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-02-28 10:10:37,651 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:37,651 INFO L402 BasicCegarLoop]: trace histogram [16, 15, 1, 1] [2019-02-28 10:10:37,651 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:37,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:37,652 INFO L82 PathProgramCache]: Analyzing trace with hash 371871806, now seen corresponding path program 15 times [2019-02-28 10:10:37,652 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:37,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:37,652 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:37,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:37,653 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:37,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:38,231 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:38,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:38,231 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:38,231 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:38,231 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:38,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:38,231 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:10:38,239 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:10:38,239 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:10:38,251 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:10:38,251 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:38,252 WARN L254 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 37 conjunts are in the unsatisfiable core [2019-02-28 10:10:38,254 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:38,269 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:10:38,269 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:10:38,276 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:10:38,277 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:10:38,726 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:10:38,727 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:10:38,731 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:10:38,732 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:10:38,754 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:38,754 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:39,476 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-02-28 10:10:39,995 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:40,015 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:40,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 53 [2019-02-28 10:10:40,015 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:40,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-02-28 10:10:40,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-02-28 10:10:40,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=422, Invalid=2548, Unknown=0, NotChecked=0, Total=2970 [2019-02-28 10:10:40,016 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 37 states. [2019-02-28 10:10:40,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:40,501 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-02-28 10:10:40,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-02-28 10:10:40,501 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 33 [2019-02-28 10:10:40,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:40,502 INFO L225 Difference]: With dead ends: 38 [2019-02-28 10:10:40,502 INFO L226 Difference]: Without dead ends: 37 [2019-02-28 10:10:40,504 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 680 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=422, Invalid=2548, Unknown=0, NotChecked=0, Total=2970 [2019-02-28 10:10:40,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-02-28 10:10:40,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2019-02-28 10:10:40,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-02-28 10:10:40,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-02-28 10:10:40,508 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 33 [2019-02-28 10:10:40,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:40,508 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-02-28 10:10:40,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-02-28 10:10:40,508 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-02-28 10:10:40,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-02-28 10:10:40,509 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:40,509 INFO L402 BasicCegarLoop]: trace histogram [17, 16, 1, 1] [2019-02-28 10:10:40,509 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:40,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:40,509 INFO L82 PathProgramCache]: Analyzing trace with hash 886521088, now seen corresponding path program 16 times [2019-02-28 10:10:40,510 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:40,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:40,510 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:40,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:40,510 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:40,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:41,050 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:41,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:41,050 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:41,051 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:41,051 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:41,051 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:41,051 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:10:41,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:41,060 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:10:41,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:41,070 WARN L254 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 39 conjunts are in the unsatisfiable core [2019-02-28 10:10:41,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:41,074 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:10:41,074 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:10:41,082 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:10:41,083 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:10:41,610 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:10:41,610 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:10:41,615 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:10:41,615 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:10:41,639 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:41,639 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:42,527 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:42,545 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:42,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 56 [2019-02-28 10:10:42,545 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:42,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-02-28 10:10:42,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-02-28 10:10:42,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=464, Invalid=2842, Unknown=0, NotChecked=0, Total=3306 [2019-02-28 10:10:42,547 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 39 states. [2019-02-28 10:10:43,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:43,431 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-02-28 10:10:43,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-02-28 10:10:43,432 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 35 [2019-02-28 10:10:43,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:43,433 INFO L225 Difference]: With dead ends: 40 [2019-02-28 10:10:43,433 INFO L226 Difference]: Without dead ends: 39 [2019-02-28 10:10:43,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 756 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=464, Invalid=2842, Unknown=0, NotChecked=0, Total=3306 [2019-02-28 10:10:43,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-02-28 10:10:43,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2019-02-28 10:10:43,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-02-28 10:10:43,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-02-28 10:10:43,440 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 35 [2019-02-28 10:10:43,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:43,440 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-02-28 10:10:43,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-02-28 10:10:43,440 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-02-28 10:10:43,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-02-28 10:10:43,441 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:43,441 INFO L402 BasicCegarLoop]: trace histogram [18, 17, 1, 1] [2019-02-28 10:10:43,441 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:43,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:43,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1543242050, now seen corresponding path program 17 times [2019-02-28 10:10:43,441 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:43,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:43,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:43,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:43,442 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:43,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:43,704 WARN L181 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-28 10:10:43,977 WARN L181 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-28 10:10:44,269 WARN L181 SmtUtils]: Spent 219.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-28 10:10:44,594 WARN L181 SmtUtils]: Spent 227.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-28 10:10:45,266 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:45,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:45,266 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:45,266 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:45,266 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:45,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:45,267 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:10:45,274 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:10:45,275 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:10:45,297 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-02-28 10:10:45,297 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:45,298 WARN L254 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 41 conjunts are in the unsatisfiable core [2019-02-28 10:10:45,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:45,301 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:10:45,302 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:10:45,310 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:10:45,310 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:10:46,012 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:10:46,013 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:10:46,018 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:10:46,019 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:10:46,045 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:46,045 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:47,136 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:47,154 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:47,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 59 [2019-02-28 10:10:47,154 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:47,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-02-28 10:10:47,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-02-28 10:10:47,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=508, Invalid=3152, Unknown=0, NotChecked=0, Total=3660 [2019-02-28 10:10:47,156 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 41 states. [2019-02-28 10:10:47,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:47,969 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-02-28 10:10:47,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-02-28 10:10:47,969 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 37 [2019-02-28 10:10:47,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:47,970 INFO L225 Difference]: With dead ends: 42 [2019-02-28 10:10:47,970 INFO L226 Difference]: Without dead ends: 41 [2019-02-28 10:10:47,972 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 836 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=508, Invalid=3152, Unknown=0, NotChecked=0, Total=3660 [2019-02-28 10:10:47,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-02-28 10:10:47,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2019-02-28 10:10:47,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-02-28 10:10:47,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-02-28 10:10:47,977 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 37 [2019-02-28 10:10:47,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:47,977 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-02-28 10:10:47,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-02-28 10:10:47,977 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-02-28 10:10:47,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-02-28 10:10:47,978 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:47,978 INFO L402 BasicCegarLoop]: trace histogram [19, 18, 1, 1] [2019-02-28 10:10:47,978 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:47,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:47,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1291894020, now seen corresponding path program 18 times [2019-02-28 10:10:47,979 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:47,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:47,979 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:47,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:47,980 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:47,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:48,648 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:48,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:48,648 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:48,649 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:48,649 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:48,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:48,649 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:10:48,658 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:10:48,658 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:10:48,683 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:10:48,683 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:48,684 WARN L254 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 43 conjunts are in the unsatisfiable core [2019-02-28 10:10:48,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:48,697 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:10:48,698 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:10:48,707 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:10:48,708 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:10:49,347 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:10:49,347 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:10:49,353 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:10:49,353 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:10:49,379 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:49,379 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:50,602 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:50,620 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:50,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 62 [2019-02-28 10:10:50,621 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:50,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-02-28 10:10:50,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-02-28 10:10:50,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=554, Invalid=3478, Unknown=0, NotChecked=0, Total=4032 [2019-02-28 10:10:50,623 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 43 states. [2019-02-28 10:10:51,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:51,635 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-02-28 10:10:51,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-02-28 10:10:51,636 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 39 [2019-02-28 10:10:51,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:51,637 INFO L225 Difference]: With dead ends: 44 [2019-02-28 10:10:51,637 INFO L226 Difference]: Without dead ends: 43 [2019-02-28 10:10:51,639 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 920 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=554, Invalid=3478, Unknown=0, NotChecked=0, Total=4032 [2019-02-28 10:10:51,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-02-28 10:10:51,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2019-02-28 10:10:51,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-02-28 10:10:51,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-02-28 10:10:51,643 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 39 [2019-02-28 10:10:51,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:51,643 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-02-28 10:10:51,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-02-28 10:10:51,643 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-02-28 10:10:51,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-02-28 10:10:51,644 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:51,644 INFO L402 BasicCegarLoop]: trace histogram [20, 19, 1, 1] [2019-02-28 10:10:51,644 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:51,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:51,644 INFO L82 PathProgramCache]: Analyzing trace with hash 264605766, now seen corresponding path program 19 times [2019-02-28 10:10:51,644 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:51,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:51,645 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:51,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:51,645 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:51,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:52,573 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:52,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:52,573 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:52,573 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:52,573 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:52,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:52,574 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:10:52,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:52,586 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:10:52,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:52,599 WARN L254 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 45 conjunts are in the unsatisfiable core [2019-02-28 10:10:52,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:52,607 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:10:52,608 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:10:52,613 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:10:52,613 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:10:53,324 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:10:53,325 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:10:53,329 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:10:53,329 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:10:53,359 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:53,359 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:54,500 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:54,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:54,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 65 [2019-02-28 10:10:54,520 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:54,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-02-28 10:10:54,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-02-28 10:10:54,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=602, Invalid=3820, Unknown=0, NotChecked=0, Total=4422 [2019-02-28 10:10:54,521 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 45 states. [2019-02-28 10:10:55,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:55,525 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-02-28 10:10:55,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-02-28 10:10:55,525 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 41 [2019-02-28 10:10:55,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:55,526 INFO L225 Difference]: With dead ends: 46 [2019-02-28 10:10:55,526 INFO L226 Difference]: Without dead ends: 45 [2019-02-28 10:10:55,527 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1008 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=602, Invalid=3820, Unknown=0, NotChecked=0, Total=4422 [2019-02-28 10:10:55,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-02-28 10:10:55,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2019-02-28 10:10:55,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-02-28 10:10:55,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-02-28 10:10:55,532 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 41 [2019-02-28 10:10:55,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:55,532 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-02-28 10:10:55,532 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-02-28 10:10:55,533 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-02-28 10:10:55,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-02-28 10:10:55,533 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:55,533 INFO L402 BasicCegarLoop]: trace histogram [21, 20, 1, 1] [2019-02-28 10:10:55,533 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:55,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:55,534 INFO L82 PathProgramCache]: Analyzing trace with hash 883071752, now seen corresponding path program 20 times [2019-02-28 10:10:55,534 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:55,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:55,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:55,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:55,535 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:55,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:56,228 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:56,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:56,229 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:56,229 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:56,229 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:56,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:56,229 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:10:56,238 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:10:56,238 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:10:56,264 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2019-02-28 10:10:56,264 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:56,265 WARN L254 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 47 conjunts are in the unsatisfiable core [2019-02-28 10:10:56,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:56,271 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:10:56,271 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:10:56,278 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:10:56,278 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:10:57,083 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:10:57,084 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:10:57,088 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:10:57,088 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:10:57,118 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:57,119 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:58,307 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:58,326 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:58,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 68 [2019-02-28 10:10:58,327 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:58,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-02-28 10:10:58,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-02-28 10:10:58,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=652, Invalid=4178, Unknown=0, NotChecked=0, Total=4830 [2019-02-28 10:10:58,328 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 47 states. [2019-02-28 10:10:59,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:59,182 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-02-28 10:10:59,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-02-28 10:10:59,182 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 43 [2019-02-28 10:10:59,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:59,183 INFO L225 Difference]: With dead ends: 48 [2019-02-28 10:10:59,183 INFO L226 Difference]: Without dead ends: 47 [2019-02-28 10:10:59,184 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1100 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=652, Invalid=4178, Unknown=0, NotChecked=0, Total=4830 [2019-02-28 10:10:59,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-02-28 10:10:59,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2019-02-28 10:10:59,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-02-28 10:10:59,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-02-28 10:10:59,190 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 43 [2019-02-28 10:10:59,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:59,190 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-02-28 10:10:59,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-02-28 10:10:59,190 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-02-28 10:10:59,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-02-28 10:10:59,191 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:59,191 INFO L402 BasicCegarLoop]: trace histogram [22, 21, 1, 1] [2019-02-28 10:10:59,191 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:59,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:59,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1771569846, now seen corresponding path program 21 times [2019-02-28 10:10:59,192 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:59,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:59,192 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:59,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:59,193 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:59,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:00,053 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:00,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:00,053 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:11:00,053 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:11:00,053 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:11:00,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:00,053 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:11:00,062 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:11:00,062 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:11:00,077 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:11:00,077 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:11:00,078 WARN L254 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 49 conjunts are in the unsatisfiable core [2019-02-28 10:11:00,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:11:00,089 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:11:00,089 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:11:00,101 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:11:00,101 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:11:00,997 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:11:00,998 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:11:01,003 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:11:01,003 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:11:01,037 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:01,037 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:11:02,368 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:02,386 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:11:02,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 71 [2019-02-28 10:11:02,387 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:11:02,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-02-28 10:11:02,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-02-28 10:11:02,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=704, Invalid=4552, Unknown=0, NotChecked=0, Total=5256 [2019-02-28 10:11:02,388 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 49 states. [2019-02-28 10:11:03,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:11:03,492 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-02-28 10:11:03,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-02-28 10:11:03,493 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 45 [2019-02-28 10:11:03,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:11:03,494 INFO L225 Difference]: With dead ends: 50 [2019-02-28 10:11:03,494 INFO L226 Difference]: Without dead ends: 49 [2019-02-28 10:11:03,495 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1196 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=704, Invalid=4552, Unknown=0, NotChecked=0, Total=5256 [2019-02-28 10:11:03,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-02-28 10:11:03,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2019-02-28 10:11:03,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-02-28 10:11:03,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-02-28 10:11:03,500 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 45 [2019-02-28 10:11:03,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:11:03,500 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-02-28 10:11:03,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-02-28 10:11:03,500 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-02-28 10:11:03,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-02-28 10:11:03,501 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:11:03,501 INFO L402 BasicCegarLoop]: trace histogram [23, 22, 1, 1] [2019-02-28 10:11:03,501 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:11:03,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:11:03,501 INFO L82 PathProgramCache]: Analyzing trace with hash -1671571700, now seen corresponding path program 22 times [2019-02-28 10:11:03,501 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:11:03,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:03,502 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:11:03,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:03,502 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:11:03,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:03,751 WARN L181 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-28 10:11:04,570 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:04,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:04,571 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:11:04,571 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:11:04,571 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:11:04,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:04,571 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:11:04,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:11:04,579 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:11:04,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:04,591 WARN L254 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 51 conjunts are in the unsatisfiable core [2019-02-28 10:11:04,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:11:04,596 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:11:04,597 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:11:04,602 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:11:04,602 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:11:05,657 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:11:05,658 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:11:05,662 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:11:05,662 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:11:05,698 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:05,698 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:11:07,157 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:07,175 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:11:07,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 74 [2019-02-28 10:11:07,175 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:11:07,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-02-28 10:11:07,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-02-28 10:11:07,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=758, Invalid=4942, Unknown=0, NotChecked=0, Total=5700 [2019-02-28 10:11:07,177 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 51 states. [2019-02-28 10:11:08,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:11:08,272 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-02-28 10:11:08,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-02-28 10:11:08,272 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 47 [2019-02-28 10:11:08,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:11:08,273 INFO L225 Difference]: With dead ends: 52 [2019-02-28 10:11:08,273 INFO L226 Difference]: Without dead ends: 51 [2019-02-28 10:11:08,274 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1296 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=758, Invalid=4942, Unknown=0, NotChecked=0, Total=5700 [2019-02-28 10:11:08,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-02-28 10:11:08,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2019-02-28 10:11:08,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-02-28 10:11:08,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-02-28 10:11:08,279 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 47 [2019-02-28 10:11:08,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:11:08,280 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-02-28 10:11:08,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-02-28 10:11:08,280 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-02-28 10:11:08,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-02-28 10:11:08,280 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:11:08,281 INFO L402 BasicCegarLoop]: trace histogram [24, 23, 1, 1] [2019-02-28 10:11:08,281 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:11:08,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:11:08,281 INFO L82 PathProgramCache]: Analyzing trace with hash -62633906, now seen corresponding path program 23 times [2019-02-28 10:11:08,281 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:11:08,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:08,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:11:08,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:08,282 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:11:08,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:09,103 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:09,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:09,103 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:11:09,103 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:11:09,103 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:11:09,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:09,103 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:11:09,112 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:11:09,113 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:11:09,139 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-02-28 10:11:09,140 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:11:09,141 WARN L254 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 53 conjunts are in the unsatisfiable core [2019-02-28 10:11:09,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:11:09,143 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:11:09,143 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:11:09,148 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:11:09,148 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:11:10,330 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:11:10,330 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:11:10,335 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:11:10,335 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:11:10,372 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:10,373 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:11:11,935 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:11,954 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:11:11,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 77 [2019-02-28 10:11:11,954 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:11:11,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-02-28 10:11:11,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-02-28 10:11:11,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=814, Invalid=5348, Unknown=0, NotChecked=0, Total=6162 [2019-02-28 10:11:11,956 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 53 states. [2019-02-28 10:11:13,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:11:13,395 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-02-28 10:11:13,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-02-28 10:11:13,395 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 49 [2019-02-28 10:11:13,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:11:13,396 INFO L225 Difference]: With dead ends: 54 [2019-02-28 10:11:13,397 INFO L226 Difference]: Without dead ends: 53 [2019-02-28 10:11:13,398 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1400 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=814, Invalid=5348, Unknown=0, NotChecked=0, Total=6162 [2019-02-28 10:11:13,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-02-28 10:11:13,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2019-02-28 10:11:13,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-02-28 10:11:13,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-02-28 10:11:13,404 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 49 [2019-02-28 10:11:13,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:11:13,404 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-02-28 10:11:13,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-02-28 10:11:13,404 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-02-28 10:11:13,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-02-28 10:11:13,405 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:11:13,405 INFO L402 BasicCegarLoop]: trace histogram [25, 24, 1, 1] [2019-02-28 10:11:13,406 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:11:13,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:11:13,406 INFO L82 PathProgramCache]: Analyzing trace with hash -61640432, now seen corresponding path program 24 times [2019-02-28 10:11:13,406 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:11:13,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:13,407 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:11:13,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:13,407 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:11:13,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:14,337 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:14,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:14,337 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:11:14,337 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:11:14,337 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:11:14,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:14,337 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:11:14,346 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:11:14,346 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:11:14,361 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:11:14,361 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:11:14,362 WARN L254 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 55 conjunts are in the unsatisfiable core [2019-02-28 10:11:14,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:11:14,365 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:11:14,365 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:11:14,373 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:11:14,373 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:11:15,448 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:11:15,449 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:11:15,455 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:11:15,455 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:11:15,492 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:15,492 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:11:18,414 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:18,432 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:11:18,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 80 [2019-02-28 10:11:18,433 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:11:18,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-02-28 10:11:18,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-02-28 10:11:18,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=872, Invalid=5770, Unknown=0, NotChecked=0, Total=6642 [2019-02-28 10:11:18,434 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 55 states. [2019-02-28 10:11:19,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:11:19,610 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-02-28 10:11:19,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-02-28 10:11:19,611 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 51 [2019-02-28 10:11:19,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:11:19,612 INFO L225 Difference]: With dead ends: 56 [2019-02-28 10:11:19,612 INFO L226 Difference]: Without dead ends: 55 [2019-02-28 10:11:19,612 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1508 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=872, Invalid=5770, Unknown=0, NotChecked=0, Total=6642 [2019-02-28 10:11:19,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-02-28 10:11:19,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2019-02-28 10:11:19,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-02-28 10:11:19,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-02-28 10:11:19,616 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 51 [2019-02-28 10:11:19,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:11:19,617 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-02-28 10:11:19,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-02-28 10:11:19,617 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-02-28 10:11:19,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-02-28 10:11:19,617 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:11:19,618 INFO L402 BasicCegarLoop]: trace histogram [26, 25, 1, 1] [2019-02-28 10:11:19,618 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:11:19,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:11:19,618 INFO L82 PathProgramCache]: Analyzing trace with hash 893088082, now seen corresponding path program 25 times [2019-02-28 10:11:19,618 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:11:19,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:19,619 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:11:19,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:19,619 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:11:19,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:19,822 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-28 10:11:20,848 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:20,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:20,849 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:11:20,849 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:11:20,849 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:11:20,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:20,849 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:11:20,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:11:20,861 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:11:20,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:20,875 WARN L254 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 57 conjunts are in the unsatisfiable core [2019-02-28 10:11:20,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:11:20,879 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:11:20,879 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:11:20,891 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:11:20,892 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:11:21,956 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:11:21,957 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:11:21,962 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:11:21,963 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:11:22,001 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:22,001 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:11:23,773 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:23,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:11:23,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 83 [2019-02-28 10:11:23,791 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:11:23,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-02-28 10:11:23,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-02-28 10:11:23,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=932, Invalid=6208, Unknown=0, NotChecked=0, Total=7140 [2019-02-28 10:11:23,792 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 57 states. [2019-02-28 10:11:25,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:11:25,029 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-02-28 10:11:25,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-02-28 10:11:25,030 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 53 [2019-02-28 10:11:25,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:11:25,030 INFO L225 Difference]: With dead ends: 58 [2019-02-28 10:11:25,031 INFO L226 Difference]: Without dead ends: 57 [2019-02-28 10:11:25,031 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1620 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=932, Invalid=6208, Unknown=0, NotChecked=0, Total=7140 [2019-02-28 10:11:25,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-02-28 10:11:25,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2019-02-28 10:11:25,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-02-28 10:11:25,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-02-28 10:11:25,035 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 53 [2019-02-28 10:11:25,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:11:25,035 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-02-28 10:11:25,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-02-28 10:11:25,035 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-02-28 10:11:25,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-02-28 10:11:25,036 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:11:25,036 INFO L402 BasicCegarLoop]: trace histogram [27, 26, 1, 1] [2019-02-28 10:11:25,036 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:11:25,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:11:25,037 INFO L82 PathProgramCache]: Analyzing trace with hash -735811308, now seen corresponding path program 26 times [2019-02-28 10:11:25,037 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:11:25,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:25,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:11:25,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:25,038 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:11:25,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:26,286 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:26,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:26,286 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:11:26,287 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:11:26,287 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:11:26,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:26,287 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:11:26,295 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:11:26,296 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:11:26,328 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2019-02-28 10:11:26,328 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:11:26,329 WARN L254 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 59 conjunts are in the unsatisfiable core [2019-02-28 10:11:26,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:11:26,349 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:11:26,350 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:11:26,369 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:11:26,370 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:11:27,496 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:11:27,497 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:11:27,503 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:11:27,503 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:11:27,546 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:27,546 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:11:29,487 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:29,505 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:11:29,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 86 [2019-02-28 10:11:29,506 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:11:29,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-02-28 10:11:29,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-02-28 10:11:29,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=994, Invalid=6662, Unknown=0, NotChecked=0, Total=7656 [2019-02-28 10:11:29,507 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 59 states. [2019-02-28 10:11:31,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:11:31,426 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-02-28 10:11:31,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-02-28 10:11:31,426 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 55 [2019-02-28 10:11:31,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:11:31,427 INFO L225 Difference]: With dead ends: 60 [2019-02-28 10:11:31,427 INFO L226 Difference]: Without dead ends: 59 [2019-02-28 10:11:31,428 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1736 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=994, Invalid=6662, Unknown=0, NotChecked=0, Total=7656 [2019-02-28 10:11:31,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-02-28 10:11:31,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2019-02-28 10:11:31,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-02-28 10:11:31,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-02-28 10:11:31,432 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 55 [2019-02-28 10:11:31,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:11:31,432 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-02-28 10:11:31,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-02-28 10:11:31,432 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-02-28 10:11:31,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-02-28 10:11:31,433 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:11:31,433 INFO L402 BasicCegarLoop]: trace histogram [28, 27, 1, 1] [2019-02-28 10:11:31,433 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:11:31,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:11:31,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1554937942, now seen corresponding path program 27 times [2019-02-28 10:11:31,433 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:11:31,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:31,434 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:11:31,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:31,434 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:11:31,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:32,532 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:32,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:32,532 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:11:32,532 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:11:32,533 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:11:32,533 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:32,533 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:11:32,547 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:11:32,547 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:11:32,564 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:11:32,564 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:11:32,565 WARN L254 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 61 conjunts are in the unsatisfiable core [2019-02-28 10:11:32,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:11:32,568 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:11:32,568 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:11:32,576 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:11:32,576 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:11:33,764 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:11:33,765 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:11:33,771 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:11:33,771 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:11:33,813 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:33,813 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:11:36,035 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:36,053 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:11:36,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 89 [2019-02-28 10:11:36,054 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:11:36,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-02-28 10:11:36,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-02-28 10:11:36,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1058, Invalid=7132, Unknown=0, NotChecked=0, Total=8190 [2019-02-28 10:11:36,055 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 61 states. [2019-02-28 10:11:37,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:11:37,499 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-02-28 10:11:37,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-02-28 10:11:37,500 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 57 [2019-02-28 10:11:37,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:11:37,501 INFO L225 Difference]: With dead ends: 62 [2019-02-28 10:11:37,501 INFO L226 Difference]: Without dead ends: 61 [2019-02-28 10:11:37,501 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1856 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1058, Invalid=7132, Unknown=0, NotChecked=0, Total=8190 [2019-02-28 10:11:37,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-02-28 10:11:37,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2019-02-28 10:11:37,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-02-28 10:11:37,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-02-28 10:11:37,505 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 57 [2019-02-28 10:11:37,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:11:37,505 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-02-28 10:11:37,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-02-28 10:11:37,505 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-02-28 10:11:37,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-02-28 10:11:37,506 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:11:37,506 INFO L402 BasicCegarLoop]: trace histogram [29, 28, 1, 1] [2019-02-28 10:11:37,506 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:11:37,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:11:37,506 INFO L82 PathProgramCache]: Analyzing trace with hash -353255656, now seen corresponding path program 28 times [2019-02-28 10:11:37,506 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:11:37,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:37,507 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:11:37,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:37,507 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:11:37,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:38,582 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:38,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:38,582 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:11:38,583 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:11:38,583 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:11:38,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:38,583 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:11:38,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:11:38,593 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:11:38,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:38,611 WARN L254 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 63 conjunts are in the unsatisfiable core [2019-02-28 10:11:38,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:11:38,618 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:11:38,618 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:11:38,629 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:11:38,630 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:11:39,909 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:11:39,910 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:11:39,919 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:11:39,920 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:11:39,963 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:39,963 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:11:42,389 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:42,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:11:42,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 92 [2019-02-28 10:11:42,408 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:11:42,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-02-28 10:11:42,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-02-28 10:11:42,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1124, Invalid=7618, Unknown=0, NotChecked=0, Total=8742 [2019-02-28 10:11:42,410 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 63 states. [2019-02-28 10:11:43,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:11:43,882 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-02-28 10:11:43,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-02-28 10:11:43,883 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 59 [2019-02-28 10:11:43,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:11:43,884 INFO L225 Difference]: With dead ends: 64 [2019-02-28 10:11:43,884 INFO L226 Difference]: Without dead ends: 63 [2019-02-28 10:11:43,885 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1980 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=1124, Invalid=7618, Unknown=0, NotChecked=0, Total=8742 [2019-02-28 10:11:43,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-02-28 10:11:43,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2019-02-28 10:11:43,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-02-28 10:11:43,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-02-28 10:11:43,889 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 59 [2019-02-28 10:11:43,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:11:43,889 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-02-28 10:11:43,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-02-28 10:11:43,889 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-02-28 10:11:43,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-02-28 10:11:43,890 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:11:43,890 INFO L402 BasicCegarLoop]: trace histogram [30, 29, 1, 1] [2019-02-28 10:11:43,890 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:11:43,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:11:43,891 INFO L82 PathProgramCache]: Analyzing trace with hash -176267942, now seen corresponding path program 29 times [2019-02-28 10:11:43,891 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:11:43,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:43,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:11:43,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:43,892 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:11:43,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:44,155 WARN L181 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-28 10:11:45,187 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:45,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:45,188 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:11:45,188 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:11:45,188 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:11:45,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:45,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 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:11:45,196 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:11:45,196 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:11:45,234 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2019-02-28 10:11:45,234 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:11:45,235 WARN L254 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 65 conjunts are in the unsatisfiable core [2019-02-28 10:11:45,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:11:45,239 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:11:45,239 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:11:45,250 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:11:45,250 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:11:46,890 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:11:46,891 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:11:46,896 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:11:46,896 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:11:46,942 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:46,943 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:11:49,297 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:49,315 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:11:49,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 95 [2019-02-28 10:11:49,315 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:11:49,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-02-28 10:11:49,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-02-28 10:11:49,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1192, Invalid=8120, Unknown=0, NotChecked=0, Total=9312 [2019-02-28 10:11:49,317 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 65 states. [2019-02-28 10:11:51,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:11:51,375 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-02-28 10:11:51,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-02-28 10:11:51,376 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 61 [2019-02-28 10:11:51,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:11:51,377 INFO L225 Difference]: With dead ends: 66 [2019-02-28 10:11:51,377 INFO L226 Difference]: Without dead ends: 65 [2019-02-28 10:11:51,378 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2108 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=1192, Invalid=8120, Unknown=0, NotChecked=0, Total=9312 [2019-02-28 10:11:51,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-02-28 10:11:51,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2019-02-28 10:11:51,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-02-28 10:11:51,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-02-28 10:11:51,382 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 61 [2019-02-28 10:11:51,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:11:51,382 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-02-28 10:11:51,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-02-28 10:11:51,382 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-02-28 10:11:51,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-02-28 10:11:51,382 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:11:51,383 INFO L402 BasicCegarLoop]: trace histogram [31, 30, 1, 1] [2019-02-28 10:11:51,383 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:11:51,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:11:51,383 INFO L82 PathProgramCache]: Analyzing trace with hash -1889766628, now seen corresponding path program 30 times [2019-02-28 10:11:51,383 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:11:51,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:51,384 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:11:51,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:51,384 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:11:51,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:51,660 WARN L181 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-28 10:11:51,809 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-28 10:11:52,837 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:52,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:52,838 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:11:52,838 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:11:52,838 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:11:52,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:52,838 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:11:52,848 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:11:52,848 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:11:52,866 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:11:52,866 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:11:52,867 WARN L254 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 67 conjunts are in the unsatisfiable core [2019-02-28 10:11:52,868 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:11:52,871 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:11:52,871 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:11:52,879 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:11:52,879 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:11:54,334 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:11:54,335 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:11:54,339 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:11:54,339 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:11:54,386 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:54,386 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:11:57,064 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:57,082 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:11:57,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 98 [2019-02-28 10:11:57,082 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:11:57,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-02-28 10:11:57,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-02-28 10:11:57,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1262, Invalid=8638, Unknown=0, NotChecked=0, Total=9900 [2019-02-28 10:11:57,084 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 67 states. [2019-02-28 10:11:58,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:11:58,738 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-02-28 10:11:58,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-02-28 10:11:58,738 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 63 [2019-02-28 10:11:58,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:11:58,739 INFO L225 Difference]: With dead ends: 68 [2019-02-28 10:11:58,739 INFO L226 Difference]: Without dead ends: 67 [2019-02-28 10:11:58,740 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2240 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=1262, Invalid=8638, Unknown=0, NotChecked=0, Total=9900 [2019-02-28 10:11:58,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-02-28 10:11:58,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2019-02-28 10:11:58,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-02-28 10:11:58,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-02-28 10:11:58,745 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 63 [2019-02-28 10:11:58,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:11:58,745 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-02-28 10:11:58,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-02-28 10:11:58,745 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-02-28 10:11:58,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-02-28 10:11:58,746 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:11:58,746 INFO L402 BasicCegarLoop]: trace histogram [32, 31, 1, 1] [2019-02-28 10:11:58,746 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:11:58,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:11:58,747 INFO L82 PathProgramCache]: Analyzing trace with hash 705437790, now seen corresponding path program 31 times [2019-02-28 10:11:58,747 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:11:58,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:58,747 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:11:58,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:58,748 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:11:58,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:58,918 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-28 10:12:00,018 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:00,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:00,019 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:12:00,019 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:12:00,019 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:12:00,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:00,019 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:12:00,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:12:00,028 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:12:00,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:12:00,049 WARN L254 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 69 conjunts are in the unsatisfiable core [2019-02-28 10:12:00,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:12:00,052 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:12:00,052 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:12:00,058 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:12:00,058 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:12:01,936 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:12:01,937 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:12:01,941 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:12:01,941 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:12:01,990 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:01,990 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:12:04,621 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:04,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:12:04,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 101 [2019-02-28 10:12:04,640 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:12:04,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-02-28 10:12:04,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-02-28 10:12:04,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1334, Invalid=9172, Unknown=0, NotChecked=0, Total=10506 [2019-02-28 10:12:04,641 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 69 states. [2019-02-28 10:12:06,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:12:06,734 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-02-28 10:12:06,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-02-28 10:12:06,734 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 65 [2019-02-28 10:12:06,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:12:06,735 INFO L225 Difference]: With dead ends: 70 [2019-02-28 10:12:06,735 INFO L226 Difference]: Without dead ends: 69 [2019-02-28 10:12:06,736 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2376 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=1334, Invalid=9172, Unknown=0, NotChecked=0, Total=10506 [2019-02-28 10:12:06,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-02-28 10:12:06,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2019-02-28 10:12:06,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-02-28 10:12:06,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-02-28 10:12:06,740 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 65 [2019-02-28 10:12:06,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:12:06,741 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-02-28 10:12:06,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-02-28 10:12:06,741 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-02-28 10:12:06,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-02-28 10:12:06,741 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:12:06,741 INFO L402 BasicCegarLoop]: trace histogram [33, 32, 1, 1] [2019-02-28 10:12:06,742 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:12:06,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:12:06,742 INFO L82 PathProgramCache]: Analyzing trace with hash -679115488, now seen corresponding path program 32 times [2019-02-28 10:12:06,742 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:12:06,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:06,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:12:06,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:06,743 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:12:06,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:12:07,992 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:07,992 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:07,993 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:12:07,993 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:12:07,993 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:12:07,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:07,993 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:12:08,001 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:12:08,001 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:12:08,046 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2019-02-28 10:12:08,046 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:12:08,047 WARN L254 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 71 conjunts are in the unsatisfiable core [2019-02-28 10:12:08,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:12:08,052 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:12:08,052 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:12:08,058 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:12:08,058 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:12:09,791 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:12:09,792 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:12:09,800 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:12:09,800 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:12:09,850 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:09,850 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:12:12,766 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:12,785 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:12:12,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 104 [2019-02-28 10:12:12,785 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:12:12,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-02-28 10:12:12,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-02-28 10:12:12,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1408, Invalid=9722, Unknown=0, NotChecked=0, Total=11130 [2019-02-28 10:12:12,786 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 71 states. [2019-02-28 10:12:15,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:12:15,433 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-02-28 10:12:15,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-02-28 10:12:15,433 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 67 [2019-02-28 10:12:15,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:12:15,434 INFO L225 Difference]: With dead ends: 72 [2019-02-28 10:12:15,434 INFO L226 Difference]: Without dead ends: 71 [2019-02-28 10:12:15,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2516 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=1408, Invalid=9722, Unknown=0, NotChecked=0, Total=11130 [2019-02-28 10:12:15,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-02-28 10:12:15,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2019-02-28 10:12:15,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-02-28 10:12:15,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-02-28 10:12:15,439 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 67 [2019-02-28 10:12:15,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:12:15,439 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-02-28 10:12:15,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-02-28 10:12:15,439 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-02-28 10:12:15,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-02-28 10:12:15,440 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:12:15,440 INFO L402 BasicCegarLoop]: trace histogram [34, 33, 1, 1] [2019-02-28 10:12:15,440 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:12:15,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:12:15,441 INFO L82 PathProgramCache]: Analyzing trace with hash 205046114, now seen corresponding path program 33 times [2019-02-28 10:12:15,441 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:12:15,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:15,441 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:12:15,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:15,442 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:12:15,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:12:15,680 WARN L181 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-28 10:12:17,114 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:17,115 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:17,115 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:12:17,115 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:12:17,115 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:12:17,115 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:17,115 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:12:17,123 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:12:17,123 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:12:17,145 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:12:17,145 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:12:17,146 WARN L254 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 73 conjunts are in the unsatisfiable core [2019-02-28 10:12:17,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:12:17,149 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:12:17,149 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:12:17,156 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:12:17,156 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:12:18,929 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:12:18,930 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:12:18,935 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:12:18,936 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:12:18,988 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:18,989 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:12:22,250 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:22,268 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:12:22,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 107 [2019-02-28 10:12:22,268 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:12:22,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-02-28 10:12:22,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-02-28 10:12:22,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1484, Invalid=10288, Unknown=0, NotChecked=0, Total=11772 [2019-02-28 10:12:22,270 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 73 states. [2019-02-28 10:12:24,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:12:24,501 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-02-28 10:12:24,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-02-28 10:12:24,501 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 69 [2019-02-28 10:12:24,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:12:24,502 INFO L225 Difference]: With dead ends: 74 [2019-02-28 10:12:24,503 INFO L226 Difference]: Without dead ends: 73 [2019-02-28 10:12:24,503 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2660 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=1484, Invalid=10288, Unknown=0, NotChecked=0, Total=11772 [2019-02-28 10:12:24,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-02-28 10:12:24,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2019-02-28 10:12:24,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-02-28 10:12:24,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-02-28 10:12:24,507 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 69 [2019-02-28 10:12:24,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:12:24,507 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-02-28 10:12:24,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-02-28 10:12:24,507 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-02-28 10:12:24,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-02-28 10:12:24,508 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:12:24,508 INFO L402 BasicCegarLoop]: trace histogram [35, 34, 1, 1] [2019-02-28 10:12:24,508 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:12:24,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:12:24,508 INFO L82 PathProgramCache]: Analyzing trace with hash -519178972, now seen corresponding path program 34 times [2019-02-28 10:12:24,509 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:12:24,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:24,509 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:12:24,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:24,509 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:12:24,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:12:25,895 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:25,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:25,896 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:12:25,896 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:12:25,896 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:12:25,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:25,896 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:12:25,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:12:25,906 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:12:25,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:12:25,927 WARN L254 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 75 conjunts are in the unsatisfiable core [2019-02-28 10:12:25,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:12:25,930 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:12:25,930 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:12:25,938 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:12:25,938 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:12:28,007 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:12:28,008 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:12:28,013 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:12:28,014 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:12:28,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:28,069 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:12:31,210 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:31,229 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:12:31,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 110 [2019-02-28 10:12:31,229 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:12:31,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-02-28 10:12:31,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-02-28 10:12:31,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1562, Invalid=10870, Unknown=0, NotChecked=0, Total=12432 [2019-02-28 10:12:31,230 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 75 states. [2019-02-28 10:12:33,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:12:33,838 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-02-28 10:12:33,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-02-28 10:12:33,844 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 71 [2019-02-28 10:12:33,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:12:33,844 INFO L225 Difference]: With dead ends: 76 [2019-02-28 10:12:33,845 INFO L226 Difference]: Without dead ends: 75 [2019-02-28 10:12:33,845 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2808 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=1562, Invalid=10870, Unknown=0, NotChecked=0, Total=12432 [2019-02-28 10:12:33,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-02-28 10:12:33,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2019-02-28 10:12:33,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-02-28 10:12:33,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-02-28 10:12:33,849 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 71 [2019-02-28 10:12:33,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:12:33,849 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-02-28 10:12:33,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-02-28 10:12:33,850 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-02-28 10:12:33,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-02-28 10:12:33,850 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:12:33,850 INFO L402 BasicCegarLoop]: trace histogram [36, 35, 1, 1] [2019-02-28 10:12:33,850 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:12:33,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:12:33,851 INFO L82 PathProgramCache]: Analyzing trace with hash -714784666, now seen corresponding path program 35 times [2019-02-28 10:12:33,851 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:12:33,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:33,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:12:33,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:33,852 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:12:33,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:12:34,040 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-28 10:12:35,401 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:35,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:35,402 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:12:35,402 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:12:35,402 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:12:35,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:35,402 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:12:35,412 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:12:35,412 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:12:35,584 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2019-02-28 10:12:35,584 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:12:35,586 WARN L254 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 77 conjunts are in the unsatisfiable core [2019-02-28 10:12:35,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:12:35,588 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:12:35,588 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:12:35,594 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:12:35,594 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:12:37,807 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:12:37,807 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:12:37,813 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:12:37,813 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:12:37,868 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:37,868 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:12:41,140 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:41,158 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:12:41,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 113 [2019-02-28 10:12:41,159 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:12:41,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-02-28 10:12:41,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-02-28 10:12:41,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1642, Invalid=11468, Unknown=0, NotChecked=0, Total=13110 [2019-02-28 10:12:41,160 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 77 states. [2019-02-28 10:12:44,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:12:44,250 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-02-28 10:12:44,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-02-28 10:12:44,251 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 73 [2019-02-28 10:12:44,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:12:44,252 INFO L225 Difference]: With dead ends: 78 [2019-02-28 10:12:44,252 INFO L226 Difference]: Without dead ends: 77 [2019-02-28 10:12:44,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2960 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=1642, Invalid=11468, Unknown=0, NotChecked=0, Total=13110 [2019-02-28 10:12:44,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-02-28 10:12:44,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2019-02-28 10:12:44,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-02-28 10:12:44,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-02-28 10:12:44,256 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 73 [2019-02-28 10:12:44,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:12:44,256 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-02-28 10:12:44,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-02-28 10:12:44,257 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-02-28 10:12:44,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-02-28 10:12:44,257 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:12:44,257 INFO L402 BasicCegarLoop]: trace histogram [37, 36, 1, 1] [2019-02-28 10:12:44,257 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:12:44,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:12:44,257 INFO L82 PathProgramCache]: Analyzing trace with hash 286704424, now seen corresponding path program 36 times [2019-02-28 10:12:44,257 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:12:44,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:44,258 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:12:44,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:44,258 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:12:44,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:12:44,470 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-28 10:12:45,894 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:45,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:45,894 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:12:45,895 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:12:45,895 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:12:45,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:45,895 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:12:45,903 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:12:45,903 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:12:45,927 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:12:45,927 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:12:45,928 WARN L254 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 79 conjunts are in the unsatisfiable core [2019-02-28 10:12:45,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:12:45,931 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:12:45,931 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:12:45,937 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:12:45,937 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:12:48,163 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:12:48,164 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:12:48,169 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:12:48,169 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:12:48,233 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:48,234 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:12:51,757 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:51,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:12:51,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 116 [2019-02-28 10:12:51,776 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:12:51,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-02-28 10:12:51,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-02-28 10:12:51,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1724, Invalid=12082, Unknown=0, NotChecked=0, Total=13806 [2019-02-28 10:12:51,777 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 79 states. [2019-02-28 10:12:54,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:12:54,772 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-02-28 10:12:54,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-02-28 10:12:54,773 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 75 [2019-02-28 10:12:54,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:12:54,774 INFO L225 Difference]: With dead ends: 80 [2019-02-28 10:12:54,774 INFO L226 Difference]: Without dead ends: 79 [2019-02-28 10:12:54,775 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3116 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=1724, Invalid=12082, Unknown=0, NotChecked=0, Total=13806 [2019-02-28 10:12:54,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-02-28 10:12:54,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2019-02-28 10:12:54,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-02-28 10:12:54,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-02-28 10:12:54,778 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 75 [2019-02-28 10:12:54,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:12:54,778 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-02-28 10:12:54,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-02-28 10:12:54,779 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-02-28 10:12:54,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-02-28 10:12:54,779 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:12:54,779 INFO L402 BasicCegarLoop]: trace histogram [38, 37, 1, 1] [2019-02-28 10:12:54,779 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:12:54,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:12:54,780 INFO L82 PathProgramCache]: Analyzing trace with hash 645045610, now seen corresponding path program 37 times [2019-02-28 10:12:54,780 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:12:54,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:54,781 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:12:54,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:54,781 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:12:54,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:12:55,062 WARN L181 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-28 10:12:56,564 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:56,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:56,564 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:12:56,564 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:12:56,565 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:12:56,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:56,565 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:12:56,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:12:56,573 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:12:56,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:12:56,595 WARN L254 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 81 conjunts are in the unsatisfiable core [2019-02-28 10:12:56,596 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:12:56,610 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:12:56,611 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:12:56,625 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:12:56,625 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:12:59,026 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:12:59,026 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:12:59,031 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:12:59,031 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:12:59,089 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:59,090 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:13:03,000 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:13:03,018 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:13:03,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 119 [2019-02-28 10:13:03,018 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:13:03,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-02-28 10:13:03,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-02-28 10:13:03,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1808, Invalid=12712, Unknown=0, NotChecked=0, Total=14520 [2019-02-28 10:13:03,019 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 81 states. [2019-02-28 10:13:05,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:13:05,682 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-02-28 10:13:05,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-02-28 10:13:05,683 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 77 [2019-02-28 10:13:05,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:13:05,684 INFO L225 Difference]: With dead ends: 82 [2019-02-28 10:13:05,684 INFO L226 Difference]: Without dead ends: 81 [2019-02-28 10:13:05,685 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3276 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=1808, Invalid=12712, Unknown=0, NotChecked=0, Total=14520 [2019-02-28 10:13:05,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-02-28 10:13:05,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2019-02-28 10:13:05,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-02-28 10:13:05,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-02-28 10:13:05,690 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 77 [2019-02-28 10:13:05,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:13:05,690 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-02-28 10:13:05,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-02-28 10:13:05,690 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-02-28 10:13:05,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-02-28 10:13:05,690 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:13:05,690 INFO L402 BasicCegarLoop]: trace histogram [39, 38, 1, 1] [2019-02-28 10:13:05,691 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:13:05,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:13:05,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1413541676, now seen corresponding path program 38 times [2019-02-28 10:13:05,691 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:13:05,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:13:05,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:13:05,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:13:05,692 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:13:05,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:13:05,899 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-28 10:13:07,451 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:13:07,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:13:07,452 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:13:07,452 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:13:07,452 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:13:07,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:13:07,452 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:13:07,460 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:13:07,460 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:13:07,516 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 39 check-sat command(s) [2019-02-28 10:13:07,517 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:13:07,518 WARN L254 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 83 conjunts are in the unsatisfiable core [2019-02-28 10:13:07,519 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:13:07,537 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:13:07,538 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:13:07,571 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:13:07,572 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:13:09,886 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:13:09,887 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:13:09,898 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:13:09,899 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:13:09,960 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:13:09,960 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:13:14,033 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:13:14,053 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:13:14,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 122 [2019-02-28 10:13:14,053 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:13:14,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-02-28 10:13:14,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-02-28 10:13:14,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1894, Invalid=13358, Unknown=0, NotChecked=0, Total=15252 [2019-02-28 10:13:14,054 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 83 states. [2019-02-28 10:13:17,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:13:17,472 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-02-28 10:13:17,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-02-28 10:13:17,472 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 79 [2019-02-28 10:13:17,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:13:17,473 INFO L225 Difference]: With dead ends: 84 [2019-02-28 10:13:17,473 INFO L226 Difference]: Without dead ends: 83 [2019-02-28 10:13:17,474 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3440 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=1894, Invalid=13358, Unknown=0, NotChecked=0, Total=15252 [2019-02-28 10:13:17,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-02-28 10:13:17,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2019-02-28 10:13:17,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-02-28 10:13:17,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-02-28 10:13:17,478 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 79 [2019-02-28 10:13:17,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:13:17,478 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-02-28 10:13:17,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-02-28 10:13:17,478 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-02-28 10:13:17,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-02-28 10:13:17,479 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:13:17,479 INFO L402 BasicCegarLoop]: trace histogram [40, 39, 1, 1] [2019-02-28 10:13:17,479 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:13:17,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:13:17,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1203886190, now seen corresponding path program 39 times [2019-02-28 10:13:17,479 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:13:17,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:13:17,480 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:13:17,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:13:17,480 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:13:17,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:13:17,724 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-28 10:13:19,546 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:13:19,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:13:19,546 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:13:19,547 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:13:19,547 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:13:19,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:13:19,547 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:13:19,556 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:13:19,556 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:13:19,581 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:13:19,581 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:13:19,583 WARN L254 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 85 conjunts are in the unsatisfiable core [2019-02-28 10:13:19,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:13:19,589 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:13:19,589 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:13:19,600 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:13:19,601 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:13:21,878 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:13:21,879 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:13:21,884 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:13:21,885 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:13:21,946 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:13:21,946 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:13:26,196 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:13:26,214 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:13:26,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 125 [2019-02-28 10:13:26,214 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:13:26,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-02-28 10:13:26,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-02-28 10:13:26,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1982, Invalid=14020, Unknown=0, NotChecked=0, Total=16002 [2019-02-28 10:13:26,215 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 85 states. [2019-02-28 10:13:29,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:13:29,163 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2019-02-28 10:13:29,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-02-28 10:13:29,163 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 81 [2019-02-28 10:13:29,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:13:29,164 INFO L225 Difference]: With dead ends: 86 [2019-02-28 10:13:29,164 INFO L226 Difference]: Without dead ends: 85 [2019-02-28 10:13:29,166 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3608 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=1982, Invalid=14020, Unknown=0, NotChecked=0, Total=16002 [2019-02-28 10:13:29,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-02-28 10:13:29,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2019-02-28 10:13:29,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-02-28 10:13:29,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2019-02-28 10:13:29,171 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 81 [2019-02-28 10:13:29,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:13:29,171 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2019-02-28 10:13:29,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-02-28 10:13:29,171 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2019-02-28 10:13:29,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-02-28 10:13:29,172 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:13:29,172 INFO L402 BasicCegarLoop]: trace histogram [41, 40, 1, 1] [2019-02-28 10:13:29,172 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:13:29,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:13:29,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1588427056, now seen corresponding path program 40 times [2019-02-28 10:13:29,172 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:13:29,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:13:29,173 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:13:29,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:13:29,173 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:13:29,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:13:29,408 WARN L181 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-28 10:13:31,085 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:13:31,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:13:31,086 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:13:31,086 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:13:31,086 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:13:31,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:13:31,086 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:13:31,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:13:31,095 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:13:31,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:13:31,118 WARN L254 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 87 conjunts are in the unsatisfiable core [2019-02-28 10:13:31,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:13:31,125 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:13:31,125 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:13:31,135 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:13:31,135 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:13:33,842 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:13:33,843 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:13:33,849 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:13:33,849 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:13:33,911 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:13:33,911 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:13:38,182 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:13:38,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:13:38,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 128 [2019-02-28 10:13:38,200 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:13:38,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-02-28 10:13:38,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-02-28 10:13:38,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2072, Invalid=14698, Unknown=0, NotChecked=0, Total=16770 [2019-02-28 10:13:38,202 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 87 states. [2019-02-28 10:13:42,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:13:42,252 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2019-02-28 10:13:42,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-02-28 10:13:42,252 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 83 [2019-02-28 10:13:42,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:13:42,253 INFO L225 Difference]: With dead ends: 88 [2019-02-28 10:13:42,253 INFO L226 Difference]: Without dead ends: 87 [2019-02-28 10:13:42,254 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3780 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=2072, Invalid=14698, Unknown=0, NotChecked=0, Total=16770 [2019-02-28 10:13:42,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-02-28 10:13:42,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2019-02-28 10:13:42,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-02-28 10:13:42,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2019-02-28 10:13:42,259 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 83 [2019-02-28 10:13:42,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:13:42,259 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2019-02-28 10:13:42,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-02-28 10:13:42,260 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2019-02-28 10:13:42,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-02-28 10:13:42,260 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:13:42,260 INFO L402 BasicCegarLoop]: trace histogram [42, 41, 1, 1] [2019-02-28 10:13:42,261 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:13:42,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:13:42,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1765011826, now seen corresponding path program 41 times [2019-02-28 10:13:42,261 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:13:42,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:13:42,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:13:42,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:13:42,262 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:13:42,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:13:42,457 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-28 10:13:44,327 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:13:44,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:13:44,328 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:13:44,328 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:13:44,328 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:13:44,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:13:44,328 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:13:44,337 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:13:44,337 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:13:44,396 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 42 check-sat command(s) [2019-02-28 10:13:44,396 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:13:44,398 WARN L254 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 89 conjunts are in the unsatisfiable core [2019-02-28 10:13:44,399 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:13:44,400 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:13:44,401 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:13:44,412 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:13:44,412 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:13:47,017 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:13:47,017 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:13:47,022 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:13:47,022 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:13:47,091 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:13:47,091 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:13:51,805 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:13:51,823 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:13:51,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 131 [2019-02-28 10:13:51,823 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:13:51,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-02-28 10:13:51,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-02-28 10:13:51,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2164, Invalid=15392, Unknown=0, NotChecked=0, Total=17556 [2019-02-28 10:13:51,825 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 89 states. [2019-02-28 10:13:56,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:13:56,428 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-02-28 10:13:56,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-02-28 10:13:56,428 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 85 [2019-02-28 10:13:56,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:13:56,429 INFO L225 Difference]: With dead ends: 90 [2019-02-28 10:13:56,429 INFO L226 Difference]: Without dead ends: 89 [2019-02-28 10:13:56,430 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3956 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=2164, Invalid=15392, Unknown=0, NotChecked=0, Total=17556 [2019-02-28 10:13:56,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-02-28 10:13:56,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2019-02-28 10:13:56,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-02-28 10:13:56,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2019-02-28 10:13:56,434 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 85 [2019-02-28 10:13:56,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:13:56,434 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2019-02-28 10:13:56,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-02-28 10:13:56,434 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2019-02-28 10:13:56,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-02-28 10:13:56,435 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:13:56,435 INFO L402 BasicCegarLoop]: trace histogram [43, 42, 1, 1] [2019-02-28 10:13:56,435 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:13:56,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:13:56,435 INFO L82 PathProgramCache]: Analyzing trace with hash -335716044, now seen corresponding path program 42 times [2019-02-28 10:13:56,435 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:13:56,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:13:56,436 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:13:56,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:13:56,436 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:13:56,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:13:56,642 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-28 10:13:58,379 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:13:58,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:13:58,379 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:13:58,379 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:13:58,379 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:13:58,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:13:58,379 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:13:58,388 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:13:58,388 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:13:58,411 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:13:58,411 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:13:58,413 WARN L254 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 91 conjunts are in the unsatisfiable core [2019-02-28 10:13:58,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:13:58,416 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:13:58,416 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:13:58,420 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:13:58,421 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:14:01,340 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:14:01,340 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:14:01,346 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:14:01,346 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:14:01,415 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:14:01,416 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:14:06,301 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:14:06,320 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:14:06,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 134 [2019-02-28 10:14:06,320 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:14:06,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-02-28 10:14:06,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-02-28 10:14:06,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2258, Invalid=16102, Unknown=0, NotChecked=0, Total=18360 [2019-02-28 10:14:06,322 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 91 states. [2019-02-28 10:14:10,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:14:10,959 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2019-02-28 10:14:10,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-02-28 10:14:10,960 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 87 [2019-02-28 10:14:10,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:14:10,961 INFO L225 Difference]: With dead ends: 92 [2019-02-28 10:14:10,961 INFO L226 Difference]: Without dead ends: 91 [2019-02-28 10:14:10,962 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4136 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=2258, Invalid=16102, Unknown=0, NotChecked=0, Total=18360 [2019-02-28 10:14:10,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-02-28 10:14:10,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2019-02-28 10:14:10,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-02-28 10:14:10,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2019-02-28 10:14:10,966 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 87 [2019-02-28 10:14:10,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:14:10,966 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2019-02-28 10:14:10,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-02-28 10:14:10,967 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2019-02-28 10:14:10,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-02-28 10:14:10,967 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:14:10,967 INFO L402 BasicCegarLoop]: trace histogram [44, 43, 1, 1] [2019-02-28 10:14:10,967 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:14:10,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:14:10,967 INFO L82 PathProgramCache]: Analyzing trace with hash -500569994, now seen corresponding path program 43 times [2019-02-28 10:14:10,968 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:14:10,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:14:10,968 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:14:10,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:14:10,968 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:14:10,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:14:11,220 WARN L181 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-28 10:14:13,095 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:14:13,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:14:13,095 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:14:13,095 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:14:13,096 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:14:13,096 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:14:13,096 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:14:13,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:14:13,104 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:14:13,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:14:13,131 WARN L254 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 93 conjunts are in the unsatisfiable core [2019-02-28 10:14:13,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:14:13,135 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:14:13,135 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:14:13,146 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:14:13,146 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:14:16,073 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:14:16,074 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:14:16,081 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:14:16,081 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:14:16,160 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:14:16,161 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:14:21,250 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:14:21,278 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:14:21,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 137 [2019-02-28 10:14:21,278 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:14:21,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-02-28 10:14:21,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-02-28 10:14:21,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2354, Invalid=16828, Unknown=0, NotChecked=0, Total=19182 [2019-02-28 10:14:21,280 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 93 states. [2019-02-28 10:14:25,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:14:25,173 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2019-02-28 10:14:25,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-02-28 10:14:25,174 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 89 [2019-02-28 10:14:25,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:14:25,175 INFO L225 Difference]: With dead ends: 94 [2019-02-28 10:14:25,175 INFO L226 Difference]: Without dead ends: 93 [2019-02-28 10:14:25,176 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4320 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=2354, Invalid=16828, Unknown=0, NotChecked=0, Total=19182 [2019-02-28 10:14:25,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-02-28 10:14:25,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2019-02-28 10:14:25,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-02-28 10:14:25,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2019-02-28 10:14:25,181 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 89 [2019-02-28 10:14:25,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:14:25,181 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2019-02-28 10:14:25,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-02-28 10:14:25,181 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2019-02-28 10:14:25,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-02-28 10:14:25,182 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:14:25,182 INFO L402 BasicCegarLoop]: trace histogram [45, 44, 1, 1] [2019-02-28 10:14:25,182 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:14:25,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:14:25,183 INFO L82 PathProgramCache]: Analyzing trace with hash -11425992, now seen corresponding path program 44 times [2019-02-28 10:14:25,183 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:14:25,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:14:25,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:14:25,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:14:25,184 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:14:25,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:14:25,388 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-28 10:14:25,885 WARN L181 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-28 10:14:27,656 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:14:27,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:14:27,657 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:14:27,657 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:14:27,657 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:14:27,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:14:27,657 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:14:27,666 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:14:27,666 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:14:27,729 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 45 check-sat command(s) [2019-02-28 10:14:27,729 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:14:27,731 WARN L254 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 95 conjunts are in the unsatisfiable core [2019-02-28 10:14:27,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:14:27,737 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:14:27,737 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:14:27,743 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:14:27,743 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:14:30,836 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:14:30,837 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:14:30,841 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:14:30,841 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:14:30,916 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:14:30,916 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:14:36,270 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:14:36,290 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:14:36,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 140 [2019-02-28 10:14:36,291 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:14:36,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-02-28 10:14:36,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-02-28 10:14:36,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2452, Invalid=17570, Unknown=0, NotChecked=0, Total=20022 [2019-02-28 10:14:36,292 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 95 states. [2019-02-28 10:14:40,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:14:40,511 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2019-02-28 10:14:40,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-02-28 10:14:40,511 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 91 [2019-02-28 10:14:40,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:14:40,512 INFO L225 Difference]: With dead ends: 96 [2019-02-28 10:14:40,513 INFO L226 Difference]: Without dead ends: 95 [2019-02-28 10:14:40,513 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4508 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=2452, Invalid=17570, Unknown=0, NotChecked=0, Total=20022 [2019-02-28 10:14:40,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-02-28 10:14:40,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2019-02-28 10:14:40,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-02-28 10:14:40,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2019-02-28 10:14:40,517 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 91 [2019-02-28 10:14:40,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:14:40,518 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2019-02-28 10:14:40,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-02-28 10:14:40,518 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2019-02-28 10:14:40,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-02-28 10:14:40,518 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:14:40,518 INFO L402 BasicCegarLoop]: trace histogram [46, 45, 1, 1] [2019-02-28 10:14:40,519 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:14:40,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:14:40,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1904524666, now seen corresponding path program 45 times [2019-02-28 10:14:40,519 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:14:40,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:14:40,519 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:14:40,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:14:40,520 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:14:40,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:14:40,813 WARN L181 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-28 10:14:41,081 WARN L181 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-28 10:14:41,310 WARN L181 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-28 10:14:43,293 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:14:43,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:14:43,293 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:14:43,293 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:14:43,293 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:14:43,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:14:43,294 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:14:43,303 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:14:43,303 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:14:43,349 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:14:43,349 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:14:43,351 WARN L254 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 97 conjunts are in the unsatisfiable core [2019-02-28 10:14:43,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:14:43,354 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:14:43,355 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:14:43,365 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:14:43,365 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:14:46,557 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:14:46,558 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:14:46,563 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:14:46,563 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:14:46,636 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:14:46,637 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:14:52,025 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:14:52,043 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:14:52,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 143 [2019-02-28 10:14:52,043 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:14:52,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-02-28 10:14:52,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-02-28 10:14:52,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2552, Invalid=18328, Unknown=0, NotChecked=0, Total=20880 [2019-02-28 10:14:52,044 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 97 states. [2019-02-28 10:14:56,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:14:56,602 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2019-02-28 10:14:56,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-02-28 10:14:56,603 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 93 [2019-02-28 10:14:56,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:14:56,604 INFO L225 Difference]: With dead ends: 98 [2019-02-28 10:14:56,604 INFO L226 Difference]: Without dead ends: 97 [2019-02-28 10:14:56,605 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4700 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=2552, Invalid=18328, Unknown=0, NotChecked=0, Total=20880 [2019-02-28 10:14:56,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-02-28 10:14:56,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2019-02-28 10:14:56,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-02-28 10:14:56,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2019-02-28 10:14:56,609 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 93 [2019-02-28 10:14:56,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:14:56,609 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2019-02-28 10:14:56,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-02-28 10:14:56,609 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2019-02-28 10:14:56,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-02-28 10:14:56,610 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:14:56,610 INFO L402 BasicCegarLoop]: trace histogram [47, 46, 1, 1] [2019-02-28 10:14:56,610 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:14:56,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:14:56,610 INFO L82 PathProgramCache]: Analyzing trace with hash 592137020, now seen corresponding path program 46 times [2019-02-28 10:14:56,610 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:14:56,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:14:56,611 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:14:56,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:14:56,611 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:14:56,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:14:56,870 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-28 10:14:57,053 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-02-28 10:14:59,043 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:14:59,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:14:59,044 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:14:59,044 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:14:59,044 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:14:59,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:14:59,044 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:14:59,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:14:59,053 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:14:59,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:14:59,085 WARN L254 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 99 conjunts are in the unsatisfiable core [2019-02-28 10:14:59,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:14:59,087 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:14:59,088 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:14:59,096 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:14:59,096 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:15:02,506 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:15:02,507 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:15:02,513 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:15:02,513 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:15:02,590 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:15:02,590 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:15:08,234 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:15:08,252 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:15:08,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 146 [2019-02-28 10:15:08,252 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:15:08,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-02-28 10:15:08,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-02-28 10:15:08,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2654, Invalid=19102, Unknown=0, NotChecked=0, Total=21756 [2019-02-28 10:15:08,254 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 99 states. [2019-02-28 10:15:12,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:15:12,508 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2019-02-28 10:15:12,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-02-28 10:15:12,509 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 95 [2019-02-28 10:15:12,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:15:12,510 INFO L225 Difference]: With dead ends: 100 [2019-02-28 10:15:12,510 INFO L226 Difference]: Without dead ends: 99 [2019-02-28 10:15:12,511 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4896 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=2654, Invalid=19102, Unknown=0, NotChecked=0, Total=21756 [2019-02-28 10:15:12,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-02-28 10:15:12,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2019-02-28 10:15:12,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-02-28 10:15:12,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2019-02-28 10:15:12,515 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 95 [2019-02-28 10:15:12,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:15:12,516 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2019-02-28 10:15:12,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-02-28 10:15:12,516 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2019-02-28 10:15:12,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-02-28 10:15:12,516 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:15:12,516 INFO L402 BasicCegarLoop]: trace histogram [48, 47, 1, 1] [2019-02-28 10:15:12,516 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:15:12,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:15:12,517 INFO L82 PathProgramCache]: Analyzing trace with hash 2107994238, now seen corresponding path program 47 times [2019-02-28 10:15:12,517 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:15:12,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:15:12,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:15:12,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:15:12,518 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:15:12,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:15:14,737 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:15:14,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:15:14,737 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:15:14,737 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:15:14,737 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:15:14,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:15:14,737 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:15:14,745 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:15:14,745 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:15:14,820 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 48 check-sat command(s) [2019-02-28 10:15:14,820 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:15:14,822 WARN L254 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 101 conjunts are in the unsatisfiable core [2019-02-28 10:15:14,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:15:14,845 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:15:14,846 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:15:14,917 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:15:14,917 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:15:19,136 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:15:19,137 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:15:19,142 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:15:19,143 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:15:19,226 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:15:19,227 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:15:25,162 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:15:25,180 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:15:25,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 149 [2019-02-28 10:15:25,181 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:15:25,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-02-28 10:15:25,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-02-28 10:15:25,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2758, Invalid=19892, Unknown=0, NotChecked=0, Total=22650 [2019-02-28 10:15:25,182 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 101 states. [2019-02-28 10:15:29,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:15:29,386 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2019-02-28 10:15:29,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-02-28 10:15:29,386 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 97 [2019-02-28 10:15:29,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:15:29,387 INFO L225 Difference]: With dead ends: 102 [2019-02-28 10:15:29,387 INFO L226 Difference]: Without dead ends: 101 [2019-02-28 10:15:29,388 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5096 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=2758, Invalid=19892, Unknown=0, NotChecked=0, Total=22650 [2019-02-28 10:15:29,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-02-28 10:15:29,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2019-02-28 10:15:29,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-02-28 10:15:29,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2019-02-28 10:15:29,392 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 97 [2019-02-28 10:15:29,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:15:29,393 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2019-02-28 10:15:29,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-02-28 10:15:29,393 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2019-02-28 10:15:29,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-02-28 10:15:29,393 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:15:29,393 INFO L402 BasicCegarLoop]: trace histogram [49, 48, 1, 1] [2019-02-28 10:15:29,394 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:15:29,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:15:29,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1442099904, now seen corresponding path program 48 times [2019-02-28 10:15:29,394 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:15:29,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:15:29,395 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:15:29,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:15:29,395 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:15:29,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:15:31,947 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:15:31,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:15:31,948 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:15:31,948 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:15:31,948 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:15:31,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:15:31,948 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:15:31,957 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:15:31,957 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:15:31,984 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:15:31,984 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:15:31,986 WARN L254 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 103 conjunts are in the unsatisfiable core [2019-02-28 10:15:31,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:15:31,993 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:15:31,993 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:15:31,999 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:15:31,999 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:15:35,433 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:15:35,433 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:15:35,439 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:15:35,439 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:15:35,521 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:15:35,521 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:15:41,868 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:15:41,887 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:15:41,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 152 [2019-02-28 10:15:41,887 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:15:41,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-02-28 10:15:41,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-02-28 10:15:41,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2864, Invalid=20698, Unknown=0, NotChecked=0, Total=23562 [2019-02-28 10:15:41,888 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 103 states. [2019-02-28 10:15:46,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:15:46,175 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2019-02-28 10:15:46,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-02-28 10:15:46,175 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 99 [2019-02-28 10:15:46,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:15:46,176 INFO L225 Difference]: With dead ends: 104 [2019-02-28 10:15:46,176 INFO L226 Difference]: Without dead ends: 103 [2019-02-28 10:15:46,178 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5300 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=2864, Invalid=20698, Unknown=0, NotChecked=0, Total=23562 [2019-02-28 10:15:46,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-02-28 10:15:46,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2019-02-28 10:15:46,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-02-28 10:15:46,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2019-02-28 10:15:46,183 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 99 [2019-02-28 10:15:46,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:15:46,184 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2019-02-28 10:15:46,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-02-28 10:15:46,184 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2019-02-28 10:15:46,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-02-28 10:15:46,185 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:15:46,185 INFO L402 BasicCegarLoop]: trace histogram [50, 49, 1, 1] [2019-02-28 10:15:46,185 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:15:46,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:15:46,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1416429954, now seen corresponding path program 49 times [2019-02-28 10:15:46,185 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:15:46,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:15:46,186 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:15:46,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:15:46,186 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:15:46,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:15:48,796 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:15:48,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:15:48,796 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:15:48,796 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:15:48,796 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:15:48,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:15:48,796 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:15:48,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:15:48,805 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:15:48,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:15:48,835 WARN L254 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 105 conjunts are in the unsatisfiable core [2019-02-28 10:15:48,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:15:48,851 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:15:48,852 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:15:48,864 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:15:48,864 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:15:52,632 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:15:52,632 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:15:52,638 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:15:52,638 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:15:52,746 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:15:52,746 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:15:59,307 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:15:59,326 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:15:59,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 155 [2019-02-28 10:15:59,326 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:15:59,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-02-28 10:15:59,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-02-28 10:15:59,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2972, Invalid=21520, Unknown=0, NotChecked=0, Total=24492 [2019-02-28 10:15:59,328 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 105 states. [2019-02-28 10:16:04,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:16:04,126 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2019-02-28 10:16:04,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-02-28 10:16:04,126 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 101 [2019-02-28 10:16:04,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:16:04,128 INFO L225 Difference]: With dead ends: 106 [2019-02-28 10:16:04,128 INFO L226 Difference]: Without dead ends: 105 [2019-02-28 10:16:04,129 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5508 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=2972, Invalid=21520, Unknown=0, NotChecked=0, Total=24492 [2019-02-28 10:16:04,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-02-28 10:16:04,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2019-02-28 10:16:04,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-02-28 10:16:04,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2019-02-28 10:16:04,135 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 101 [2019-02-28 10:16:04,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:16:04,135 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2019-02-28 10:16:04,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-02-28 10:16:04,136 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2019-02-28 10:16:04,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-02-28 10:16:04,136 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:16:04,136 INFO L402 BasicCegarLoop]: trace histogram [51, 50, 1, 1] [2019-02-28 10:16:04,137 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:16:04,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:16:04,137 INFO L82 PathProgramCache]: Analyzing trace with hash -315445948, now seen corresponding path program 50 times [2019-02-28 10:16:04,137 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:16:04,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:16:04,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:16:04,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:16:04,138 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:16:04,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:16:04,443 WARN L181 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-28 10:16:04,691 WARN L181 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-28 10:16:04,962 WARN L181 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-28 10:16:05,265 WARN L181 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-28 10:16:08,028 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:16:08,028 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:16:08,028 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:16:08,028 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:16:08,029 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:16:08,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:16:08,029 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:16:08,040 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:16:08,040 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:16:08,140 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2019-02-28 10:16:08,140 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:16:08,142 WARN L254 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 107 conjunts are in the unsatisfiable core [2019-02-28 10:16:08,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:16:08,155 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:16:08,155 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:16:08,161 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:16:08,161 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:16:11,800 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:16:11,800 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:16:11,806 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:16:11,806 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:16:11,890 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:16:11,890 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:16:18,653 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:16:18,672 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:16:18,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 158 [2019-02-28 10:16:18,672 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:16:18,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-02-28 10:16:18,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-02-28 10:16:18,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3082, Invalid=22358, Unknown=0, NotChecked=0, Total=25440 [2019-02-28 10:16:18,674 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 107 states. [2019-02-28 10:16:24,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:16:24,316 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2019-02-28 10:16:24,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-02-28 10:16:24,317 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 103 [2019-02-28 10:16:24,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:16:24,318 INFO L225 Difference]: With dead ends: 108 [2019-02-28 10:16:24,319 INFO L226 Difference]: Without dead ends: 107 [2019-02-28 10:16:24,320 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5720 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=3082, Invalid=22358, Unknown=0, NotChecked=0, Total=25440 [2019-02-28 10:16:24,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-02-28 10:16:24,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2019-02-28 10:16:24,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-02-28 10:16:24,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2019-02-28 10:16:24,325 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 103 [2019-02-28 10:16:24,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:16:24,325 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2019-02-28 10:16:24,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-02-28 10:16:24,325 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2019-02-28 10:16:24,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-02-28 10:16:24,326 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:16:24,326 INFO L402 BasicCegarLoop]: trace histogram [52, 51, 1, 1] [2019-02-28 10:16:24,326 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:16:24,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:16:24,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1799123078, now seen corresponding path program 51 times [2019-02-28 10:16:24,327 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:16:24,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:16:24,328 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:16:24,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:16:24,328 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:16:24,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:16:26,967 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:16:26,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:16:26,967 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:16:26,967 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:16:26,967 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:16:26,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:16:26,967 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:16:26,977 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:16:26,977 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:16:27,008 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:16:27,008 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:16:27,010 WARN L254 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 109 conjunts are in the unsatisfiable core [2019-02-28 10:16:27,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:16:27,013 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:16:27,013 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:16:27,019 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:16:27,019 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:16:31,075 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:16:31,076 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:16:31,080 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:16:31,081 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:16:31,167 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:16:31,168 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:16:38,248 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:16:38,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:16:38,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 161 [2019-02-28 10:16:38,267 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:16:38,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 109 states [2019-02-28 10:16:38,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2019-02-28 10:16:38,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3194, Invalid=23212, Unknown=0, NotChecked=0, Total=26406 [2019-02-28 10:16:38,269 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 109 states. [2019-02-28 10:16:45,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:16:45,244 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2019-02-28 10:16:45,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-02-28 10:16:45,245 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 105 [2019-02-28 10:16:45,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:16:45,246 INFO L225 Difference]: With dead ends: 110 [2019-02-28 10:16:45,246 INFO L226 Difference]: Without dead ends: 109 [2019-02-28 10:16:45,248 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5936 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=3194, Invalid=23212, Unknown=0, NotChecked=0, Total=26406 [2019-02-28 10:16:45,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-02-28 10:16:45,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2019-02-28 10:16:45,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-02-28 10:16:45,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2019-02-28 10:16:45,252 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 105 [2019-02-28 10:16:45,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:16:45,252 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2019-02-28 10:16:45,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 109 states. [2019-02-28 10:16:45,252 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2019-02-28 10:16:45,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-02-28 10:16:45,253 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:16:45,253 INFO L402 BasicCegarLoop]: trace histogram [53, 52, 1, 1] [2019-02-28 10:16:45,253 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:16:45,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:16:45,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1914541240, now seen corresponding path program 52 times [2019-02-28 10:16:45,253 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:16:45,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:16:45,254 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:16:45,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:16:45,254 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:16:45,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:16:45,457 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-28 10:16:48,216 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:16:48,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:16:48,216 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:16:48,216 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:16:48,216 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:16:48,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:16:48,217 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:16:48,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:16:48,228 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:16:48,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:16:48,268 WARN L254 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 111 conjunts are in the unsatisfiable core [2019-02-28 10:16:48,270 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:16:48,291 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:16:48,291 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:16:48,358 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:16:48,358 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:16:52,664 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:16:52,665 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:16:52,671 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:16:52,672 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:16:52,761 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:16:52,761 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:17:00,065 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:17:00,085 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:17:00,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 164 [2019-02-28 10:17:00,085 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:17:00,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-02-28 10:17:00,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-02-28 10:17:00,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3308, Invalid=24082, Unknown=0, NotChecked=0, Total=27390 [2019-02-28 10:17:00,086 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 111 states. [2019-02-28 10:17:04,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:17:04,924 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2019-02-28 10:17:04,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-02-28 10:17:04,924 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 107 [2019-02-28 10:17:04,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:17:04,925 INFO L225 Difference]: With dead ends: 112 [2019-02-28 10:17:04,925 INFO L226 Difference]: Without dead ends: 111 [2019-02-28 10:17:04,926 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6156 ImplicationChecksByTransitivity, 14.3s TimeCoverageRelationStatistics Valid=3308, Invalid=24082, Unknown=0, NotChecked=0, Total=27390 [2019-02-28 10:17:04,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-02-28 10:17:04,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2019-02-28 10:17:04,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-02-28 10:17:04,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2019-02-28 10:17:04,931 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 107 [2019-02-28 10:17:04,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:17:04,931 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2019-02-28 10:17:04,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-02-28 10:17:04,931 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2019-02-28 10:17:04,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-02-28 10:17:04,932 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:17:04,932 INFO L402 BasicCegarLoop]: trace histogram [54, 53, 1, 1] [2019-02-28 10:17:04,932 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:17:04,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:17:04,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1628127862, now seen corresponding path program 53 times [2019-02-28 10:17:04,932 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:17:04,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:17:04,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:17:04,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:17:04,933 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:17:04,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:17:05,214 WARN L181 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-28 10:17:05,485 WARN L181 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-28 10:17:05,777 WARN L181 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-28 10:17:06,090 WARN L181 SmtUtils]: Spent 219.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-28 10:17:06,403 WARN L181 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-28 10:17:09,169 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:17:09,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:17:09,169 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:17:09,169 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:17:09,169 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:17:09,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:17:09,169 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:17:09,180 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:17:09,181 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:17:09,271 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 54 check-sat command(s) [2019-02-28 10:17:09,271 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:17:09,274 WARN L254 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 113 conjunts are in the unsatisfiable core [2019-02-28 10:17:09,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:17:09,277 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:17:09,277 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:17:09,283 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:17:09,283 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:17:13,317 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:17:13,318 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:17:13,323 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:17:13,324 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:17:13,502 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:17:13,502 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:17:21,102 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:17:21,120 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:17:21,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 167 [2019-02-28 10:17:21,121 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:17:21,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-02-28 10:17:21,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-02-28 10:17:21,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3424, Invalid=24968, Unknown=0, NotChecked=0, Total=28392 [2019-02-28 10:17:21,122 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 113 states. [2019-02-28 10:17:27,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:17:27,559 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2019-02-28 10:17:27,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-02-28 10:17:27,559 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 109 [2019-02-28 10:17:27,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:17:27,560 INFO L225 Difference]: With dead ends: 114 [2019-02-28 10:17:27,561 INFO L226 Difference]: Without dead ends: 113 [2019-02-28 10:17:27,562 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 104 SyntacticMatches, 1 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6380 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=3424, Invalid=24968, Unknown=0, NotChecked=0, Total=28392 [2019-02-28 10:17:27,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-02-28 10:17:27,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2019-02-28 10:17:27,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-02-28 10:17:27,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2019-02-28 10:17:27,566 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 109 [2019-02-28 10:17:27,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:17:27,567 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2019-02-28 10:17:27,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-02-28 10:17:27,567 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2019-02-28 10:17:27,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-02-28 10:17:27,568 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:17:27,568 INFO L402 BasicCegarLoop]: trace histogram [55, 54, 1, 1] [2019-02-28 10:17:27,568 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:17:27,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:17:27,568 INFO L82 PathProgramCache]: Analyzing trace with hash -1262778548, now seen corresponding path program 54 times [2019-02-28 10:17:27,568 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:17:27,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:17:27,569 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:17:27,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:17:27,569 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:17:27,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:17:30,544 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:17:30,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:17:30,544 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:17:30,544 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:17:30,545 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:17:30,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:17:30,545 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:17:30,553 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:17:30,553 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:17:30,586 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:17:30,586 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:17:30,588 WARN L254 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 115 conjunts are in the unsatisfiable core [2019-02-28 10:17:30,590 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:17:30,592 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:17:30,592 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:17:30,602 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:17:30,602 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:17:34,993 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:17:34,994 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:17:34,999 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:17:35,000 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:17:35,091 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:17:35,091 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:17:42,613 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:17:42,632 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:17:42,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 170 [2019-02-28 10:17:42,632 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:17:42,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 115 states [2019-02-28 10:17:42,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2019-02-28 10:17:42,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3542, Invalid=25870, Unknown=0, NotChecked=0, Total=29412 [2019-02-28 10:17:42,634 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 115 states. [2019-02-28 10:17:48,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:17:48,063 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2019-02-28 10:17:48,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-02-28 10:17:48,064 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 111 [2019-02-28 10:17:48,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:17:48,065 INFO L225 Difference]: With dead ends: 116 [2019-02-28 10:17:48,065 INFO L226 Difference]: Without dead ends: 115 [2019-02-28 10:17:48,066 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 106 SyntacticMatches, 1 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6608 ImplicationChecksByTransitivity, 14.7s TimeCoverageRelationStatistics Valid=3542, Invalid=25870, Unknown=0, NotChecked=0, Total=29412 [2019-02-28 10:17:48,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-02-28 10:17:48,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2019-02-28 10:17:48,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-02-28 10:17:48,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2019-02-28 10:17:48,071 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 111 [2019-02-28 10:17:48,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:17:48,072 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2019-02-28 10:17:48,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 115 states. [2019-02-28 10:17:48,072 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2019-02-28 10:17:48,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-02-28 10:17:48,073 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:17:48,073 INFO L402 BasicCegarLoop]: trace histogram [56, 55, 1, 1] [2019-02-28 10:17:48,073 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:17:48,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:17:48,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1945561230, now seen corresponding path program 55 times [2019-02-28 10:17:48,073 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:17:48,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:17:48,074 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:17:48,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:17:48,074 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:17:48,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:17:51,132 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:17:51,132 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:17:51,132 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:17:51,132 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:17:51,132 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:17:51,132 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:17:51,132 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:17:51,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:17:51,142 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:17:51,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:17:51,175 WARN L254 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 117 conjunts are in the unsatisfiable core [2019-02-28 10:17:51,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:17:51,178 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:17:51,178 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:17:51,187 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:17:51,187 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:17:55,705 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:17:55,705 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:17:55,711 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:17:55,711 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:17:55,803 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:17:55,803 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:18:03,706 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:18:03,725 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:18:03,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 173 [2019-02-28 10:18:03,726 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:18:03,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 117 states [2019-02-28 10:18:03,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2019-02-28 10:18:03,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3662, Invalid=26788, Unknown=0, NotChecked=0, Total=30450 [2019-02-28 10:18:03,727 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand 117 states. [2019-02-28 10:18:11,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:18:11,209 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2019-02-28 10:18:11,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-02-28 10:18:11,210 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 113 [2019-02-28 10:18:11,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:18:11,211 INFO L225 Difference]: With dead ends: 118 [2019-02-28 10:18:11,211 INFO L226 Difference]: Without dead ends: 117 [2019-02-28 10:18:11,212 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 108 SyntacticMatches, 1 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6840 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=3662, Invalid=26788, Unknown=0, NotChecked=0, Total=30450 [2019-02-28 10:18:11,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-02-28 10:18:11,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 116. [2019-02-28 10:18:11,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-02-28 10:18:11,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2019-02-28 10:18:11,217 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 113 [2019-02-28 10:18:11,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:18:11,217 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2019-02-28 10:18:11,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 117 states. [2019-02-28 10:18:11,217 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2019-02-28 10:18:11,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-02-28 10:18:11,218 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:18:11,218 INFO L402 BasicCegarLoop]: trace histogram [57, 56, 1, 1] [2019-02-28 10:18:11,218 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:18:11,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:18:11,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1373569360, now seen corresponding path program 56 times [2019-02-28 10:18:11,219 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:18:11,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:18:11,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:18:11,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:18:11,220 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:18:11,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:18:11,477 WARN L181 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-28 10:18:14,351 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:18:14,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:18:14,351 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:18:14,351 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:18:14,351 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:18:14,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:18:14,352 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:18:14,360 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:18:14,360 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:18:14,455 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 57 check-sat command(s) [2019-02-28 10:18:14,455 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:18:14,457 WARN L254 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 119 conjunts are in the unsatisfiable core [2019-02-28 10:18:14,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:18:14,474 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:18:14,474 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:18:14,499 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:18:14,500 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:18:19,230 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:18:19,230 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:18:19,235 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:18:19,235 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:18:19,333 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:18:19,334 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:18:27,822 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:18:27,841 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:18:27,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 176 [2019-02-28 10:18:27,841 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:18:27,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 119 states [2019-02-28 10:18:27,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2019-02-28 10:18:27,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3784, Invalid=27722, Unknown=0, NotChecked=0, Total=31506 [2019-02-28 10:18:27,843 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 119 states. [2019-02-28 10:18:33,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:18:33,990 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2019-02-28 10:18:33,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-02-28 10:18:33,991 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 115 [2019-02-28 10:18:33,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:18:33,992 INFO L225 Difference]: With dead ends: 120 [2019-02-28 10:18:33,992 INFO L226 Difference]: Without dead ends: 119 [2019-02-28 10:18:33,993 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 110 SyntacticMatches, 1 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7076 ImplicationChecksByTransitivity, 16.1s TimeCoverageRelationStatistics Valid=3784, Invalid=27722, Unknown=0, NotChecked=0, Total=31506 [2019-02-28 10:18:33,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-02-28 10:18:33,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2019-02-28 10:18:33,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-02-28 10:18:33,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 118 transitions. [2019-02-28 10:18:33,996 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 118 transitions. Word has length 115 [2019-02-28 10:18:33,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:18:33,996 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 118 transitions. [2019-02-28 10:18:33,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 119 states. [2019-02-28 10:18:33,997 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2019-02-28 10:18:33,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-02-28 10:18:33,997 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:18:33,997 INFO L402 BasicCegarLoop]: trace histogram [58, 57, 1, 1] [2019-02-28 10:18:33,997 INFO L423 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:18:33,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:18:33,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1445196178, now seen corresponding path program 57 times [2019-02-28 10:18:33,998 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:18:33,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:18:33,998 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:18:33,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:18:33,998 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:18:34,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:18:34,290 WARN L181 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-28 10:18:34,556 WARN L181 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-28 10:18:37,764 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:18:37,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:18:37,765 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:18:37,765 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:18:37,765 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:18:37,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:18:37,765 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:18:37,773 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:18:37,773 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:18:37,805 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:18:37,806 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:18:37,808 WARN L254 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 121 conjunts are in the unsatisfiable core [2019-02-28 10:18:37,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:18:37,825 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:18:37,826 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:18:37,890 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:18:37,891 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:18:42,812 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:18:42,812 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:18:42,818 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:18:42,819 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:18:42,918 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:18:42,918 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:18:51,480 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:18:51,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:18:51,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 179 [2019-02-28 10:18:51,498 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:18:51,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 121 states [2019-02-28 10:18:51,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2019-02-28 10:18:51,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3908, Invalid=28672, Unknown=0, NotChecked=0, Total=32580 [2019-02-28 10:18:51,500 INFO L87 Difference]: Start difference. First operand 118 states and 118 transitions. Second operand 121 states. [2019-02-28 10:18:56,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:18:56,951 INFO L93 Difference]: Finished difference Result 122 states and 122 transitions. [2019-02-28 10:18:56,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-02-28 10:18:56,951 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 117 [2019-02-28 10:18:56,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:18:56,952 INFO L225 Difference]: With dead ends: 122 [2019-02-28 10:18:56,952 INFO L226 Difference]: Without dead ends: 121 [2019-02-28 10:18:56,953 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 112 SyntacticMatches, 1 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7316 ImplicationChecksByTransitivity, 17.0s TimeCoverageRelationStatistics Valid=3908, Invalid=28672, Unknown=0, NotChecked=0, Total=32580 [2019-02-28 10:18:56,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-02-28 10:18:56,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2019-02-28 10:18:56,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-02-28 10:18:56,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 120 transitions. [2019-02-28 10:18:56,958 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 120 transitions. Word has length 117 [2019-02-28 10:18:56,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:18:56,959 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 120 transitions. [2019-02-28 10:18:56,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 121 states. [2019-02-28 10:18:56,959 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 120 transitions. [2019-02-28 10:18:56,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-02-28 10:18:56,959 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:18:56,959 INFO L402 BasicCegarLoop]: trace histogram [59, 58, 1, 1] [2019-02-28 10:18:56,959 INFO L423 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:18:56,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:18:56,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1559091540, now seen corresponding path program 58 times [2019-02-28 10:18:56,960 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:18:56,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:18:56,960 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:18:56,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:18:56,960 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:18:56,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:19:00,056 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:19:00,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:19:00,056 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:19:00,056 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:19:00,056 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:19:00,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:19:00,056 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:19:00,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:19:00,067 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:19:00,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:19:00,103 WARN L254 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 123 conjunts are in the unsatisfiable core [2019-02-28 10:19:00,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:19:00,111 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:19:00,111 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:19:00,123 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:19:00,123 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:19:05,040 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:19:05,041 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:19:05,047 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:19:05,047 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:19:05,154 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:19:05,154 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:19:13,939 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:19:13,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:19:13,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 182 [2019-02-28 10:19:13,958 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:19:13,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 123 states [2019-02-28 10:19:13,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2019-02-28 10:19:13,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4034, Invalid=29638, Unknown=0, NotChecked=0, Total=33672 [2019-02-28 10:19:13,960 INFO L87 Difference]: Start difference. First operand 120 states and 120 transitions. Second operand 123 states. [2019-02-28 10:19:21,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:19:21,304 INFO L93 Difference]: Finished difference Result 124 states and 124 transitions. [2019-02-28 10:19:21,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-02-28 10:19:21,305 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 119 [2019-02-28 10:19:21,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:19:21,306 INFO L225 Difference]: With dead ends: 124 [2019-02-28 10:19:21,307 INFO L226 Difference]: Without dead ends: 123 [2019-02-28 10:19:21,308 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 114 SyntacticMatches, 1 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7560 ImplicationChecksByTransitivity, 16.6s TimeCoverageRelationStatistics Valid=4034, Invalid=29638, Unknown=0, NotChecked=0, Total=33672 [2019-02-28 10:19:21,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-02-28 10:19:21,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2019-02-28 10:19:21,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-02-28 10:19:21,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 122 transitions. [2019-02-28 10:19:21,313 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 122 transitions. Word has length 119 [2019-02-28 10:19:21,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:19:21,313 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 122 transitions. [2019-02-28 10:19:21,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has 123 states. [2019-02-28 10:19:21,313 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 122 transitions. [2019-02-28 10:19:21,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-02-28 10:19:21,314 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:19:21,314 INFO L402 BasicCegarLoop]: trace histogram [60, 59, 1, 1] [2019-02-28 10:19:21,314 INFO L423 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:19:21,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:19:21,315 INFO L82 PathProgramCache]: Analyzing trace with hash -656615274, now seen corresponding path program 59 times [2019-02-28 10:19:21,315 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:19:21,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:19:21,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:19:21,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:19:21,316 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:19:21,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:19:24,637 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:19:24,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:19:24,638 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:19:24,638 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:19:24,638 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:19:24,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:19:24,638 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:19:24,646 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:19:24,647 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:19:24,751 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 60 check-sat command(s) [2019-02-28 10:19:24,751 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:19:24,754 WARN L254 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 125 conjunts are in the unsatisfiable core [2019-02-28 10:19:24,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:19:24,756 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:19:24,757 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:19:24,764 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:19:24,764 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:19:29,998 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:19:29,999 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:19:30,005 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:19:30,005 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:19:30,109 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:19:30,109 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:19:39,369 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:19:39,388 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:19:39,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 185 [2019-02-28 10:19:39,389 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:19:39,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 125 states [2019-02-28 10:19:39,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2019-02-28 10:19:39,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4162, Invalid=30620, Unknown=0, NotChecked=0, Total=34782 [2019-02-28 10:19:39,390 INFO L87 Difference]: Start difference. First operand 122 states and 122 transitions. Second operand 125 states. [2019-02-28 10:19:48,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:19:48,427 INFO L93 Difference]: Finished difference Result 126 states and 126 transitions. [2019-02-28 10:19:48,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-02-28 10:19:48,427 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 121 [2019-02-28 10:19:48,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:19:48,428 INFO L225 Difference]: With dead ends: 126 [2019-02-28 10:19:48,428 INFO L226 Difference]: Without dead ends: 125 [2019-02-28 10:19:48,430 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 116 SyntacticMatches, 1 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7808 ImplicationChecksByTransitivity, 17.6s TimeCoverageRelationStatistics Valid=4162, Invalid=30620, Unknown=0, NotChecked=0, Total=34782 [2019-02-28 10:19:48,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-02-28 10:19:48,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2019-02-28 10:19:48,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-02-28 10:19:48,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 124 transitions. [2019-02-28 10:19:48,435 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 124 transitions. Word has length 121 [2019-02-28 10:19:48,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:19:48,435 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 124 transitions. [2019-02-28 10:19:48,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 125 states. [2019-02-28 10:19:48,436 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 124 transitions. [2019-02-28 10:19:48,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-02-28 10:19:48,436 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:19:48,436 INFO L402 BasicCegarLoop]: trace histogram [61, 60, 1, 1] [2019-02-28 10:19:48,437 INFO L423 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:19:48,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:19:48,437 INFO L82 PathProgramCache]: Analyzing trace with hash 352915288, now seen corresponding path program 60 times [2019-02-28 10:19:48,437 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:19:48,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:19:48,438 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:19:48,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:19:48,438 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:19:48,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:19:48,720 WARN L181 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-28 10:19:51,937 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:19:51,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:19:51,938 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:19:51,938 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:19:51,938 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:19:51,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:19:51,938 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:19:51,947 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:19:51,947 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:19:51,988 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:19:51,989 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:19:51,991 WARN L254 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 127 conjunts are in the unsatisfiable core [2019-02-28 10:19:51,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:19:51,994 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:19:51,994 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:19:52,002 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:19:52,002 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:19:57,442 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:19:57,443 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:19:57,450 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:19:57,450 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:19:57,671 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:19:57,671 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:20:07,008 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:20:07,026 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:20:07,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 188 [2019-02-28 10:20:07,026 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:20:07,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 127 states [2019-02-28 10:20:07,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2019-02-28 10:20:07,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4292, Invalid=31618, Unknown=0, NotChecked=0, Total=35910 [2019-02-28 10:20:07,028 INFO L87 Difference]: Start difference. First operand 124 states and 124 transitions. Second operand 127 states. [2019-02-28 10:20:16,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:20:16,225 INFO L93 Difference]: Finished difference Result 128 states and 128 transitions. [2019-02-28 10:20:16,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-02-28 10:20:16,226 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 123 [2019-02-28 10:20:16,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:20:16,227 INFO L225 Difference]: With dead ends: 128 [2019-02-28 10:20:16,227 INFO L226 Difference]: Without dead ends: 127 [2019-02-28 10:20:16,228 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 118 SyntacticMatches, 1 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8060 ImplicationChecksByTransitivity, 18.2s TimeCoverageRelationStatistics Valid=4292, Invalid=31618, Unknown=0, NotChecked=0, Total=35910 [2019-02-28 10:20:16,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-02-28 10:20:16,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 126. [2019-02-28 10:20:16,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-02-28 10:20:16,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 126 transitions. [2019-02-28 10:20:16,234 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 126 transitions. Word has length 123 [2019-02-28 10:20:16,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:20:16,234 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 126 transitions. [2019-02-28 10:20:16,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 127 states. [2019-02-28 10:20:16,234 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 126 transitions. [2019-02-28 10:20:16,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-02-28 10:20:16,235 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:20:16,235 INFO L402 BasicCegarLoop]: trace histogram [62, 61, 1, 1] [2019-02-28 10:20:16,235 INFO L423 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:20:16,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:20:16,235 INFO L82 PathProgramCache]: Analyzing trace with hash -150823526, now seen corresponding path program 61 times [2019-02-28 10:20:16,235 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:20:16,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:20:16,236 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:20:16,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:20:16,236 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:20:16,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:20:19,764 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:20:19,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:20:19,765 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:20:19,765 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:20:19,765 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:20:19,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:20:19,765 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:20:19,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:20:19,774 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:20:19,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:20:19,813 WARN L254 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 129 conjunts are in the unsatisfiable core [2019-02-28 10:20:19,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:20:19,817 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:20:19,817 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:20:19,830 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:20:19,830 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:20:25,365 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:20:25,365 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:20:25,371 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:20:25,371 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:20:25,477 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:20:25,477 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:20:35,168 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:20:35,186 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:20:35,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 191 [2019-02-28 10:20:35,186 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:20:35,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 129 states [2019-02-28 10:20:35,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2019-02-28 10:20:35,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4424, Invalid=32632, Unknown=0, NotChecked=0, Total=37056 [2019-02-28 10:20:35,188 INFO L87 Difference]: Start difference. First operand 126 states and 126 transitions. Second operand 129 states. [2019-02-28 10:20:43,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:20:43,208 INFO L93 Difference]: Finished difference Result 130 states and 130 transitions. [2019-02-28 10:20:43,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-02-28 10:20:43,209 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 125 [2019-02-28 10:20:43,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:20:43,210 INFO L225 Difference]: With dead ends: 130 [2019-02-28 10:20:43,210 INFO L226 Difference]: Without dead ends: 129 [2019-02-28 10:20:43,211 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 120 SyntacticMatches, 1 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8316 ImplicationChecksByTransitivity, 18.5s TimeCoverageRelationStatistics Valid=4424, Invalid=32632, Unknown=0, NotChecked=0, Total=37056 [2019-02-28 10:20:43,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-02-28 10:20:43,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 128. [2019-02-28 10:20:43,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-02-28 10:20:43,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 128 transitions. [2019-02-28 10:20:43,216 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 128 transitions. Word has length 125 [2019-02-28 10:20:43,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:20:43,216 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 128 transitions. [2019-02-28 10:20:43,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 129 states. [2019-02-28 10:20:43,216 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 128 transitions. [2019-02-28 10:20:43,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-02-28 10:20:43,217 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:20:43,217 INFO L402 BasicCegarLoop]: trace histogram [63, 62, 1, 1] [2019-02-28 10:20:43,217 INFO L423 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:20:43,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:20:43,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1087480668, now seen corresponding path program 62 times [2019-02-28 10:20:43,217 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:20:43,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:20:43,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:20:43,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:20:43,218 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:20:43,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:20:43,475 WARN L181 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-28 10:20:46,838 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:20:46,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:20:46,839 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:20:46,839 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:20:46,839 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:20:46,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:20:46,839 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:20:46,848 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:20:46,849 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:20:46,958 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 63 check-sat command(s) [2019-02-28 10:20:46,959 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:20:46,961 WARN L254 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 131 conjunts are in the unsatisfiable core [2019-02-28 10:20:46,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:20:46,964 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:20:46,964 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:20:46,974 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:20:46,974 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:20:52,771 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:20:52,771 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:20:52,776 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:20:52,776 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:20:52,892 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:20:52,892 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:21:02,950 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:21:02,970 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:21:02,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 194 [2019-02-28 10:21:02,970 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:21:02,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 131 states [2019-02-28 10:21:02,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2019-02-28 10:21:02,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4558, Invalid=33662, Unknown=0, NotChecked=0, Total=38220 [2019-02-28 10:21:02,972 INFO L87 Difference]: Start difference. First operand 128 states and 128 transitions. Second operand 131 states. [2019-02-28 10:21:09,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:21:09,606 INFO L93 Difference]: Finished difference Result 132 states and 132 transitions. [2019-02-28 10:21:09,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-02-28 10:21:09,607 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 127 [2019-02-28 10:21:09,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:21:09,608 INFO L225 Difference]: With dead ends: 132 [2019-02-28 10:21:09,608 INFO L226 Difference]: Without dead ends: 131 [2019-02-28 10:21:09,609 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 122 SyntacticMatches, 1 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8576 ImplicationChecksByTransitivity, 19.3s TimeCoverageRelationStatistics Valid=4558, Invalid=33662, Unknown=0, NotChecked=0, Total=38220 [2019-02-28 10:21:09,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-02-28 10:21:09,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2019-02-28 10:21:09,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-02-28 10:21:09,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 130 transitions. [2019-02-28 10:21:09,613 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 130 transitions. Word has length 127 [2019-02-28 10:21:09,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:21:09,614 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 130 transitions. [2019-02-28 10:21:09,614 INFO L481 AbstractCegarLoop]: Interpolant automaton has 131 states. [2019-02-28 10:21:09,614 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 130 transitions. [2019-02-28 10:21:09,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-02-28 10:21:09,614 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:21:09,614 INFO L402 BasicCegarLoop]: trace histogram [64, 63, 1, 1] [2019-02-28 10:21:09,615 INFO L423 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:21:09,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:21:09,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1391870110, now seen corresponding path program 63 times [2019-02-28 10:21:09,615 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:21:09,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:21:09,616 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:21:09,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:21:09,616 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:21:09,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:21:13,145 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:21:13,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:21:13,146 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:21:13,146 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:21:13,146 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:21:13,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:21:13,146 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:21:13,159 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:21:13,159 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:21:13,194 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:21:13,195 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:21:13,200 WARN L254 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 133 conjunts are in the unsatisfiable core [2019-02-28 10:21:13,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:21:13,204 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:21:13,204 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:21:13,210 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:21:13,210 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:21:19,111 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:21:19,112 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:21:19,117 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:21:19,117 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:21:19,327 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:21:19,327 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:21:30,000 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:21:30,018 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:21:30,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 197 [2019-02-28 10:21:30,018 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:21:30,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 133 states [2019-02-28 10:21:30,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2019-02-28 10:21:30,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4694, Invalid=34708, Unknown=0, NotChecked=0, Total=39402 [2019-02-28 10:21:30,021 INFO L87 Difference]: Start difference. First operand 130 states and 130 transitions. Second operand 133 states. [2019-02-28 10:21:38,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:21:38,175 INFO L93 Difference]: Finished difference Result 134 states and 134 transitions. [2019-02-28 10:21:38,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-02-28 10:21:38,176 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 129 [2019-02-28 10:21:38,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:21:38,177 INFO L225 Difference]: With dead ends: 134 [2019-02-28 10:21:38,177 INFO L226 Difference]: Without dead ends: 133 [2019-02-28 10:21:38,178 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 124 SyntacticMatches, 1 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8840 ImplicationChecksByTransitivity, 20.0s TimeCoverageRelationStatistics Valid=4694, Invalid=34708, Unknown=0, NotChecked=0, Total=39402 [2019-02-28 10:21:38,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-02-28 10:21:38,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 132. [2019-02-28 10:21:38,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-02-28 10:21:38,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 132 transitions. [2019-02-28 10:21:38,184 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 132 transitions. Word has length 129 [2019-02-28 10:21:38,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:21:38,185 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 132 transitions. [2019-02-28 10:21:38,185 INFO L481 AbstractCegarLoop]: Interpolant automaton has 133 states. [2019-02-28 10:21:38,185 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 132 transitions. [2019-02-28 10:21:38,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-02-28 10:21:38,186 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:21:38,186 INFO L402 BasicCegarLoop]: trace histogram [65, 64, 1, 1] [2019-02-28 10:21:38,186 INFO L423 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:21:38,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:21:38,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1852347744, now seen corresponding path program 64 times [2019-02-28 10:21:38,186 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:21:38,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:21:38,187 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:21:38,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:21:38,187 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:21:38,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:21:42,053 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:21:42,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:21:42,054 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:21:42,054 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:21:42,054 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:21:42,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:21:42,054 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:21:42,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:21:42,064 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:21:42,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:21:42,105 WARN L254 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 135 conjunts are in the unsatisfiable core [2019-02-28 10:21:42,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:21:42,110 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:21:42,110 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:21:42,116 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:21:42,116 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:21:48,135 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:21:48,136 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:21:48,146 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:21:48,146 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:21:48,260 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:21:48,260 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:21:58,857 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:21:58,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:21:58,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 200 [2019-02-28 10:21:58,876 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:21:58,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 135 states [2019-02-28 10:21:58,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2019-02-28 10:21:58,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4832, Invalid=35770, Unknown=0, NotChecked=0, Total=40602 [2019-02-28 10:21:58,879 INFO L87 Difference]: Start difference. First operand 132 states and 132 transitions. Second operand 135 states. [2019-02-28 10:22:09,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:22:09,143 INFO L93 Difference]: Finished difference Result 136 states and 136 transitions. [2019-02-28 10:22:09,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-02-28 10:22:09,143 INFO L78 Accepts]: Start accepts. Automaton has 135 states. Word has length 131 [2019-02-28 10:22:09,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:22:09,145 INFO L225 Difference]: With dead ends: 136 [2019-02-28 10:22:09,145 INFO L226 Difference]: Without dead ends: 135 [2019-02-28 10:22:09,147 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 126 SyntacticMatches, 1 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9108 ImplicationChecksByTransitivity, 20.2s TimeCoverageRelationStatistics Valid=4832, Invalid=35770, Unknown=0, NotChecked=0, Total=40602 [2019-02-28 10:22:09,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-02-28 10:22:09,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 134. [2019-02-28 10:22:09,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-02-28 10:22:09,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 134 transitions. [2019-02-28 10:22:09,151 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 134 transitions. Word has length 131 [2019-02-28 10:22:09,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:22:09,152 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 134 transitions. [2019-02-28 10:22:09,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has 135 states. [2019-02-28 10:22:09,152 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 134 transitions. [2019-02-28 10:22:09,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-02-28 10:22:09,152 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:22:09,153 INFO L402 BasicCegarLoop]: trace histogram [66, 65, 1, 1] [2019-02-28 10:22:09,153 INFO L423 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:22:09,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:09,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1989722530, now seen corresponding path program 65 times [2019-02-28 10:22:09,153 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:22:09,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:09,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:09,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:09,154 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:22:09,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:12,986 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:12,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:12,986 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:22:12,986 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:22:12,986 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:22:12,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:12,986 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:22:12,996 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:22:12,997 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:22:13,121 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 66 check-sat command(s) [2019-02-28 10:22:13,121 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:22:13,124 WARN L254 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 137 conjunts are in the unsatisfiable core [2019-02-28 10:22:13,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:22:13,143 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:22:13,144 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:13,188 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:13,188 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:22:21,063 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:22:21,063 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:21,067 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:21,067 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:22:21,182 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:21,182 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:22:32,188 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:32,207 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:22:32,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 203 [2019-02-28 10:22:32,208 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:22:32,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 137 states [2019-02-28 10:22:32,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2019-02-28 10:22:32,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4972, Invalid=36848, Unknown=0, NotChecked=0, Total=41820 [2019-02-28 10:22:32,210 INFO L87 Difference]: Start difference. First operand 134 states and 134 transitions. Second operand 137 states. [2019-02-28 10:22:39,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:22:39,348 INFO L93 Difference]: Finished difference Result 138 states and 138 transitions. [2019-02-28 10:22:39,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-02-28 10:22:39,348 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 133 [2019-02-28 10:22:39,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:22:39,350 INFO L225 Difference]: With dead ends: 138 [2019-02-28 10:22:39,350 INFO L226 Difference]: Without dead ends: 137 [2019-02-28 10:22:39,351 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 128 SyntacticMatches, 1 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9380 ImplicationChecksByTransitivity, 22.5s TimeCoverageRelationStatistics Valid=4972, Invalid=36848, Unknown=0, NotChecked=0, Total=41820 [2019-02-28 10:22:39,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-02-28 10:22:39,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 136. [2019-02-28 10:22:39,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-02-28 10:22:39,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 136 transitions. [2019-02-28 10:22:39,356 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 136 transitions. Word has length 133 [2019-02-28 10:22:39,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:22:39,356 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 136 transitions. [2019-02-28 10:22:39,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 137 states. [2019-02-28 10:22:39,356 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 136 transitions. [2019-02-28 10:22:39,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-02-28 10:22:39,357 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:22:39,357 INFO L402 BasicCegarLoop]: trace histogram [67, 66, 1, 1] [2019-02-28 10:22:39,357 INFO L423 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:22:39,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:39,357 INFO L82 PathProgramCache]: Analyzing trace with hash 862905700, now seen corresponding path program 66 times [2019-02-28 10:22:39,357 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:22:39,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:39,358 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:22:39,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:39,358 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:22:39,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:43,357 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:43,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:43,358 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:22:43,358 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:22:43,358 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:22:43,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:43,358 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:22:43,367 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:22:43,367 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:22:43,409 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:22:43,409 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:22:43,412 WARN L254 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 139 conjunts are in the unsatisfiable core [2019-02-28 10:22:43,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:22:43,437 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:22:43,438 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:43,461 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:43,461 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-28 10:22:49,903 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2019-02-28 10:22:49,903 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:49,907 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:49,908 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-28 10:22:50,026 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:50,027 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:23:01,331 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:01,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:23:01,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 206 [2019-02-28 10:23:01,351 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:23:01,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 139 states [2019-02-28 10:23:01,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2019-02-28 10:23:01,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5114, Invalid=37942, Unknown=0, NotChecked=0, Total=43056 [2019-02-28 10:23:01,354 INFO L87 Difference]: Start difference. First operand 136 states and 136 transitions. Second operand 139 states. [2019-02-28 10:23:12,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:23:12,006 INFO L93 Difference]: Finished difference Result 140 states and 140 transitions. [2019-02-28 10:23:12,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-02-28 10:23:12,007 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 135 [2019-02-28 10:23:12,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:23:12,008 INFO L225 Difference]: With dead ends: 140 [2019-02-28 10:23:12,008 INFO L226 Difference]: Without dead ends: 139 [2019-02-28 10:23:12,009 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 130 SyntacticMatches, 1 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9656 ImplicationChecksByTransitivity, 21.5s TimeCoverageRelationStatistics Valid=5114, Invalid=37942, Unknown=0, NotChecked=0, Total=43056 [2019-02-28 10:23:12,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-02-28 10:23:12,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 138. [2019-02-28 10:23:12,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-02-28 10:23:12,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 138 transitions. [2019-02-28 10:23:12,014 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 138 transitions. Word has length 135 [2019-02-28 10:23:12,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:23:12,014 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 138 transitions. [2019-02-28 10:23:12,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 139 states. [2019-02-28 10:23:12,014 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 138 transitions. [2019-02-28 10:23:12,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-02-28 10:23:12,015 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:23:12,015 INFO L402 BasicCegarLoop]: trace histogram [68, 67, 1, 1] [2019-02-28 10:23:12,015 INFO L423 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:23:12,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:23:12,016 INFO L82 PathProgramCache]: Analyzing trace with hash 323690662, now seen corresponding path program 67 times [2019-02-28 10:23:12,016 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:23:12,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:12,016 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:23:12,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:23:12,016 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:23:12,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:15,833 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 4556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:23:15,833 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:15,833 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:23:15,833 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:23:15,833 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:23:15,833 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:23:15,834 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:23:15,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:23:15,842 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:23:15,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:23:15,883 WARN L254 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 141 conjunts are in the unsatisfiable core [2019-02-28 10:23:15,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:23:15,889 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-28 10:23:15,889 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:23:15,895 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:23:15,895 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11