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-1de736e-m [2019-02-15 10:44:47,477 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-15 10:44:47,479 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-15 10:44:47,498 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-15 10:44:47,498 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-15 10:44:47,499 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-15 10:44:47,501 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-15 10:44:47,503 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-15 10:44:47,506 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-15 10:44:47,507 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-15 10:44:47,510 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-15 10:44:47,510 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-15 10:44:47,512 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-15 10:44:47,513 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-15 10:44:47,520 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-15 10:44:47,521 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-15 10:44:47,524 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-15 10:44:47,526 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-15 10:44:47,531 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-15 10:44:47,536 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-15 10:44:47,538 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-15 10:44:47,539 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-15 10:44:47,542 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-15 10:44:47,542 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-15 10:44:47,542 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-15 10:44:47,544 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-15 10:44:47,544 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-15 10:44:47,547 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-15 10:44:47,549 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-15 10:44:47,551 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-15 10:44:47,552 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-15 10:44:47,553 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-15 10:44:47,554 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-15 10:44:47,554 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-15 10:44:47,555 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-15 10:44:47,555 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-15 10:44:47,556 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-15 10:44:47,578 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-15 10:44:47,578 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-15 10:44:47,579 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-15 10:44:47,579 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-15 10:44:47,580 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-15 10:44:47,580 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-15 10:44:47,580 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-15 10:44:47,580 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-15 10:44:47,581 INFO L133 SettingsManager]: * Explicit value domain=true [2019-02-15 10:44:47,581 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-15 10:44:47,581 INFO L133 SettingsManager]: * Octagon Domain=false [2019-02-15 10:44:47,581 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-02-15 10:44:47,581 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-15 10:44:47,581 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-15 10:44:47,582 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-15 10:44:47,582 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-15 10:44:47,583 INFO L133 SettingsManager]: * Use SBE=true [2019-02-15 10:44:47,584 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-15 10:44:47,584 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-15 10:44:47,584 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-15 10:44:47,584 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-15 10:44:47,585 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-15 10:44:47,585 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-15 10:44:47,585 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-15 10:44:47,585 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-15 10:44:47,586 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-15 10:44:47,586 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-15 10:44:47,586 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-15 10:44:47,586 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-15 10:44:47,587 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-15 10:44:47,587 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-15 10:44:47,587 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-15 10:44:47,587 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-15 10:44:47,587 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-15 10:44:47,588 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-15 10:44:47,588 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-15 10:44:47,588 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-15 10:44:47,588 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-02-15 10:44:47,589 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-15 10:44:47,589 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-15 10:44:47,636 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-15 10:44:47,651 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-15 10:44:47,658 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-15 10:44:47,659 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-15 10:44:47,660 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-15 10:44:47,662 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-15 10:44:47,662 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/divisibilityWithArray.bpl' [2019-02-15 10:44:47,705 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-15 10:44:47,706 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-15 10:44:47,707 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-15 10:44:47,707 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-15 10:44:47,707 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-15 10:44:47,726 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:44:47" (1/1) ... [2019-02-15 10:44:47,737 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:44:47" (1/1) ... [2019-02-15 10:44:47,742 WARN L165 Inliner]: Program contained no entry procedure! [2019-02-15 10:44:47,743 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-02-15 10:44:47,743 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-02-15 10:44:47,745 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-15 10:44:47,746 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-15 10:44:47,746 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-15 10:44:47,746 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-15 10:44:47,758 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:44:47" (1/1) ... [2019-02-15 10:44:47,758 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:44:47" (1/1) ... [2019-02-15 10:44:47,759 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:44:47" (1/1) ... [2019-02-15 10:44:47,759 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:44:47" (1/1) ... [2019-02-15 10:44:47,762 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:44:47" (1/1) ... [2019-02-15 10:44:47,766 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:44:47" (1/1) ... [2019-02-15 10:44:47,767 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:44:47" (1/1) ... [2019-02-15 10:44:47,768 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-15 10:44:47,769 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-15 10:44:47,769 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-15 10:44:47,769 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-15 10:44:47,770 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:44:47" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-15 10:44:47,840 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-02-15 10:44:47,840 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-02-15 10:44:47,840 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-02-15 10:44:48,002 INFO L278 CfgBuilder]: Using library mode [2019-02-15 10:44:48,003 INFO L286 CfgBuilder]: Removed 0 assue(true) statements. [2019-02-15 10:44:48,004 INFO L202 PluginConnector]: Adding new model divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:44:48 BoogieIcfgContainer [2019-02-15 10:44:48,004 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-15 10:44:48,005 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-15 10:44:48,005 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-15 10:44:48,009 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-15 10:44:48,009 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:44:47" (1/2) ... [2019-02-15 10:44:48,010 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cdf57b3 and model type divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:44:48, skipping insertion in model container [2019-02-15 10:44:48,010 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:44:48" (2/2) ... [2019-02-15 10:44:48,012 INFO L112 eAbstractionObserver]: Analyzing ICFG divisibilityWithArray.bpl [2019-02-15 10:44:48,023 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-15 10:44:48,031 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-02-15 10:44:48,049 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-02-15 10:44:48,083 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-15 10:44:48,083 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-15 10:44:48,083 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-15 10:44:48,084 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-15 10:44:48,084 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-15 10:44:48,084 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-15 10:44:48,084 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-15 10:44:48,084 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-15 10:44:48,101 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-02-15 10:44:48,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-15 10:44:48,108 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:44:48,109 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-15 10:44:48,111 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:44:48,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:44:48,118 INFO L82 PathProgramCache]: Analyzing trace with hash 29920, now seen corresponding path program 1 times [2019-02-15 10:44:48,120 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:44:48,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:44:48,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:44:48,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:44:48,176 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:44:48,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:44:48,664 WARN L181 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 19 [2019-02-15 10:44:48,713 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-15 10:44:48,715 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-15 10:44:48,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-15 10:44:48,715 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 10:44:48,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-15 10:44:48,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-15 10:44:48,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-02-15 10:44:48,734 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 4 states. [2019-02-15 10:44:48,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:44:48,842 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-02-15 10:44:48,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-15 10:44:48,844 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-02-15 10:44:48,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:44:48,856 INFO L225 Difference]: With dead ends: 14 [2019-02-15 10:44:48,856 INFO L226 Difference]: Without dead ends: 7 [2019-02-15 10:44:48,861 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-15 10:44:48,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-02-15 10:44:48,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. [2019-02-15 10:44:48,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-02-15 10:44:48,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-02-15 10:44:48,893 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 3 [2019-02-15 10:44:48,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:44:48,893 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-02-15 10:44:48,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-15 10:44:48,893 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-02-15 10:44:48,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:44:48,894 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:44:48,894 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-02-15 10:44:48,894 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:44:48,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:44:48,894 INFO L82 PathProgramCache]: Analyzing trace with hash 28754210, now seen corresponding path program 1 times [2019-02-15 10:44:48,895 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:44:48,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:44:48,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:44:48,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:44:48,896 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:44:48,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:44:49,379 WARN L181 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 21 [2019-02-15 10:44:49,675 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 7 [2019-02-15 10:44:49,677 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-15 10:44:49,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:44:49,678 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:44:49,679 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 10:44:49,681 INFO L207 CegarAbsIntRunner]: [0], [4], [5], [6] [2019-02-15 10:44:49,718 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:44:49,719 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:44:49,813 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:44:49,815 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-15 10:44:49,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:44:49,822 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:44:49,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:44:49,822 INFO 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-15 10:44:49,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:44:49,836 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:44:49,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:44:49,849 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:44:49,905 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-15 10:44:49,907 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:44:49,986 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:44:49,987 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 10:44:50,242 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-15 10:44:50,243 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:44:50,254 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:44:50,255 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 10:44:50,299 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-15 10:44:50,300 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:44:50,426 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-15 10:44:50,448 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:44:50,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-15 10:44:50,449 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:44:50,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-15 10:44:50,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-15 10:44:50,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-02-15 10:44:50,451 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 9 states. [2019-02-15 10:44:50,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:44:50,734 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-02-15 10:44:50,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 10:44:50,734 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2019-02-15 10:44:50,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:44:50,735 INFO L225 Difference]: With dead ends: 10 [2019-02-15 10:44:50,735 INFO L226 Difference]: Without dead ends: 9 [2019-02-15 10:44:50,737 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-02-15 10:44:50,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-02-15 10:44:50,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2019-02-15 10:44:50,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-02-15 10:44:50,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-02-15 10:44:50,740 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 5 [2019-02-15 10:44:50,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:44:50,741 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-02-15 10:44:50,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-15 10:44:50,741 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-02-15 10:44:50,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 10:44:50,741 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:44:50,742 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1] [2019-02-15 10:44:50,742 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:44:50,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:44:50,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1862993124, now seen corresponding path program 2 times [2019-02-15 10:44:50,743 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:44:50,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:44:50,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:44:50,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:44:50,745 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:44:50,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:44:51,087 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:44:51,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:44:51,087 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:44:51,087 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:44:51,088 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:44:51,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:44:51,088 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-15 10:44:51,097 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:44:51,097 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:44:51,106 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-15 10:44:51,106 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:44:51,108 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:44:51,123 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-15 10:44:51,123 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:44:51,129 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:44:51,130 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 10:44:51,239 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-15 10:44:51,240 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:44:51,253 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:44:51,253 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 10:44:51,271 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-15 10:44:51,271 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:44:51,529 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-15 10:44:51,550 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:44:51,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-15 10:44:51,550 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:44:51,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-15 10:44:51,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-15 10:44:51,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2019-02-15 10:44:51,552 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 11 states. [2019-02-15 10:44:51,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:44:51,644 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-02-15 10:44:51,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 10:44:51,645 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-02-15 10:44:51,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:44:51,645 INFO L225 Difference]: With dead ends: 12 [2019-02-15 10:44:51,646 INFO L226 Difference]: Without dead ends: 11 [2019-02-15 10:44:51,646 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2019-02-15 10:44:51,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-02-15 10:44:51,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2019-02-15 10:44:51,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-02-15 10:44:51,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-02-15 10:44:51,649 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 7 [2019-02-15 10:44:51,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:44:51,650 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-02-15 10:44:51,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-15 10:44:51,650 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-02-15 10:44:51,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-15 10:44:51,650 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:44:51,651 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1] [2019-02-15 10:44:51,651 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:44:51,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:44:51,651 INFO L82 PathProgramCache]: Analyzing trace with hash -664969178, now seen corresponding path program 3 times [2019-02-15 10:44:51,652 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:44:51,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:44:51,653 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:44:51,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:44:51,653 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:44:51,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:44:51,982 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-15 10:44:51,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:44:51,983 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:44:51,983 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:44:51,983 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:44:51,984 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:44:51,984 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-15 10:44:51,992 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:44:51,992 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:44:52,006 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:44:52,006 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:44:52,010 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:44:52,014 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-15 10:44:52,014 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:44:52,021 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:44:52,022 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 10:44:52,226 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-15 10:44:52,227 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:44:52,308 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:44:52,309 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 10:44:52,338 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-15 10:44:52,338 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:44:52,456 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-15 10:44:52,482 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:44:52,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2019-02-15 10:44:52,482 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:44:52,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-02-15 10:44:52,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-02-15 10:44:52,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2019-02-15 10:44:52,483 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 13 states. [2019-02-15 10:44:52,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:44:52,598 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-02-15 10:44:52,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 10:44:52,600 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 9 [2019-02-15 10:44:52,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:44:52,601 INFO L225 Difference]: With dead ends: 14 [2019-02-15 10:44:52,601 INFO L226 Difference]: Without dead ends: 13 [2019-02-15 10:44:52,601 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-15 10:44:52,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-02-15 10:44:52,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2019-02-15 10:44:52,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-02-15 10:44:52,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-02-15 10:44:52,604 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 9 [2019-02-15 10:44:52,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:44:52,605 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-02-15 10:44:52,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-02-15 10:44:52,605 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-02-15 10:44:52,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-02-15 10:44:52,605 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:44:52,606 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 1, 1] [2019-02-15 10:44:52,606 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:44:52,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:44:52,606 INFO L82 PathProgramCache]: Analyzing trace with hash 914748136, now seen corresponding path program 4 times [2019-02-15 10:44:52,606 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:44:52,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:44:52,607 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:44:52,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:44:52,607 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:44:52,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:44:52,911 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-15 10:44:52,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:44:52,912 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:44:52,912 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:44:52,912 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:44:52,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:44:52,913 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-15 10:44:52,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:44:52,930 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:44:52,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:44:52,938 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:44:52,944 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-15 10:44:52,945 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:44:52,983 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:44:52,984 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 10:44:53,184 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-15 10:44:53,185 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:44:53,193 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:44:53,194 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 10:44:53,204 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-15 10:44:53,204 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:44:53,382 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-15 10:44:53,402 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:44:53,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2019-02-15 10:44:53,402 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:44:53,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-02-15 10:44:53,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-02-15 10:44:53,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2019-02-15 10:44:53,404 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 15 states. [2019-02-15 10:44:53,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:44:53,523 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-02-15 10:44:53,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 10:44:53,524 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 11 [2019-02-15 10:44:53,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:44:53,525 INFO L225 Difference]: With dead ends: 16 [2019-02-15 10:44:53,525 INFO L226 Difference]: Without dead ends: 15 [2019-02-15 10:44:53,526 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-15 10:44:53,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-02-15 10:44:53,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2019-02-15 10:44:53,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-02-15 10:44:53,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-02-15 10:44:53,529 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2019-02-15 10:44:53,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:44:53,529 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-02-15 10:44:53,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-02-15 10:44:53,530 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-02-15 10:44:53,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-02-15 10:44:53,530 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:44:53,530 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 1, 1] [2019-02-15 10:44:53,530 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:44:53,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:44:53,531 INFO L82 PathProgramCache]: Analyzing trace with hash -1395335894, now seen corresponding path program 5 times [2019-02-15 10:44:53,531 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:44:53,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:44:53,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:44:53,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:44:53,532 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:44:53,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:44:53,923 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-15 10:44:53,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:44:53,923 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:44:53,924 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:44:53,924 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:44:53,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:44:53,924 INFO 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-15 10:44:53,933 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:44:53,933 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:44:53,944 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-02-15 10:44:53,944 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:44:53,945 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:44:53,952 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-15 10:44:53,952 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:44:53,961 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:44:53,962 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 10:44:54,114 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-15 10:44:54,115 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:44:54,122 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:44:54,123 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 10:44:54,133 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-15 10:44:54,133 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:44:54,350 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-15 10:44:54,370 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:44:54,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 23 [2019-02-15 10:44:54,371 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:44:54,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-02-15 10:44:54,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-02-15 10:44:54,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=488, Unknown=0, NotChecked=0, Total=600 [2019-02-15 10:44:54,372 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 17 states. [2019-02-15 10:44:54,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:44:54,519 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-02-15 10:44:54,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-15 10:44:54,520 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 13 [2019-02-15 10:44:54,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:44:54,521 INFO L225 Difference]: With dead ends: 18 [2019-02-15 10:44:54,521 INFO L226 Difference]: Without dead ends: 17 [2019-02-15 10:44:54,522 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=112, Invalid=488, Unknown=0, NotChecked=0, Total=600 [2019-02-15 10:44:54,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-02-15 10:44:54,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-02-15 10:44:54,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-02-15 10:44:54,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-02-15 10:44:54,526 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 13 [2019-02-15 10:44:54,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:44:54,526 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-02-15 10:44:54,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-02-15 10:44:54,527 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-02-15 10:44:54,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-02-15 10:44:54,527 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:44:54,527 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 1, 1] [2019-02-15 10:44:54,528 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:44:54,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:44:54,528 INFO L82 PathProgramCache]: Analyzing trace with hash -887996692, now seen corresponding path program 6 times [2019-02-15 10:44:54,528 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:44:54,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:44:54,529 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:44:54,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:44:54,529 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:44:54,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:44:54,921 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-15 10:44:54,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:44:54,921 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:44:54,922 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:44:54,922 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:44:54,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:44:54,922 INFO 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-15 10:44:54,933 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:44:54,934 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:44:54,957 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:44:54,957 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:44:54,959 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:44:54,965 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-15 10:44:54,965 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:44:54,973 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:44:54,974 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 10:44:55,151 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-15 10:44:55,151 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:44:55,155 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:44:55,156 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 10:44:55,394 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-15 10:44:55,394 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:44:55,863 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-15 10:44:55,883 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:44:55,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2019-02-15 10:44:55,883 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:44:55,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-02-15 10:44:55,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-02-15 10:44:55,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=622, Unknown=0, NotChecked=0, Total=756 [2019-02-15 10:44:55,884 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 19 states. [2019-02-15 10:44:56,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:44:56,241 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-02-15 10:44:56,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-15 10:44:56,241 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 15 [2019-02-15 10:44:56,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:44:56,242 INFO L225 Difference]: With dead ends: 20 [2019-02-15 10:44:56,242 INFO L226 Difference]: Without dead ends: 19 [2019-02-15 10:44:56,244 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-15 10:44:56,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-02-15 10:44:56,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2019-02-15 10:44:56,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-02-15 10:44:56,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-02-15 10:44:56,248 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 15 [2019-02-15 10:44:56,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:44:56,248 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-02-15 10:44:56,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-02-15 10:44:56,248 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-02-15 10:44:56,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-02-15 10:44:56,249 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:44:56,249 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 1, 1] [2019-02-15 10:44:56,249 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:44:56,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:44:56,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1333671982, now seen corresponding path program 7 times [2019-02-15 10:44:56,250 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:44:56,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:44:56,251 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:44:56,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:44:56,251 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:44:56,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:44:56,749 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-15 10:44:56,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:44:56,749 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:44:56,749 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:44:56,749 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:44:56,750 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:44:56,750 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-15 10:44:56,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:44:56,758 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:44:56,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:44:56,781 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:44:56,798 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-15 10:44:56,799 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:44:56,808 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:44:56,808 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 10:44:57,038 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-15 10:44:57,039 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:44:57,044 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:44:57,045 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 10:44:57,060 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-15 10:44:57,060 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:44:57,332 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-15 10:44:57,352 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:44:57,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 29 [2019-02-15 10:44:57,352 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:44:57,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-02-15 10:44:57,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-02-15 10:44:57,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=772, Unknown=0, NotChecked=0, Total=930 [2019-02-15 10:44:57,354 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 21 states. [2019-02-15 10:44:57,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:44:57,774 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-02-15 10:44:57,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-02-15 10:44:57,775 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 17 [2019-02-15 10:44:57,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:44:57,776 INFO L225 Difference]: With dead ends: 22 [2019-02-15 10:44:57,776 INFO L226 Difference]: Without dead ends: 21 [2019-02-15 10:44:57,780 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=158, Invalid=772, Unknown=0, NotChecked=0, Total=930 [2019-02-15 10:44:57,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-02-15 10:44:57,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2019-02-15 10:44:57,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-02-15 10:44:57,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-02-15 10:44:57,789 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 17 [2019-02-15 10:44:57,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:44:57,790 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-02-15 10:44:57,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-02-15 10:44:57,790 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-02-15 10:44:57,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-02-15 10:44:57,791 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:44:57,791 INFO L402 BasicCegarLoop]: trace histogram [9, 8, 1, 1] [2019-02-15 10:44:57,791 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:44:57,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:44:57,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1758521584, now seen corresponding path program 8 times [2019-02-15 10:44:57,792 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:44:57,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:44:57,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:44:57,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:44:57,794 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:44:57,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:44:58,227 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-15 10:44:58,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:44:58,228 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:44:58,228 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:44:58,228 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:44:58,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:44:58,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 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-15 10:44:58,237 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:44:58,237 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:44:58,248 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-02-15 10:44:58,248 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:44:58,250 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:44:58,254 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-15 10:44:58,254 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:44:58,262 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:44:58,262 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 10:44:58,457 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-15 10:44:58,458 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:44:58,462 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:44:58,463 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 10:44:58,477 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-15 10:44:58,477 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:44:58,857 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-15 10:44:58,877 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:44:58,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 32 [2019-02-15 10:44:58,878 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:44:58,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-02-15 10:44:58,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-02-15 10:44:58,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=938, Unknown=0, NotChecked=0, Total=1122 [2019-02-15 10:44:58,879 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 23 states. [2019-02-15 10:44:59,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:44:59,234 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-02-15 10:44:59,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-02-15 10:44:59,235 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 19 [2019-02-15 10:44:59,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:44:59,237 INFO L225 Difference]: With dead ends: 24 [2019-02-15 10:44:59,237 INFO L226 Difference]: Without dead ends: 23 [2019-02-15 10:44:59,238 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=184, Invalid=938, Unknown=0, NotChecked=0, Total=1122 [2019-02-15 10:44:59,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-02-15 10:44:59,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-02-15 10:44:59,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-02-15 10:44:59,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-02-15 10:44:59,242 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 19 [2019-02-15 10:44:59,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:44:59,242 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-02-15 10:44:59,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-02-15 10:44:59,242 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-02-15 10:44:59,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-02-15 10:44:59,243 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:44:59,243 INFO L402 BasicCegarLoop]: trace histogram [10, 9, 1, 1] [2019-02-15 10:44:59,243 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:44:59,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:44:59,244 INFO L82 PathProgramCache]: Analyzing trace with hash 2017095986, now seen corresponding path program 9 times [2019-02-15 10:44:59,244 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:44:59,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:44:59,245 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:44:59,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:44:59,245 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:44:59,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:44:59,676 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-15 10:44:59,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:44:59,677 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:44:59,677 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:44:59,677 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:44:59,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:44:59,678 INFO 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-15 10:44:59,687 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:44:59,687 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:44:59,697 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:44:59,697 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:44:59,699 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:44:59,703 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-15 10:44:59,703 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:44:59,709 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:44:59,709 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 10:45:00,104 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-15 10:45:00,105 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:00,110 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:45:00,110 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 10:45:00,126 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-15 10:45:00,126 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:00,503 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-15 10:45:00,522 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:00,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 35 [2019-02-15 10:45:00,523 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:00,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-02-15 10:45:00,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-02-15 10:45:00,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=1120, Unknown=0, NotChecked=0, Total=1332 [2019-02-15 10:45:00,524 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 25 states. [2019-02-15 10:45:00,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:00,809 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-02-15 10:45:00,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-02-15 10:45:00,809 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 21 [2019-02-15 10:45:00,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:00,810 INFO L225 Difference]: With dead ends: 26 [2019-02-15 10:45:00,811 INFO L226 Difference]: Without dead ends: 25 [2019-02-15 10:45:00,812 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-15 10:45:00,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-02-15 10:45:00,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2019-02-15 10:45:00,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-02-15 10:45:00,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-02-15 10:45:00,816 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 21 [2019-02-15 10:45:00,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:00,817 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-02-15 10:45:00,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-02-15 10:45:00,817 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-02-15 10:45:00,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-02-15 10:45:00,817 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:00,818 INFO L402 BasicCegarLoop]: trace histogram [11, 10, 1, 1] [2019-02-15 10:45:00,818 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:00,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:00,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1398993140, now seen corresponding path program 10 times [2019-02-15 10:45:00,818 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:00,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:00,819 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:45:00,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:00,819 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:00,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:01,235 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-15 10:45:01,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:01,235 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:01,236 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:01,236 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:01,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:01,236 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-15 10:45:01,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:01,245 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:45:01,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:01,256 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:01,259 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-15 10:45:01,260 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:01,267 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:45:01,267 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 10:45:01,605 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-15 10:45:01,606 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:01,625 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:45:01,625 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 10:45:01,642 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-15 10:45:01,642 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:02,279 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-15 10:45:02,299 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:02,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 38 [2019-02-15 10:45:02,299 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:02,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-02-15 10:45:02,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-02-15 10:45:02,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=1318, Unknown=0, NotChecked=0, Total=1560 [2019-02-15 10:45:02,301 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 27 states. [2019-02-15 10:45:02,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:02,593 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-02-15 10:45:02,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-02-15 10:45:02,594 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 23 [2019-02-15 10:45:02,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:02,595 INFO L225 Difference]: With dead ends: 28 [2019-02-15 10:45:02,595 INFO L226 Difference]: Without dead ends: 27 [2019-02-15 10:45:02,596 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=242, Invalid=1318, Unknown=0, NotChecked=0, Total=1560 [2019-02-15 10:45:02,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-02-15 10:45:02,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2019-02-15 10:45:02,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-02-15 10:45:02,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-02-15 10:45:02,601 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 23 [2019-02-15 10:45:02,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:02,601 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-02-15 10:45:02,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-02-15 10:45:02,602 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-02-15 10:45:02,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-02-15 10:45:02,602 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:02,602 INFO L402 BasicCegarLoop]: trace histogram [12, 11, 1, 1] [2019-02-15 10:45:02,602 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:02,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:02,603 INFO L82 PathProgramCache]: Analyzing trace with hash 107644982, now seen corresponding path program 11 times [2019-02-15 10:45:02,603 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:02,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:02,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:02,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:02,604 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:02,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:02,885 WARN L181 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-15 10:45:03,405 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-15 10:45:03,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:03,406 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:03,406 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:03,406 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:03,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:03,407 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-15 10:45:03,425 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:45:03,425 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:45:03,442 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-02-15 10:45:03,443 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:45:03,444 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:03,458 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-15 10:45:03,459 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:03,466 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:45:03,466 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 10:45:03,751 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-15 10:45:03,752 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:03,757 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:45:03,757 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 10:45:03,773 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-15 10:45:03,773 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:04,379 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-15 10:45:04,399 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:04,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 41 [2019-02-15 10:45:04,399 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:04,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-02-15 10:45:04,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-02-15 10:45:04,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=1532, Unknown=0, NotChecked=0, Total=1806 [2019-02-15 10:45:04,401 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 29 states. [2019-02-15 10:45:04,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:04,875 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-02-15 10:45:04,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-02-15 10:45:04,875 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 25 [2019-02-15 10:45:04,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:04,876 INFO L225 Difference]: With dead ends: 30 [2019-02-15 10:45:04,877 INFO L226 Difference]: Without dead ends: 29 [2019-02-15 10:45:04,878 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=274, Invalid=1532, Unknown=0, NotChecked=0, Total=1806 [2019-02-15 10:45:04,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-02-15 10:45:04,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-02-15 10:45:04,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-02-15 10:45:04,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-02-15 10:45:04,883 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 25 [2019-02-15 10:45:04,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:04,884 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-02-15 10:45:04,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-02-15 10:45:04,884 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-02-15 10:45:04,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-02-15 10:45:04,885 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:04,885 INFO L402 BasicCegarLoop]: trace histogram [13, 12, 1, 1] [2019-02-15 10:45:04,885 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:04,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:04,885 INFO L82 PathProgramCache]: Analyzing trace with hash 367613688, now seen corresponding path program 12 times [2019-02-15 10:45:04,885 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:04,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:04,886 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:45:04,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:04,887 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:04,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:05,539 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-15 10:45:05,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:05,540 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:05,540 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:05,540 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:05,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:05,540 INFO 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-15 10:45:05,551 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:45:05,551 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:45:05,564 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:45:05,564 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:45:05,566 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:05,569 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-15 10:45:05,569 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:05,574 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:45:05,575 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 10:45:05,907 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-15 10:45:05,908 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:05,912 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:45:05,912 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 10:45:05,931 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-15 10:45:05,931 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:06,475 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-15 10:45:06,493 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:06,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 44 [2019-02-15 10:45:06,494 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:06,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-02-15 10:45:06,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-02-15 10:45:06,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=308, Invalid=1762, Unknown=0, NotChecked=0, Total=2070 [2019-02-15 10:45:06,495 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 31 states. [2019-02-15 10:45:07,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:07,123 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-02-15 10:45:07,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-02-15 10:45:07,124 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 27 [2019-02-15 10:45:07,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:07,125 INFO L225 Difference]: With dead ends: 32 [2019-02-15 10:45:07,125 INFO L226 Difference]: Without dead ends: 31 [2019-02-15 10:45:07,126 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 476 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=308, Invalid=1762, Unknown=0, NotChecked=0, Total=2070 [2019-02-15 10:45:07,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-02-15 10:45:07,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-02-15 10:45:07,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-02-15 10:45:07,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-02-15 10:45:07,131 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 27 [2019-02-15 10:45:07,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:07,131 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-02-15 10:45:07,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-02-15 10:45:07,131 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-02-15 10:45:07,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-02-15 10:45:07,132 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:07,132 INFO L402 BasicCegarLoop]: trace histogram [14, 13, 1, 1] [2019-02-15 10:45:07,132 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:07,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:07,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1089436986, now seen corresponding path program 13 times [2019-02-15 10:45:07,133 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:07,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:07,134 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:45:07,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:07,134 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:07,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:07,419 WARN L181 SmtUtils]: Spent 221.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-15 10:45:07,693 WARN L181 SmtUtils]: Spent 221.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-15 10:45:08,296 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-15 10:45:08,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:08,297 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:08,297 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:08,297 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:08,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:08,297 INFO 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-15 10:45:08,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:08,308 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:45:08,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:08,319 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:08,322 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-15 10:45:08,322 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:08,325 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:45:08,325 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 10:45:08,739 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-15 10:45:08,739 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:08,743 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:45:08,743 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 10:45:08,763 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-15 10:45:08,763 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:09,434 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-15 10:45:09,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:09,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 47 [2019-02-15 10:45:09,453 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:09,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-02-15 10:45:09,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-02-15 10:45:09,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=344, Invalid=2008, Unknown=0, NotChecked=0, Total=2352 [2019-02-15 10:45:09,455 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 33 states. [2019-02-15 10:45:10,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:10,193 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-02-15 10:45:10,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-02-15 10:45:10,193 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 29 [2019-02-15 10:45:10,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:10,194 INFO L225 Difference]: With dead ends: 34 [2019-02-15 10:45:10,194 INFO L226 Difference]: Without dead ends: 33 [2019-02-15 10:45:10,196 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 540 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=344, Invalid=2008, Unknown=0, NotChecked=0, Total=2352 [2019-02-15 10:45:10,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-02-15 10:45:10,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2019-02-15 10:45:10,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-02-15 10:45:10,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-02-15 10:45:10,201 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 29 [2019-02-15 10:45:10,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:10,201 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-02-15 10:45:10,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-02-15 10:45:10,202 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-02-15 10:45:10,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-02-15 10:45:10,202 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:10,202 INFO L402 BasicCegarLoop]: trace histogram [15, 14, 1, 1] [2019-02-15 10:45:10,203 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:10,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:10,203 INFO L82 PathProgramCache]: Analyzing trace with hash -1023075588, now seen corresponding path program 14 times [2019-02-15 10:45:10,203 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:10,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:10,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:10,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:10,204 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:10,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:11,056 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 7 [2019-02-15 10:45:11,060 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-15 10:45:11,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:11,061 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:11,061 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:11,061 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:11,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:11,061 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-15 10:45:11,070 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:45:11,071 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:45:11,098 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-02-15 10:45:11,098 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:45:11,100 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:11,105 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-15 10:45:11,105 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:11,109 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:45:11,110 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 10:45:11,529 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-15 10:45:11,530 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:11,536 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:45:11,537 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 10:45:11,559 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-15 10:45:11,560 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:12,858 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-15 10:45:12,877 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:12,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 50 [2019-02-15 10:45:12,877 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:12,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-02-15 10:45:12,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-02-15 10:45:12,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=382, Invalid=2270, Unknown=0, NotChecked=0, Total=2652 [2019-02-15 10:45:12,878 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 35 states. [2019-02-15 10:45:13,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:13,502 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-02-15 10:45:13,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-02-15 10:45:13,503 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 31 [2019-02-15 10:45:13,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:13,504 INFO L225 Difference]: With dead ends: 36 [2019-02-15 10:45:13,504 INFO L226 Difference]: Without dead ends: 35 [2019-02-15 10:45:13,505 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 608 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=382, Invalid=2270, Unknown=0, NotChecked=0, Total=2652 [2019-02-15 10:45:13,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-02-15 10:45:13,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2019-02-15 10:45:13,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-02-15 10:45:13,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-02-15 10:45:13,510 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 31 [2019-02-15 10:45:13,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:13,510 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-02-15 10:45:13,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-02-15 10:45:13,510 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-02-15 10:45:13,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-02-15 10:45:13,511 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:13,511 INFO L402 BasicCegarLoop]: trace histogram [16, 15, 1, 1] [2019-02-15 10:45:13,511 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:13,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:13,511 INFO L82 PathProgramCache]: Analyzing trace with hash 371871806, now seen corresponding path program 15 times [2019-02-15 10:45:13,512 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:13,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:13,512 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:45:13,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:13,513 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:13,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:14,114 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-15 10:45:14,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:14,114 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:14,114 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:14,115 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:14,115 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:14,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 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-15 10:45:14,128 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:45:14,128 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:45:14,139 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:45:14,139 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:45:14,142 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:14,153 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-15 10:45:14,153 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:14,161 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:45:14,161 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 10:45:14,627 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-15 10:45:14,628 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:14,632 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:45:14,632 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 10:45:14,654 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-15 10:45:14,654 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:16,207 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-15 10:45:16,228 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:16,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 53 [2019-02-15 10:45:16,228 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:16,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-02-15 10:45:16,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-02-15 10:45:16,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=422, Invalid=2548, Unknown=0, NotChecked=0, Total=2970 [2019-02-15 10:45:16,230 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 37 states. [2019-02-15 10:45:16,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:16,723 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-02-15 10:45:16,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-02-15 10:45:16,724 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 33 [2019-02-15 10:45:16,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:16,724 INFO L225 Difference]: With dead ends: 38 [2019-02-15 10:45:16,724 INFO L226 Difference]: Without dead ends: 37 [2019-02-15 10:45:16,725 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 680 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=422, Invalid=2548, Unknown=0, NotChecked=0, Total=2970 [2019-02-15 10:45:16,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-02-15 10:45:16,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2019-02-15 10:45:16,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-02-15 10:45:16,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-02-15 10:45:16,729 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 33 [2019-02-15 10:45:16,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:16,730 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-02-15 10:45:16,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-02-15 10:45:16,730 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-02-15 10:45:16,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-02-15 10:45:16,731 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:16,731 INFO L402 BasicCegarLoop]: trace histogram [17, 16, 1, 1] [2019-02-15 10:45:16,731 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:16,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:16,731 INFO L82 PathProgramCache]: Analyzing trace with hash 886521088, now seen corresponding path program 16 times [2019-02-15 10:45:16,731 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:16,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:16,732 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:45:16,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:16,732 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:16,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:16,975 WARN L181 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-15 10:45:17,209 WARN L181 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-02-15 10:45:17,492 WARN L181 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-15 10:45:18,010 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-15 10:45:18,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:18,011 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:18,011 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:18,011 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:18,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:18,011 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-15 10:45:18,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:18,021 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:45:18,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:18,032 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:18,035 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-15 10:45:18,035 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:18,038 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:45:18,038 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 10:45:18,543 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-15 10:45:18,544 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:18,550 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:45:18,550 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 10:45:18,574 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-15 10:45:18,575 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:19,445 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-15 10:45:19,464 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:19,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 56 [2019-02-15 10:45:19,464 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:19,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-02-15 10:45:19,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-02-15 10:45:19,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=464, Invalid=2842, Unknown=0, NotChecked=0, Total=3306 [2019-02-15 10:45:19,466 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 39 states. [2019-02-15 10:45:20,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:20,350 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-02-15 10:45:20,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-02-15 10:45:20,350 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 35 [2019-02-15 10:45:20,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:20,351 INFO L225 Difference]: With dead ends: 40 [2019-02-15 10:45:20,351 INFO L226 Difference]: Without dead ends: 39 [2019-02-15 10:45:20,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 756 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=464, Invalid=2842, Unknown=0, NotChecked=0, Total=3306 [2019-02-15 10:45:20,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-02-15 10:45:20,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2019-02-15 10:45:20,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-02-15 10:45:20,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-02-15 10:45:20,359 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 35 [2019-02-15 10:45:20,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:20,359 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-02-15 10:45:20,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-02-15 10:45:20,359 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-02-15 10:45:20,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-02-15 10:45:20,360 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:20,360 INFO L402 BasicCegarLoop]: trace histogram [18, 17, 1, 1] [2019-02-15 10:45:20,360 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:20,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:20,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1543242050, now seen corresponding path program 17 times [2019-02-15 10:45:20,361 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:20,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:20,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:20,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:20,362 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:20,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:20,611 WARN L181 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-15 10:45:20,878 WARN L181 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-15 10:45:21,173 WARN L181 SmtUtils]: Spent 221.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-15 10:45:21,425 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-15 10:45:21,922 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-15 10:45:21,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:21,922 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:21,923 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:21,923 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:21,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:21,923 INFO 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-15 10:45:21,931 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:45:21,931 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:45:21,954 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-02-15 10:45:21,955 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:45:21,956 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:21,962 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-15 10:45:21,962 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:21,967 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:45:21,967 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 10:45:22,665 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-15 10:45:22,666 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:22,723 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:45:22,723 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 10:45:22,747 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-15 10:45:22,747 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:23,793 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-15 10:45:23,811 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:23,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 59 [2019-02-15 10:45:23,811 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:23,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-02-15 10:45:23,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-02-15 10:45:23,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=508, Invalid=3152, Unknown=0, NotChecked=0, Total=3660 [2019-02-15 10:45:23,813 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 41 states. [2019-02-15 10:45:24,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:24,632 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-02-15 10:45:24,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-02-15 10:45:24,632 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 37 [2019-02-15 10:45:24,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:24,633 INFO L225 Difference]: With dead ends: 42 [2019-02-15 10:45:24,633 INFO L226 Difference]: Without dead ends: 41 [2019-02-15 10:45:24,635 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 836 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=508, Invalid=3152, Unknown=0, NotChecked=0, Total=3660 [2019-02-15 10:45:24,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-02-15 10:45:24,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2019-02-15 10:45:24,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-02-15 10:45:24,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-02-15 10:45:24,640 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 37 [2019-02-15 10:45:24,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:24,640 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-02-15 10:45:24,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-02-15 10:45:24,640 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-02-15 10:45:24,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-02-15 10:45:24,641 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:24,641 INFO L402 BasicCegarLoop]: trace histogram [19, 18, 1, 1] [2019-02-15 10:45:24,641 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:24,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:24,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1291894020, now seen corresponding path program 18 times [2019-02-15 10:45:24,642 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:24,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:24,642 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:45:24,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:24,643 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:24,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:24,888 WARN L181 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-15 10:45:25,476 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-15 10:45:25,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:25,477 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:25,477 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:25,477 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:25,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:25,477 INFO 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-15 10:45:25,487 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:45:25,487 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:45:25,512 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:45:25,512 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:45:25,514 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:25,532 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-15 10:45:25,532 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:25,540 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:45:25,540 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 10:45:26,184 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-15 10:45:26,185 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:26,189 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:45:26,189 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 10:45:26,225 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-15 10:45:26,225 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:27,444 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-15 10:45:27,463 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:27,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 62 [2019-02-15 10:45:27,463 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:27,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-02-15 10:45:27,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-02-15 10:45:27,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=554, Invalid=3478, Unknown=0, NotChecked=0, Total=4032 [2019-02-15 10:45:27,465 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 43 states. [2019-02-15 10:45:28,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:28,468 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-02-15 10:45:28,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-02-15 10:45:28,469 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 39 [2019-02-15 10:45:28,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:28,469 INFO L225 Difference]: With dead ends: 44 [2019-02-15 10:45:28,470 INFO L226 Difference]: Without dead ends: 43 [2019-02-15 10:45:28,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 920 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=554, Invalid=3478, Unknown=0, NotChecked=0, Total=4032 [2019-02-15 10:45:28,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-02-15 10:45:28,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2019-02-15 10:45:28,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-02-15 10:45:28,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-02-15 10:45:28,475 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 39 [2019-02-15 10:45:28,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:28,475 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-02-15 10:45:28,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-02-15 10:45:28,475 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-02-15 10:45:28,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-02-15 10:45:28,476 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:28,476 INFO L402 BasicCegarLoop]: trace histogram [20, 19, 1, 1] [2019-02-15 10:45:28,476 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:28,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:28,477 INFO L82 PathProgramCache]: Analyzing trace with hash 264605766, now seen corresponding path program 19 times [2019-02-15 10:45:28,477 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:28,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:28,477 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:45:28,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:28,478 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:28,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:29,340 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-15 10:45:29,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:29,340 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:29,340 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:29,340 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:29,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:29,340 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-15 10:45:29,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:29,349 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:45:29,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:29,361 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:29,375 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-15 10:45:29,376 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:29,378 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:45:29,379 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 10:45:30,044 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-15 10:45:30,045 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:30,058 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:45:30,059 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 10:45:30,087 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-15 10:45:30,087 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:31,171 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-15 10:45:31,190 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:31,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 65 [2019-02-15 10:45:31,190 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:31,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-02-15 10:45:31,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-02-15 10:45:31,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=602, Invalid=3820, Unknown=0, NotChecked=0, Total=4422 [2019-02-15 10:45:31,192 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 45 states. [2019-02-15 10:45:32,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:32,018 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-02-15 10:45:32,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-02-15 10:45:32,018 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 41 [2019-02-15 10:45:32,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:32,019 INFO L225 Difference]: With dead ends: 46 [2019-02-15 10:45:32,019 INFO L226 Difference]: Without dead ends: 45 [2019-02-15 10:45:32,020 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1008 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=602, Invalid=3820, Unknown=0, NotChecked=0, Total=4422 [2019-02-15 10:45:32,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-02-15 10:45:32,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2019-02-15 10:45:32,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-02-15 10:45:32,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-02-15 10:45:32,025 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 41 [2019-02-15 10:45:32,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:32,026 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-02-15 10:45:32,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-02-15 10:45:32,026 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-02-15 10:45:32,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-02-15 10:45:32,026 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:32,027 INFO L402 BasicCegarLoop]: trace histogram [21, 20, 1, 1] [2019-02-15 10:45:32,027 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:32,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:32,027 INFO L82 PathProgramCache]: Analyzing trace with hash 883071752, now seen corresponding path program 20 times [2019-02-15 10:45:32,027 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:32,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:32,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:32,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:32,028 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:32,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:32,898 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-15 10:45:32,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:32,898 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:32,898 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:32,898 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:32,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:32,898 INFO 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-15 10:45:32,910 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:45:32,910 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:45:32,939 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2019-02-15 10:45:32,939 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:45:32,941 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:32,943 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-15 10:45:32,943 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:32,946 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:45:32,946 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 10:45:33,715 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-15 10:45:33,716 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:33,721 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:45:33,721 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 10:45:33,750 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-15 10:45:33,751 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:34,950 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-15 10:45:34,970 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:34,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 68 [2019-02-15 10:45:34,970 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:34,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-02-15 10:45:34,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-02-15 10:45:34,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=652, Invalid=4178, Unknown=0, NotChecked=0, Total=4830 [2019-02-15 10:45:34,971 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 47 states. [2019-02-15 10:45:35,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:35,838 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-02-15 10:45:35,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-02-15 10:45:35,838 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 43 [2019-02-15 10:45:35,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:35,839 INFO L225 Difference]: With dead ends: 48 [2019-02-15 10:45:35,839 INFO L226 Difference]: Without dead ends: 47 [2019-02-15 10:45:35,840 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1100 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=652, Invalid=4178, Unknown=0, NotChecked=0, Total=4830 [2019-02-15 10:45:35,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-02-15 10:45:35,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2019-02-15 10:45:35,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-02-15 10:45:35,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-02-15 10:45:35,845 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 43 [2019-02-15 10:45:35,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:35,846 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-02-15 10:45:35,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-02-15 10:45:35,846 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-02-15 10:45:35,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-02-15 10:45:35,847 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:35,847 INFO L402 BasicCegarLoop]: trace histogram [22, 21, 1, 1] [2019-02-15 10:45:35,847 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:35,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:35,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1771569846, now seen corresponding path program 21 times [2019-02-15 10:45:35,848 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:35,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:35,848 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:45:35,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:35,848 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:35,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:36,578 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-15 10:45:36,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:36,578 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:36,578 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:36,579 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:36,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:36,579 INFO 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-15 10:45:36,587 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:45:36,587 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:45:36,600 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:45:36,601 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:45:36,603 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:36,612 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-15 10:45:36,612 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:36,620 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:45:36,620 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 10:45:37,629 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-15 10:45:37,630 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:37,634 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:45:37,635 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 10:45:37,665 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-15 10:45:37,666 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:39,057 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-15 10:45:39,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:39,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 71 [2019-02-15 10:45:39,075 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:39,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-02-15 10:45:39,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-02-15 10:45:39,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=704, Invalid=4552, Unknown=0, NotChecked=0, Total=5256 [2019-02-15 10:45:39,076 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 49 states. [2019-02-15 10:45:40,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:40,146 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-02-15 10:45:40,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-02-15 10:45:40,149 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 45 [2019-02-15 10:45:40,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:40,150 INFO L225 Difference]: With dead ends: 50 [2019-02-15 10:45:40,150 INFO L226 Difference]: Without dead ends: 49 [2019-02-15 10:45:40,150 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1196 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=704, Invalid=4552, Unknown=0, NotChecked=0, Total=5256 [2019-02-15 10:45:40,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-02-15 10:45:40,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2019-02-15 10:45:40,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-02-15 10:45:40,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-02-15 10:45:40,155 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 45 [2019-02-15 10:45:40,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:40,155 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-02-15 10:45:40,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-02-15 10:45:40,155 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-02-15 10:45:40,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-02-15 10:45:40,156 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:40,156 INFO L402 BasicCegarLoop]: trace histogram [23, 22, 1, 1] [2019-02-15 10:45:40,156 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:40,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:40,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1671571700, now seen corresponding path program 22 times [2019-02-15 10:45:40,156 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:40,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:40,157 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:45:40,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:40,157 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:40,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:40,428 WARN L181 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-15 10:45:41,258 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-15 10:45:41,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:41,258 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:41,258 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:41,258 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:41,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:41,259 INFO 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-15 10:45:41,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:41,266 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:45:41,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:41,282 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:41,287 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-15 10:45:41,287 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:41,293 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:45:41,293 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 10:45:42,126 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-15 10:45:42,127 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:42,131 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:45:42,132 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 10:45:42,163 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-15 10:45:42,163 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:43,899 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-15 10:45:43,917 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:43,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 74 [2019-02-15 10:45:43,918 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:43,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-02-15 10:45:43,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-02-15 10:45:43,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=758, Invalid=4942, Unknown=0, NotChecked=0, Total=5700 [2019-02-15 10:45:43,919 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 51 states. [2019-02-15 10:45:45,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:45,012 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-02-15 10:45:45,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-02-15 10:45:45,013 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 47 [2019-02-15 10:45:45,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:45,013 INFO L225 Difference]: With dead ends: 52 [2019-02-15 10:45:45,014 INFO L226 Difference]: Without dead ends: 51 [2019-02-15 10:45:45,014 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1296 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=758, Invalid=4942, Unknown=0, NotChecked=0, Total=5700 [2019-02-15 10:45:45,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-02-15 10:45:45,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2019-02-15 10:45:45,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-02-15 10:45:45,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-02-15 10:45:45,019 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 47 [2019-02-15 10:45:45,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:45,020 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-02-15 10:45:45,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-02-15 10:45:45,020 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-02-15 10:45:45,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-02-15 10:45:45,020 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:45,021 INFO L402 BasicCegarLoop]: trace histogram [24, 23, 1, 1] [2019-02-15 10:45:45,021 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:45,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:45,021 INFO L82 PathProgramCache]: Analyzing trace with hash -62633906, now seen corresponding path program 23 times [2019-02-15 10:45:45,021 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:45,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:45,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:45,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:45,022 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:45,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:45,867 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-15 10:45:45,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:45,868 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:45,868 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:45,868 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:45,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:45,868 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-15 10:45:45,876 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:45:45,876 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:45:45,906 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-02-15 10:45:45,906 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:45:45,908 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:45,911 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-15 10:45:45,911 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:45,917 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:45:45,917 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 10:45:46,796 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-15 10:45:46,797 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:46,801 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:45:46,801 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 10:45:46,846 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-15 10:45:46,847 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:48,509 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-15 10:45:48,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:48,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 77 [2019-02-15 10:45:48,528 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:48,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-02-15 10:45:48,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-02-15 10:45:48,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=814, Invalid=5348, Unknown=0, NotChecked=0, Total=6162 [2019-02-15 10:45:48,530 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 53 states. [2019-02-15 10:45:49,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:49,925 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-02-15 10:45:49,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-02-15 10:45:49,926 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 49 [2019-02-15 10:45:49,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:49,926 INFO L225 Difference]: With dead ends: 54 [2019-02-15 10:45:49,927 INFO L226 Difference]: Without dead ends: 53 [2019-02-15 10:45:49,928 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1400 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=814, Invalid=5348, Unknown=0, NotChecked=0, Total=6162 [2019-02-15 10:45:49,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-02-15 10:45:49,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2019-02-15 10:45:49,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-02-15 10:45:49,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-02-15 10:45:49,933 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 49 [2019-02-15 10:45:49,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:49,933 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-02-15 10:45:49,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-02-15 10:45:49,933 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-02-15 10:45:49,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-02-15 10:45:49,934 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:49,934 INFO L402 BasicCegarLoop]: trace histogram [25, 24, 1, 1] [2019-02-15 10:45:49,934 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:49,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:49,935 INFO L82 PathProgramCache]: Analyzing trace with hash -61640432, now seen corresponding path program 24 times [2019-02-15 10:45:49,935 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:49,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:49,935 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:45:49,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:49,936 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:49,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:50,901 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-15 10:45:50,901 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:50,902 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:50,902 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:50,902 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:50,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:50,902 INFO 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-15 10:45:50,910 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:45:50,910 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:45:50,927 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:45:50,927 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:45:50,929 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:50,933 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-15 10:45:50,934 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:50,940 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:45:50,940 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 10:45:51,942 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-15 10:45:51,943 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:51,947 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:45:51,948 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 10:45:51,982 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-15 10:45:51,982 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:53,824 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-15 10:45:53,842 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:53,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 80 [2019-02-15 10:45:53,843 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:53,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-02-15 10:45:53,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-02-15 10:45:53,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=872, Invalid=5770, Unknown=0, NotChecked=0, Total=6642 [2019-02-15 10:45:53,844 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 55 states. [2019-02-15 10:45:55,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:55,008 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-02-15 10:45:55,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-02-15 10:45:55,009 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 51 [2019-02-15 10:45:55,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:55,009 INFO L225 Difference]: With dead ends: 56 [2019-02-15 10:45:55,009 INFO L226 Difference]: Without dead ends: 55 [2019-02-15 10:45:55,010 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1508 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=872, Invalid=5770, Unknown=0, NotChecked=0, Total=6642 [2019-02-15 10:45:55,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-02-15 10:45:55,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2019-02-15 10:45:55,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-02-15 10:45:55,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-02-15 10:45:55,015 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 51 [2019-02-15 10:45:55,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:55,015 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-02-15 10:45:55,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-02-15 10:45:55,015 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-02-15 10:45:55,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-02-15 10:45:55,016 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:55,016 INFO L402 BasicCegarLoop]: trace histogram [26, 25, 1, 1] [2019-02-15 10:45:55,016 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:55,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:55,017 INFO L82 PathProgramCache]: Analyzing trace with hash 893088082, now seen corresponding path program 25 times [2019-02-15 10:45:55,017 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:55,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:55,017 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:45:55,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:55,018 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:55,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:55,955 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-15 10:45:55,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:55,956 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:55,956 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:55,956 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:55,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:55,956 INFO 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-15 10:45:55,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:55,964 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:45:55,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:55,981 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:55,999 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-15 10:45:56,000 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:56,022 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:45:56,023 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 10:45:57,069 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-15 10:45:57,069 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:57,074 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:45:57,075 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 10:45:57,112 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-15 10:45:57,112 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:46:00,080 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-15 10:46:00,098 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:46:00,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 83 [2019-02-15 10:46:00,098 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:46:00,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-02-15 10:46:00,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-02-15 10:46:00,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=932, Invalid=6208, Unknown=0, NotChecked=0, Total=7140 [2019-02-15 10:46:00,100 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 57 states. [2019-02-15 10:46:01,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:46:01,338 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-02-15 10:46:01,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-02-15 10:46:01,338 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 53 [2019-02-15 10:46:01,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:46:01,339 INFO L225 Difference]: With dead ends: 58 [2019-02-15 10:46:01,339 INFO L226 Difference]: Without dead ends: 57 [2019-02-15 10:46:01,340 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1620 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=932, Invalid=6208, Unknown=0, NotChecked=0, Total=7140 [2019-02-15 10:46:01,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-02-15 10:46:01,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2019-02-15 10:46:01,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-02-15 10:46:01,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-02-15 10:46:01,344 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 53 [2019-02-15 10:46:01,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:46:01,345 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-02-15 10:46:01,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-02-15 10:46:01,345 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-02-15 10:46:01,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-02-15 10:46:01,345 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:46:01,346 INFO L402 BasicCegarLoop]: trace histogram [27, 26, 1, 1] [2019-02-15 10:46:01,346 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:46:01,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:46:01,346 INFO L82 PathProgramCache]: Analyzing trace with hash -735811308, now seen corresponding path program 26 times [2019-02-15 10:46:01,346 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:46:01,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:01,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:46:01,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:01,347 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:46:01,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:46:02,340 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-15 10:46:02,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:02,341 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:46:02,341 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:46:02,341 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:46:02,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:02,341 INFO 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-15 10:46:02,349 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:46:02,349 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:46:02,383 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2019-02-15 10:46:02,383 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:46:02,386 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:46:02,388 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-15 10:46:02,388 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:46:02,393 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:46:02,393 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 10:46:03,707 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-15 10:46:03,707 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:46:03,711 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:46:03,711 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 10:46:03,750 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-15 10:46:03,750 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:46:05,657 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-15 10:46:05,675 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:46:05,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 86 [2019-02-15 10:46:05,676 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:46:05,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-02-15 10:46:05,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-02-15 10:46:05,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=994, Invalid=6662, Unknown=0, NotChecked=0, Total=7656 [2019-02-15 10:46:05,677 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 59 states. [2019-02-15 10:46:07,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:46:07,410 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-02-15 10:46:07,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-02-15 10:46:07,410 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 55 [2019-02-15 10:46:07,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:46:07,411 INFO L225 Difference]: With dead ends: 60 [2019-02-15 10:46:07,411 INFO L226 Difference]: Without dead ends: 59 [2019-02-15 10:46:07,412 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1736 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=994, Invalid=6662, Unknown=0, NotChecked=0, Total=7656 [2019-02-15 10:46:07,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-02-15 10:46:07,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2019-02-15 10:46:07,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-02-15 10:46:07,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-02-15 10:46:07,415 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 55 [2019-02-15 10:46:07,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:46:07,415 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-02-15 10:46:07,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-02-15 10:46:07,416 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-02-15 10:46:07,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-02-15 10:46:07,416 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:46:07,416 INFO L402 BasicCegarLoop]: trace histogram [28, 27, 1, 1] [2019-02-15 10:46:07,416 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:46:07,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:46:07,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1554937942, now seen corresponding path program 27 times [2019-02-15 10:46:07,417 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:46:07,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:07,417 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:46:07,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:07,418 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:46:07,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:46:08,644 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-15 10:46:08,645 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:08,645 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:46:08,645 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:46:08,645 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:46:08,645 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:08,645 INFO 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-15 10:46:08,654 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:46:08,654 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:46:08,670 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:46:08,671 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:46:08,672 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:46:08,674 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-15 10:46:08,675 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:46:08,680 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:46:08,681 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 10:46:09,853 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-15 10:46:09,854 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:46:09,858 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:46:09,858 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 10:46:09,899 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-15 10:46:09,899 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:46:11,928 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-15 10:46:11,947 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:46:11,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 89 [2019-02-15 10:46:11,947 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:46:11,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-02-15 10:46:11,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-02-15 10:46:11,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1058, Invalid=7132, Unknown=0, NotChecked=0, Total=8190 [2019-02-15 10:46:11,948 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 61 states. [2019-02-15 10:46:13,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:46:13,535 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-02-15 10:46:13,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-02-15 10:46:13,536 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 57 [2019-02-15 10:46:13,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:46:13,536 INFO L225 Difference]: With dead ends: 62 [2019-02-15 10:46:13,537 INFO L226 Difference]: Without dead ends: 61 [2019-02-15 10:46:13,537 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1856 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=1058, Invalid=7132, Unknown=0, NotChecked=0, Total=8190 [2019-02-15 10:46:13,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-02-15 10:46:13,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2019-02-15 10:46:13,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-02-15 10:46:13,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-02-15 10:46:13,541 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 57 [2019-02-15 10:46:13,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:46:13,541 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-02-15 10:46:13,541 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-02-15 10:46:13,541 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-02-15 10:46:13,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-02-15 10:46:13,542 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:46:13,542 INFO L402 BasicCegarLoop]: trace histogram [29, 28, 1, 1] [2019-02-15 10:46:13,542 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:46:13,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:46:13,542 INFO L82 PathProgramCache]: Analyzing trace with hash -353255656, now seen corresponding path program 28 times [2019-02-15 10:46:13,543 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:46:13,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:13,543 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:46:13,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:13,543 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:46:13,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:46:14,578 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-15 10:46:14,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:14,579 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:46:14,579 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:46:14,579 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:46:14,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:14,579 INFO 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-15 10:46:14,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:46:14,588 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:46:14,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:46:14,607 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:46:14,609 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-15 10:46:14,609 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:46:14,615 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:46:14,615 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 10:46:15,877 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-15 10:46:15,878 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:46:15,887 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:46:15,887 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 10:46:15,929 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-15 10:46:15,929 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:46:18,096 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-15 10:46:18,114 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:46:18,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 92 [2019-02-15 10:46:18,115 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:46:18,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-02-15 10:46:18,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-02-15 10:46:18,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1124, Invalid=7618, Unknown=0, NotChecked=0, Total=8742 [2019-02-15 10:46:18,116 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 63 states. [2019-02-15 10:46:19,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:46:19,728 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-02-15 10:46:19,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-02-15 10:46:19,729 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 59 [2019-02-15 10:46:19,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:46:19,729 INFO L225 Difference]: With dead ends: 64 [2019-02-15 10:46:19,730 INFO L226 Difference]: Without dead ends: 63 [2019-02-15 10:46:19,731 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1980 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=1124, Invalid=7618, Unknown=0, NotChecked=0, Total=8742 [2019-02-15 10:46:19,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-02-15 10:46:19,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2019-02-15 10:46:19,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-02-15 10:46:19,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-02-15 10:46:19,735 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 59 [2019-02-15 10:46:19,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:46:19,735 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-02-15 10:46:19,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-02-15 10:46:19,735 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-02-15 10:46:19,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-02-15 10:46:19,736 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:46:19,736 INFO L402 BasicCegarLoop]: trace histogram [30, 29, 1, 1] [2019-02-15 10:46:19,736 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:46:19,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:46:19,736 INFO L82 PathProgramCache]: Analyzing trace with hash -176267942, now seen corresponding path program 29 times [2019-02-15 10:46:19,737 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:46:19,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:19,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:46:19,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:19,738 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:46:19,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:46:20,842 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-15 10:46:20,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:20,842 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:46:20,842 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:46:20,843 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:46:20,843 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:20,843 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-15 10:46:20,850 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:46:20,851 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:46:20,889 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2019-02-15 10:46:20,889 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:46:20,891 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:46:20,915 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-15 10:46:20,916 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:46:20,918 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:46:20,919 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 10:46:22,348 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-15 10:46:22,348 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:46:22,353 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:46:22,353 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 10:46:22,403 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-15 10:46:22,403 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:46:24,871 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-15 10:46:24,889 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:46:24,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 95 [2019-02-15 10:46:24,890 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:46:24,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-02-15 10:46:24,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-02-15 10:46:24,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1192, Invalid=8120, Unknown=0, NotChecked=0, Total=9312 [2019-02-15 10:46:24,891 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 65 states. [2019-02-15 10:46:26,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:46:26,722 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-02-15 10:46:26,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-02-15 10:46:26,722 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 61 [2019-02-15 10:46:26,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:46:26,723 INFO L225 Difference]: With dead ends: 66 [2019-02-15 10:46:26,723 INFO L226 Difference]: Without dead ends: 65 [2019-02-15 10:46:26,724 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2108 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=1192, Invalid=8120, Unknown=0, NotChecked=0, Total=9312 [2019-02-15 10:46:26,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-02-15 10:46:26,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2019-02-15 10:46:26,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-02-15 10:46:26,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-02-15 10:46:26,728 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 61 [2019-02-15 10:46:26,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:46:26,728 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-02-15 10:46:26,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-02-15 10:46:26,728 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-02-15 10:46:26,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-02-15 10:46:26,729 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:46:26,729 INFO L402 BasicCegarLoop]: trace histogram [31, 30, 1, 1] [2019-02-15 10:46:26,729 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:46:26,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:46:26,729 INFO L82 PathProgramCache]: Analyzing trace with hash -1889766628, now seen corresponding path program 30 times [2019-02-15 10:46:26,729 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:46:26,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:26,730 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:46:26,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:26,730 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:46:26,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:46:27,004 WARN L181 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-15 10:46:27,256 WARN L181 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-15 10:46:28,321 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-15 10:46:28,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:28,322 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:46:28,322 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:46:28,322 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:46:28,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:28,322 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-15 10:46:28,332 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:46:28,332 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:46:28,350 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:46:28,350 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:46:28,352 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:46:28,355 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-15 10:46:28,355 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:46:28,365 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:46:28,365 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 10:46:29,936 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-15 10:46:29,936 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:46:29,941 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:46:29,941 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 10:46:29,988 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-15 10:46:29,988 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:46:32,499 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-15 10:46:32,517 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:46:32,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 98 [2019-02-15 10:46:32,517 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:46:32,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-02-15 10:46:32,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-02-15 10:46:32,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1262, Invalid=8638, Unknown=0, NotChecked=0, Total=9900 [2019-02-15 10:46:32,518 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 67 states. [2019-02-15 10:46:34,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:46:34,290 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-02-15 10:46:34,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-02-15 10:46:34,290 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 63 [2019-02-15 10:46:34,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:46:34,291 INFO L225 Difference]: With dead ends: 68 [2019-02-15 10:46:34,291 INFO L226 Difference]: Without dead ends: 67 [2019-02-15 10:46:34,292 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2240 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=1262, Invalid=8638, Unknown=0, NotChecked=0, Total=9900 [2019-02-15 10:46:34,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-02-15 10:46:34,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2019-02-15 10:46:34,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-02-15 10:46:34,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-02-15 10:46:34,297 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 63 [2019-02-15 10:46:34,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:46:34,297 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-02-15 10:46:34,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-02-15 10:46:34,297 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-02-15 10:46:34,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-02-15 10:46:34,298 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:46:34,298 INFO L402 BasicCegarLoop]: trace histogram [32, 31, 1, 1] [2019-02-15 10:46:34,298 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:46:34,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:46:34,299 INFO L82 PathProgramCache]: Analyzing trace with hash 705437790, now seen corresponding path program 31 times [2019-02-15 10:46:34,299 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:46:34,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:34,300 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:46:34,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:34,300 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:46:34,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:46:35,492 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-15 10:46:35,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:35,492 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:46:35,492 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:46:35,492 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:46:35,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:35,492 INFO 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-15 10:46:35,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:46:35,508 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:46:35,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:46:35,528 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:46:35,530 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-15 10:46:35,530 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:46:35,538 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:46:35,538 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 10:46:37,080 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-15 10:46:37,080 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:46:37,085 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:46:37,085 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 10:46:37,131 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-15 10:46:37,131 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:46:39,780 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-15 10:46:39,799 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:46:39,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 101 [2019-02-15 10:46:39,799 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:46:39,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-02-15 10:46:39,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-02-15 10:46:39,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1334, Invalid=9172, Unknown=0, NotChecked=0, Total=10506 [2019-02-15 10:46:39,801 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 69 states. [2019-02-15 10:46:41,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:46:41,696 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-02-15 10:46:41,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-02-15 10:46:41,697 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 65 [2019-02-15 10:46:41,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:46:41,698 INFO L225 Difference]: With dead ends: 70 [2019-02-15 10:46:41,698 INFO L226 Difference]: Without dead ends: 69 [2019-02-15 10:46:41,699 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2376 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=1334, Invalid=9172, Unknown=0, NotChecked=0, Total=10506 [2019-02-15 10:46:41,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-02-15 10:46:41,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2019-02-15 10:46:41,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-02-15 10:46:41,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-02-15 10:46:41,703 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 65 [2019-02-15 10:46:41,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:46:41,703 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-02-15 10:46:41,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-02-15 10:46:41,703 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-02-15 10:46:41,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-02-15 10:46:41,704 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:46:41,704 INFO L402 BasicCegarLoop]: trace histogram [33, 32, 1, 1] [2019-02-15 10:46:41,704 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:46:41,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:46:41,704 INFO L82 PathProgramCache]: Analyzing trace with hash -679115488, now seen corresponding path program 32 times [2019-02-15 10:46:41,704 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:46:41,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:41,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:46:41,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:41,705 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:46:41,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:46:41,903 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-15 10:46:43,028 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-15 10:46:43,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:43,029 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:46:43,029 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:46:43,029 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:46:43,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:43,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 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-15 10:46:43,039 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:46:43,039 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:46:43,081 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2019-02-15 10:46:43,081 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:46:43,084 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:46:43,087 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-15 10:46:43,087 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:46:43,095 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:46:43,095 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 10:46:44,929 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-15 10:46:44,929 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:46:44,937 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:46:44,938 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 10:46:44,990 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-15 10:46:44,990 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:46:47,723 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-15 10:46:47,741 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:46:47,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 104 [2019-02-15 10:46:47,742 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:46:47,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-02-15 10:46:47,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-02-15 10:46:47,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1408, Invalid=9722, Unknown=0, NotChecked=0, Total=11130 [2019-02-15 10:46:47,743 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 71 states. [2019-02-15 10:46:50,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:46:50,447 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-02-15 10:46:50,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-02-15 10:46:50,448 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 67 [2019-02-15 10:46:50,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:46:50,449 INFO L225 Difference]: With dead ends: 72 [2019-02-15 10:46:50,449 INFO L226 Difference]: Without dead ends: 71 [2019-02-15 10:46:50,450 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-15 10:46:50,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-02-15 10:46:50,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2019-02-15 10:46:50,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-02-15 10:46:50,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-02-15 10:46:50,453 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 67 [2019-02-15 10:46:50,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:46:50,453 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-02-15 10:46:50,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-02-15 10:46:50,454 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-02-15 10:46:50,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-02-15 10:46:50,454 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:46:50,454 INFO L402 BasicCegarLoop]: trace histogram [34, 33, 1, 1] [2019-02-15 10:46:50,455 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:46:50,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:46:50,455 INFO L82 PathProgramCache]: Analyzing trace with hash 205046114, now seen corresponding path program 33 times [2019-02-15 10:46:50,455 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:46:50,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:50,456 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:46:50,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:50,456 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:46:50,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:46:50,667 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-15 10:46:51,843 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-15 10:46:51,843 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:51,844 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:46:51,844 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:46:51,844 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:46:51,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:51,844 INFO 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-15 10:46:51,852 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:46:51,852 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:46:51,869 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:46:51,869 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:46:51,871 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:46:51,874 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-15 10:46:51,875 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:46:51,880 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:46:51,880 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 10:46:53,654 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-15 10:46:53,655 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:46:53,659 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:46:53,660 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 10:46:53,712 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-15 10:46:53,712 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:46:56,831 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-15 10:46:56,849 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:46:56,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 107 [2019-02-15 10:46:56,849 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:46:56,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-02-15 10:46:56,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-02-15 10:46:56,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1484, Invalid=10288, Unknown=0, NotChecked=0, Total=11772 [2019-02-15 10:46:56,850 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 73 states. [2019-02-15 10:46:59,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:46:59,033 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-02-15 10:46:59,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-02-15 10:46:59,034 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 69 [2019-02-15 10:46:59,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:46:59,035 INFO L225 Difference]: With dead ends: 74 [2019-02-15 10:46:59,035 INFO L226 Difference]: Without dead ends: 73 [2019-02-15 10:46:59,036 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2660 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=1484, Invalid=10288, Unknown=0, NotChecked=0, Total=11772 [2019-02-15 10:46:59,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-02-15 10:46:59,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2019-02-15 10:46:59,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-02-15 10:46:59,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-02-15 10:46:59,040 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 69 [2019-02-15 10:46:59,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:46:59,040 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-02-15 10:46:59,040 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-02-15 10:46:59,040 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-02-15 10:46:59,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-02-15 10:46:59,041 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:46:59,041 INFO L402 BasicCegarLoop]: trace histogram [35, 34, 1, 1] [2019-02-15 10:46:59,041 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:46:59,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:46:59,041 INFO L82 PathProgramCache]: Analyzing trace with hash -519178972, now seen corresponding path program 34 times [2019-02-15 10:46:59,041 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:46:59,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:59,042 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:46:59,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:59,042 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:46:59,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:47:00,634 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-15 10:47:00,635 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:47:00,635 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:47:00,635 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:47:00,635 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:47:00,635 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:47:00,635 INFO 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-15 10:47:00,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:47:00,643 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:47:00,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:47:00,666 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:47:00,669 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-15 10:47:00,669 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:47:00,675 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:47:00,675 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 10:47:02,416 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-15 10:47:02,417 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:47:02,421 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:47:02,421 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 10:47:02,473 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-15 10:47:02,473 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:47:05,771 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-15 10:47:05,789 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:47:05,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 110 [2019-02-15 10:47:05,789 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:47:05,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-02-15 10:47:05,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-02-15 10:47:05,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1562, Invalid=10870, Unknown=0, NotChecked=0, Total=12432 [2019-02-15 10:47:05,790 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 75 states. [2019-02-15 10:47:08,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:47:08,163 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-02-15 10:47:08,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-02-15 10:47:08,164 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 71 [2019-02-15 10:47:08,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:47:08,165 INFO L225 Difference]: With dead ends: 76 [2019-02-15 10:47:08,165 INFO L226 Difference]: Without dead ends: 75 [2019-02-15 10:47:08,166 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-15 10:47:08,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-02-15 10:47:08,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2019-02-15 10:47:08,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-02-15 10:47:08,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-02-15 10:47:08,169 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 71 [2019-02-15 10:47:08,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:47:08,170 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-02-15 10:47:08,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-02-15 10:47:08,170 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-02-15 10:47:08,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-02-15 10:47:08,170 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:47:08,170 INFO L402 BasicCegarLoop]: trace histogram [36, 35, 1, 1] [2019-02-15 10:47:08,171 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:47:08,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:47:08,171 INFO L82 PathProgramCache]: Analyzing trace with hash -714784666, now seen corresponding path program 35 times [2019-02-15 10:47:08,171 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:47:08,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:47:08,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:47:08,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:47:08,172 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:47:08,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:47:08,363 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-15 10:47:09,876 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-15 10:47:09,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:47:09,876 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:47:09,876 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:47:09,877 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:47:09,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:47:09,877 INFO 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-15 10:47:09,885 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:47:09,885 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:47:10,120 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2019-02-15 10:47:10,120 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:47:10,123 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:47:10,129 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-15 10:47:10,129 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:47:10,136 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:47:10,136 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 10:47:11,998 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-15 10:47:11,999 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:47:12,002 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:47:12,002 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 10:47:12,054 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-15 10:47:12,054 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:47:15,605 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-15 10:47:15,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:47:15,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 113 [2019-02-15 10:47:15,623 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:47:15,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-02-15 10:47:15,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-02-15 10:47:15,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1642, Invalid=11468, Unknown=0, NotChecked=0, Total=13110 [2019-02-15 10:47:15,624 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 77 states. [2019-02-15 10:47:18,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:47:18,466 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-02-15 10:47:18,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-02-15 10:47:18,467 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 73 [2019-02-15 10:47:18,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:47:18,467 INFO L225 Difference]: With dead ends: 78 [2019-02-15 10:47:18,468 INFO L226 Difference]: Without dead ends: 77 [2019-02-15 10:47:18,468 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2960 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=1642, Invalid=11468, Unknown=0, NotChecked=0, Total=13110 [2019-02-15 10:47:18,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-02-15 10:47:18,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2019-02-15 10:47:18,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-02-15 10:47:18,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-02-15 10:47:18,472 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 73 [2019-02-15 10:47:18,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:47:18,473 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-02-15 10:47:18,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-02-15 10:47:18,473 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-02-15 10:47:18,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-02-15 10:47:18,473 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:47:18,473 INFO L402 BasicCegarLoop]: trace histogram [37, 36, 1, 1] [2019-02-15 10:47:18,474 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:47:18,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:47:18,474 INFO L82 PathProgramCache]: Analyzing trace with hash 286704424, now seen corresponding path program 36 times [2019-02-15 10:47:18,474 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:47:18,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:47:18,475 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:47:18,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:47:18,475 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:47:18,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:47:18,743 WARN L181 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-15 10:47:20,410 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-15 10:47:20,410 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:47:20,410 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:47:20,410 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:47:20,411 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:47:20,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:47:20,411 INFO 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-15 10:47:20,419 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:47:20,419 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:47:20,439 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:47:20,439 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:47:20,442 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:47:20,444 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-15 10:47:20,444 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:47:20,455 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:47:20,455 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 10:47:22,412 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-15 10:47:22,412 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:47:22,416 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:47:22,417 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 10:47:22,475 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-15 10:47:22,475 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:47:26,130 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-15 10:47:26,150 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:47:26,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 116 [2019-02-15 10:47:26,150 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:47:26,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-02-15 10:47:26,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-02-15 10:47:26,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1724, Invalid=12082, Unknown=0, NotChecked=0, Total=13806 [2019-02-15 10:47:26,151 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 79 states. [2019-02-15 10:47:28,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:47:28,943 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-02-15 10:47:28,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-02-15 10:47:28,944 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 75 [2019-02-15 10:47:28,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:47:28,945 INFO L225 Difference]: With dead ends: 80 [2019-02-15 10:47:28,945 INFO L226 Difference]: Without dead ends: 79 [2019-02-15 10:47:28,945 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3116 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=1724, Invalid=12082, Unknown=0, NotChecked=0, Total=13806 [2019-02-15 10:47:28,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-02-15 10:47:28,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2019-02-15 10:47:28,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-02-15 10:47:28,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-02-15 10:47:28,949 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 75 [2019-02-15 10:47:28,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:47:28,949 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-02-15 10:47:28,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-02-15 10:47:28,950 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-02-15 10:47:28,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-02-15 10:47:28,950 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:47:28,950 INFO L402 BasicCegarLoop]: trace histogram [38, 37, 1, 1] [2019-02-15 10:47:28,950 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:47:28,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:47:28,951 INFO L82 PathProgramCache]: Analyzing trace with hash 645045610, now seen corresponding path program 37 times [2019-02-15 10:47:28,951 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:47:28,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:47:28,951 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:47:28,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:47:28,952 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:47:28,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:47:30,768 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-15 10:47:30,768 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:47:30,768 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:47:30,769 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:47:30,769 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:47:30,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:47:30,769 INFO 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-15 10:47:30,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:47:30,779 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:47:30,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:47:30,804 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:47:30,819 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-15 10:47:30,819 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:47:30,835 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:47:30,836 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 10:47:32,902 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-15 10:47:32,902 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:47:32,906 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:47:32,907 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 10:47:32,967 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-15 10:47:32,967 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:47:36,877 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-15 10:47:36,895 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:47:36,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 119 [2019-02-15 10:47:36,895 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:47:36,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-02-15 10:47:36,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-02-15 10:47:36,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1808, Invalid=12712, Unknown=0, NotChecked=0, Total=14520 [2019-02-15 10:47:36,896 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 81 states. [2019-02-15 10:47:39,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:47:39,506 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-02-15 10:47:39,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-02-15 10:47:39,507 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 77 [2019-02-15 10:47:39,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:47:39,508 INFO L225 Difference]: With dead ends: 82 [2019-02-15 10:47:39,508 INFO L226 Difference]: Without dead ends: 81 [2019-02-15 10:47:39,509 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3276 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=1808, Invalid=12712, Unknown=0, NotChecked=0, Total=14520 [2019-02-15 10:47:39,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-02-15 10:47:39,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2019-02-15 10:47:39,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-02-15 10:47:39,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-02-15 10:47:39,514 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 77 [2019-02-15 10:47:39,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:47:39,514 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-02-15 10:47:39,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-02-15 10:47:39,514 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-02-15 10:47:39,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-02-15 10:47:39,515 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:47:39,515 INFO L402 BasicCegarLoop]: trace histogram [39, 38, 1, 1] [2019-02-15 10:47:39,515 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:47:39,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:47:39,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1413541676, now seen corresponding path program 38 times [2019-02-15 10:47:39,516 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:47:39,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:47:39,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:47:39,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:47:39,516 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:47:39,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:47:39,778 WARN L181 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-15 10:47:40,040 WARN L181 SmtUtils]: Spent 219.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-15 10:47:41,847 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-15 10:47:41,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:47:41,847 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:47:41,847 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:47:41,847 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:47:41,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:47:41,847 INFO 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-15 10:47:41,856 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:47:41,856 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:47:41,908 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 39 check-sat command(s) [2019-02-15 10:47:41,908 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:47:41,910 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:47:41,929 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-15 10:47:41,930 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:47:41,960 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:47:41,960 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 10:47:44,097 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-15 10:47:44,097 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:47:44,101 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:47:44,102 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 10:47:44,159 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-15 10:47:44,159 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:47:48,008 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-15 10:47:48,026 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:47:48,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 122 [2019-02-15 10:47:48,026 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:47:48,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-02-15 10:47:48,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-02-15 10:47:48,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1894, Invalid=13358, Unknown=0, NotChecked=0, Total=15252 [2019-02-15 10:47:48,027 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 83 states. [2019-02-15 10:47:51,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:47:51,510 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-02-15 10:47:51,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-02-15 10:47:51,511 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 79 [2019-02-15 10:47:51,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:47:51,512 INFO L225 Difference]: With dead ends: 84 [2019-02-15 10:47:51,512 INFO L226 Difference]: Without dead ends: 83 [2019-02-15 10:47:51,513 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3440 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=1894, Invalid=13358, Unknown=0, NotChecked=0, Total=15252 [2019-02-15 10:47:51,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-02-15 10:47:51,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2019-02-15 10:47:51,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-02-15 10:47:51,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-02-15 10:47:51,515 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 79 [2019-02-15 10:47:51,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:47:51,516 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-02-15 10:47:51,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-02-15 10:47:51,516 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-02-15 10:47:51,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-02-15 10:47:51,516 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:47:51,516 INFO L402 BasicCegarLoop]: trace histogram [40, 39, 1, 1] [2019-02-15 10:47:51,516 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:47:51,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:47:51,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1203886190, now seen corresponding path program 39 times [2019-02-15 10:47:51,517 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:47:51,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:47:51,517 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:47:51,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:47:51,517 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:47:51,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:47:51,751 WARN L181 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-15 10:47:53,322 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-15 10:47:53,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:47:53,322 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:47:53,322 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:47:53,322 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:47:53,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:47:53,323 INFO 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-15 10:47:53,331 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:47:53,331 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:47:53,353 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:47:53,354 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:47:53,357 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:47:53,361 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-15 10:47:53,361 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:47:53,369 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:47:53,369 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 10:47:55,678 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-15 10:47:55,679 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:47:55,690 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:47:55,690 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 10:47:55,758 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-15 10:47:55,758 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:47:59,814 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-15 10:47:59,832 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:47:59,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 125 [2019-02-15 10:47:59,833 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:47:59,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-02-15 10:47:59,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-02-15 10:47:59,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1982, Invalid=14020, Unknown=0, NotChecked=0, Total=16002 [2019-02-15 10:47:59,834 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 85 states. [2019-02-15 10:48:02,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:48:02,784 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2019-02-15 10:48:02,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-02-15 10:48:02,785 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 81 [2019-02-15 10:48:02,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:48:02,786 INFO L225 Difference]: With dead ends: 86 [2019-02-15 10:48:02,786 INFO L226 Difference]: Without dead ends: 85 [2019-02-15 10:48:02,787 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3608 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=1982, Invalid=14020, Unknown=0, NotChecked=0, Total=16002 [2019-02-15 10:48:02,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-02-15 10:48:02,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2019-02-15 10:48:02,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-02-15 10:48:02,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2019-02-15 10:48:02,791 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 81 [2019-02-15 10:48:02,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:48:02,792 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2019-02-15 10:48:02,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-02-15 10:48:02,792 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2019-02-15 10:48:02,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-02-15 10:48:02,793 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:48:02,793 INFO L402 BasicCegarLoop]: trace histogram [41, 40, 1, 1] [2019-02-15 10:48:02,793 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:48:02,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:48:02,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1588427056, now seen corresponding path program 40 times [2019-02-15 10:48:02,793 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:48:02,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:48:02,794 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:48:02,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:48:02,794 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:48:02,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:48:03,019 WARN L181 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-15 10:48:04,663 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-15 10:48:04,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:48:04,663 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:48:04,663 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:48:04,664 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:48:04,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:48:04,664 INFO 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-15 10:48:04,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:48:04,672 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:48:04,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:48:04,694 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:48:04,697 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-15 10:48:04,697 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:48:04,705 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:48:04,705 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 10:48:07,361 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-15 10:48:07,361 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:48:07,366 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:48:07,366 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 10:48:07,427 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-15 10:48:07,427 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:48:11,804 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-15 10:48:11,823 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:48:11,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 128 [2019-02-15 10:48:11,823 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:48:11,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-02-15 10:48:11,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-02-15 10:48:11,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2072, Invalid=14698, Unknown=0, NotChecked=0, Total=16770 [2019-02-15 10:48:11,825 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 87 states. [2019-02-15 10:48:15,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:48:15,644 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2019-02-15 10:48:15,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-02-15 10:48:15,645 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 83 [2019-02-15 10:48:15,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:48:15,646 INFO L225 Difference]: With dead ends: 88 [2019-02-15 10:48:15,646 INFO L226 Difference]: Without dead ends: 87 [2019-02-15 10:48:15,647 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3780 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=2072, Invalid=14698, Unknown=0, NotChecked=0, Total=16770 [2019-02-15 10:48:15,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-02-15 10:48:15,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2019-02-15 10:48:15,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-02-15 10:48:15,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2019-02-15 10:48:15,652 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 83 [2019-02-15 10:48:15,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:48:15,652 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2019-02-15 10:48:15,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-02-15 10:48:15,652 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2019-02-15 10:48:15,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-02-15 10:48:15,653 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:48:15,653 INFO L402 BasicCegarLoop]: trace histogram [42, 41, 1, 1] [2019-02-15 10:48:15,653 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:48:15,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:48:15,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1765011826, now seen corresponding path program 41 times [2019-02-15 10:48:15,653 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:48:15,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:48:15,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:48:15,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:48:15,654 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:48:15,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:48:15,910 WARN L181 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-15 10:48:17,773 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-15 10:48:17,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:48:17,773 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:48:17,773 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:48:17,773 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:48:17,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:48:17,773 INFO 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-15 10:48:17,781 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:48:17,781 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:48:17,861 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 42 check-sat command(s) [2019-02-15 10:48:17,861 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:48:17,864 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:48:17,866 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-15 10:48:17,866 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:48:17,873 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:48:17,873 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 10:48:20,451 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-15 10:48:20,451 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:48:20,455 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:48:20,455 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 10:48:20,516 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-15 10:48:20,516 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:48:25,066 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-15 10:48:25,084 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:48:25,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 131 [2019-02-15 10:48:25,084 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:48:25,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-02-15 10:48:25,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-02-15 10:48:25,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2164, Invalid=15392, Unknown=0, NotChecked=0, Total=17556 [2019-02-15 10:48:25,086 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 89 states. [2019-02-15 10:48:29,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:48:29,585 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-02-15 10:48:29,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-02-15 10:48:29,586 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 85 [2019-02-15 10:48:29,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:48:29,587 INFO L225 Difference]: With dead ends: 90 [2019-02-15 10:48:29,587 INFO L226 Difference]: Without dead ends: 89 [2019-02-15 10:48:29,587 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3956 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=2164, Invalid=15392, Unknown=0, NotChecked=0, Total=17556 [2019-02-15 10:48:29,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-02-15 10:48:29,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2019-02-15 10:48:29,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-02-15 10:48:29,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2019-02-15 10:48:29,591 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 85 [2019-02-15 10:48:29,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:48:29,591 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2019-02-15 10:48:29,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-02-15 10:48:29,591 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2019-02-15 10:48:29,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-02-15 10:48:29,592 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:48:29,592 INFO L402 BasicCegarLoop]: trace histogram [43, 42, 1, 1] [2019-02-15 10:48:29,592 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:48:29,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:48:29,592 INFO L82 PathProgramCache]: Analyzing trace with hash -335716044, now seen corresponding path program 42 times [2019-02-15 10:48:29,592 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:48:29,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:48:29,593 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:48:29,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:48:29,593 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:48:29,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:48:31,478 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-15 10:48:31,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:48:31,479 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:48:31,479 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:48:31,479 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:48:31,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:48:31,479 INFO 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-15 10:48:31,487 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:48:31,487 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:48:31,512 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:48:31,512 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:48:31,515 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:48:31,517 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-15 10:48:31,517 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:48:31,525 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:48:31,525 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 10:48:34,186 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-15 10:48:34,187 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:48:34,191 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:48:34,191 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 10:48:34,264 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-15 10:48:34,264 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:48:39,144 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-15 10:48:39,164 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:48:39,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 134 [2019-02-15 10:48:39,164 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:48:39,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-02-15 10:48:39,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-02-15 10:48:39,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2258, Invalid=16102, Unknown=0, NotChecked=0, Total=18360 [2019-02-15 10:48:39,165 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 91 states. [2019-02-15 10:48:43,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:48:43,783 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2019-02-15 10:48:43,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-02-15 10:48:43,784 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 87 [2019-02-15 10:48:43,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:48:43,785 INFO L225 Difference]: With dead ends: 92 [2019-02-15 10:48:43,785 INFO L226 Difference]: Without dead ends: 91 [2019-02-15 10:48:43,786 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4136 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=2258, Invalid=16102, Unknown=0, NotChecked=0, Total=18360 [2019-02-15 10:48:43,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-02-15 10:48:43,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2019-02-15 10:48:43,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-02-15 10:48:43,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2019-02-15 10:48:43,790 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 87 [2019-02-15 10:48:43,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:48:43,791 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2019-02-15 10:48:43,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-02-15 10:48:43,791 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2019-02-15 10:48:43,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-02-15 10:48:43,791 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:48:43,791 INFO L402 BasicCegarLoop]: trace histogram [44, 43, 1, 1] [2019-02-15 10:48:43,792 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:48:43,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:48:43,792 INFO L82 PathProgramCache]: Analyzing trace with hash -500569994, now seen corresponding path program 43 times [2019-02-15 10:48:43,792 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:48:43,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:48:43,793 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:48:43,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:48:43,793 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:48:43,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:48:43,973 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-15 10:48:45,810 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-15 10:48:45,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:48:45,811 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:48:45,811 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:48:45,811 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:48:45,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:48:45,811 INFO 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-15 10:48:45,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:48:45,823 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:48:45,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:48:45,850 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:48:45,852 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-15 10:48:45,852 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:48:45,859 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:48:45,859 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 10:48:48,699 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-15 10:48:48,700 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:48:48,705 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:48:48,706 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 10:48:48,772 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-15 10:48:48,773 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:48:53,843 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-15 10:48:53,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:48:53,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 137 [2019-02-15 10:48:53,874 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:48:53,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-02-15 10:48:53,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-02-15 10:48:53,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2354, Invalid=16828, Unknown=0, NotChecked=0, Total=19182 [2019-02-15 10:48:53,876 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 93 states. [2019-02-15 10:48:57,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:48:57,666 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2019-02-15 10:48:57,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-02-15 10:48:57,666 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 89 [2019-02-15 10:48:57,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:48:57,667 INFO L225 Difference]: With dead ends: 94 [2019-02-15 10:48:57,667 INFO L226 Difference]: Without dead ends: 93 [2019-02-15 10:48:57,668 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4320 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=2354, Invalid=16828, Unknown=0, NotChecked=0, Total=19182 [2019-02-15 10:48:57,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-02-15 10:48:57,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2019-02-15 10:48:57,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-02-15 10:48:57,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2019-02-15 10:48:57,672 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 89 [2019-02-15 10:48:57,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:48:57,673 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2019-02-15 10:48:57,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-02-15 10:48:57,673 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2019-02-15 10:48:57,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-02-15 10:48:57,673 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:48:57,673 INFO L402 BasicCegarLoop]: trace histogram [45, 44, 1, 1] [2019-02-15 10:48:57,673 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:48:57,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:48:57,674 INFO L82 PathProgramCache]: Analyzing trace with hash -11425992, now seen corresponding path program 44 times [2019-02-15 10:48:57,674 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:48:57,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:48:57,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:48:57,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:48:57,675 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:48:57,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:48:57,913 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-15 10:48:59,815 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-15 10:48:59,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:48:59,815 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:48:59,815 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:48:59,816 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:48:59,816 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:48:59,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 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-15 10:48:59,825 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:48:59,825 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:48:59,887 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 45 check-sat command(s) [2019-02-15 10:48:59,888 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:48:59,890 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:48:59,897 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-15 10:48:59,898 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:48:59,906 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:48:59,906 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 10:49:03,386 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-15 10:49:03,386 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:03,390 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:03,391 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 10:49:03,458 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-15 10:49:03,458 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:49:08,582 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-15 10:49:08,601 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:49:08,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 140 [2019-02-15 10:49:08,602 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:49:08,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-02-15 10:49:08,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-02-15 10:49:08,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2452, Invalid=17570, Unknown=0, NotChecked=0, Total=20022 [2019-02-15 10:49:08,603 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 95 states. [2019-02-15 10:49:12,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:49:12,751 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2019-02-15 10:49:12,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-02-15 10:49:12,751 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 91 [2019-02-15 10:49:12,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:49:12,752 INFO L225 Difference]: With dead ends: 96 [2019-02-15 10:49:12,752 INFO L226 Difference]: Without dead ends: 95 [2019-02-15 10:49:12,752 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4508 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=2452, Invalid=17570, Unknown=0, NotChecked=0, Total=20022 [2019-02-15 10:49:12,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-02-15 10:49:12,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2019-02-15 10:49:12,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-02-15 10:49:12,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2019-02-15 10:49:12,755 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 91 [2019-02-15 10:49:12,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:49:12,756 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2019-02-15 10:49:12,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-02-15 10:49:12,756 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2019-02-15 10:49:12,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-02-15 10:49:12,756 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:49:12,756 INFO L402 BasicCegarLoop]: trace histogram [46, 45, 1, 1] [2019-02-15 10:49:12,756 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:49:12,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:49:12,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1904524666, now seen corresponding path program 45 times [2019-02-15 10:49:12,757 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:49:12,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:12,758 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:49:12,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:12,758 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:49:12,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:13,014 WARN L181 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-15 10:49:15,037 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-15 10:49:15,037 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:15,037 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:49:15,037 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:49:15,038 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:49:15,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:15,038 INFO 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-15 10:49:15,048 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:49:15,048 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:49:15,097 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:49:15,097 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:49:15,101 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:49:15,110 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-15 10:49:15,110 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:15,116 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:15,116 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 10:49:18,329 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-15 10:49:18,329 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:18,333 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:18,333 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 10:49:18,410 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-15 10:49:18,410 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:49:23,786 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-15 10:49:23,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:49:23,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 143 [2019-02-15 10:49:23,805 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:49:23,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-02-15 10:49:23,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-02-15 10:49:23,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2552, Invalid=18328, Unknown=0, NotChecked=0, Total=20880 [2019-02-15 10:49:23,806 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 97 states. [2019-02-15 10:49:28,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:49:28,267 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2019-02-15 10:49:28,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-02-15 10:49:28,267 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 93 [2019-02-15 10:49:28,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:49:28,268 INFO L225 Difference]: With dead ends: 98 [2019-02-15 10:49:28,268 INFO L226 Difference]: Without dead ends: 97 [2019-02-15 10:49:28,269 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4700 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=2552, Invalid=18328, Unknown=0, NotChecked=0, Total=20880 [2019-02-15 10:49:28,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-02-15 10:49:28,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2019-02-15 10:49:28,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-02-15 10:49:28,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2019-02-15 10:49:28,273 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 93 [2019-02-15 10:49:28,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:49:28,273 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2019-02-15 10:49:28,273 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-02-15 10:49:28,273 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2019-02-15 10:49:28,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-02-15 10:49:28,274 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:49:28,274 INFO L402 BasicCegarLoop]: trace histogram [47, 46, 1, 1] [2019-02-15 10:49:28,274 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:49:28,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:49:28,274 INFO L82 PathProgramCache]: Analyzing trace with hash 592137020, now seen corresponding path program 46 times [2019-02-15 10:49:28,274 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:49:28,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:28,275 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:49:28,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:28,275 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:49:28,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:28,498 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-15 10:49:28,730 WARN L181 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-02-15 10:49:28,969 WARN L181 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-15 10:49:31,101 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-15 10:49:31,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:31,101 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:49:31,101 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:49:31,102 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:49:31,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:31,102 INFO 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-15 10:49:31,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:49:31,111 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:49:31,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:31,141 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:49:31,143 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-15 10:49:31,143 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:31,153 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:31,153 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 10:49:34,400 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-15 10:49:34,401 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:34,404 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:34,405 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 10:49:34,485 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-15 10:49:34,486 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:49:40,092 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-15 10:49:40,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:49:40,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 146 [2019-02-15 10:49:40,110 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:49:40,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-02-15 10:49:40,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-02-15 10:49:40,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2654, Invalid=19102, Unknown=0, NotChecked=0, Total=21756 [2019-02-15 10:49:40,111 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 99 states. [2019-02-15 10:49:44,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:49:44,289 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2019-02-15 10:49:44,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-02-15 10:49:44,290 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 95 [2019-02-15 10:49:44,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:49:44,291 INFO L225 Difference]: With dead ends: 100 [2019-02-15 10:49:44,291 INFO L226 Difference]: Without dead ends: 99 [2019-02-15 10:49:44,291 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4896 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=2654, Invalid=19102, Unknown=0, NotChecked=0, Total=21756 [2019-02-15 10:49:44,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-02-15 10:49:44,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2019-02-15 10:49:44,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-02-15 10:49:44,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2019-02-15 10:49:44,295 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 95 [2019-02-15 10:49:44,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:49:44,295 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2019-02-15 10:49:44,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-02-15 10:49:44,295 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2019-02-15 10:49:44,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-02-15 10:49:44,295 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:49:44,295 INFO L402 BasicCegarLoop]: trace histogram [48, 47, 1, 1] [2019-02-15 10:49:44,296 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:49:44,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:49:44,296 INFO L82 PathProgramCache]: Analyzing trace with hash 2107994238, now seen corresponding path program 47 times [2019-02-15 10:49:44,296 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:49:44,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:44,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:49:44,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:44,297 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:49:44,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:46,457 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-15 10:49:46,457 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:46,457 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:49:46,458 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:49:46,458 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:49:46,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:46,458 INFO 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-15 10:49:46,466 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:49:46,466 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:49:46,536 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 48 check-sat command(s) [2019-02-15 10:49:46,537 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:49:46,540 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:49:46,556 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-15 10:49:46,557 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:46,622 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:46,623 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 10:49:50,584 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-15 10:49:50,584 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:50,590 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:50,590 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 10:49:50,664 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-15 10:49:50,664 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:49:56,553 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-15 10:49:56,571 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:49:56,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 149 [2019-02-15 10:49:56,572 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:49:56,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-02-15 10:49:56,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-02-15 10:49:56,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2758, Invalid=19892, Unknown=0, NotChecked=0, Total=22650 [2019-02-15 10:49:56,573 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 101 states. [2019-02-15 10:50:00,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:50:00,767 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2019-02-15 10:50:00,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-02-15 10:50:00,767 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 97 [2019-02-15 10:50:00,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:50:00,768 INFO L225 Difference]: With dead ends: 102 [2019-02-15 10:50:00,768 INFO L226 Difference]: Without dead ends: 101 [2019-02-15 10:50:00,770 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5096 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=2758, Invalid=19892, Unknown=0, NotChecked=0, Total=22650 [2019-02-15 10:50:00,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-02-15 10:50:00,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2019-02-15 10:50:00,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-02-15 10:50:00,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2019-02-15 10:50:00,774 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 97 [2019-02-15 10:50:00,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:50:00,774 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2019-02-15 10:50:00,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-02-15 10:50:00,775 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2019-02-15 10:50:00,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-02-15 10:50:00,775 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:50:00,775 INFO L402 BasicCegarLoop]: trace histogram [49, 48, 1, 1] [2019-02-15 10:50:00,776 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:50:00,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:50:00,776 INFO L82 PathProgramCache]: Analyzing trace with hash -1442099904, now seen corresponding path program 48 times [2019-02-15 10:50:00,776 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:50:00,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:50:00,776 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:50:00,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:50:00,777 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:50:00,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:50:01,049 WARN L181 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-15 10:50:01,267 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-02-15 10:50:01,421 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-15 10:50:03,550 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-15 10:50:03,551 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:50:03,551 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:50:03,551 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:50:03,551 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:50:03,551 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:50:03,551 INFO 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-15 10:50:03,561 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:50:03,562 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:50:03,589 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:50:03,589 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:50:03,592 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:50:03,594 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-15 10:50:03,594 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:03,602 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:03,602 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 10:50:07,139 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-15 10:50:07,140 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:07,145 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:07,146 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 10:50:07,229 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-15 10:50:07,229 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:50:13,316 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-15 10:50:13,334 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:50:13,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 152 [2019-02-15 10:50:13,335 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:50:13,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-02-15 10:50:13,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-02-15 10:50:13,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2864, Invalid=20698, Unknown=0, NotChecked=0, Total=23562 [2019-02-15 10:50:13,337 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 103 states. [2019-02-15 10:50:17,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:50:17,635 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2019-02-15 10:50:17,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-02-15 10:50:17,635 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 99 [2019-02-15 10:50:17,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:50:17,636 INFO L225 Difference]: With dead ends: 104 [2019-02-15 10:50:17,636 INFO L226 Difference]: Without dead ends: 103 [2019-02-15 10:50:17,638 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-15 10:50:17,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-02-15 10:50:17,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2019-02-15 10:50:17,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-02-15 10:50:17,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2019-02-15 10:50:17,643 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 99 [2019-02-15 10:50:17,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:50:17,643 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2019-02-15 10:50:17,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-02-15 10:50:17,643 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2019-02-15 10:50:17,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-02-15 10:50:17,644 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:50:17,644 INFO L402 BasicCegarLoop]: trace histogram [50, 49, 1, 1] [2019-02-15 10:50:17,644 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:50:17,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:50:17,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1416429954, now seen corresponding path program 49 times [2019-02-15 10:50:17,645 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:50:17,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:50:17,646 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:50:17,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:50:17,646 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:50:17,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:50:20,038 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-15 10:50:20,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:50:20,038 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:50:20,038 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:50:20,038 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:50:20,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:50:20,038 INFO 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-15 10:50:20,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:50:20,046 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:50:20,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:50:20,078 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:50:20,093 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-15 10:50:20,093 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:20,105 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:20,105 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 10:50:23,535 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-15 10:50:23,536 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:23,539 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:23,539 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 10:50:23,624 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-15 10:50:23,624 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:50:30,196 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-15 10:50:30,216 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:50:30,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 155 [2019-02-15 10:50:30,216 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:50:30,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-02-15 10:50:30,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-02-15 10:50:30,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2972, Invalid=21520, Unknown=0, NotChecked=0, Total=24492 [2019-02-15 10:50:30,218 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 105 states. [2019-02-15 10:50:34,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:50:34,877 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2019-02-15 10:50:34,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-02-15 10:50:34,877 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 101 [2019-02-15 10:50:34,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:50:34,879 INFO L225 Difference]: With dead ends: 106 [2019-02-15 10:50:34,879 INFO L226 Difference]: Without dead ends: 105 [2019-02-15 10:50:34,880 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5508 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=2972, Invalid=21520, Unknown=0, NotChecked=0, Total=24492 [2019-02-15 10:50:34,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-02-15 10:50:34,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2019-02-15 10:50:34,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-02-15 10:50:34,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2019-02-15 10:50:34,886 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 101 [2019-02-15 10:50:34,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:50:34,886 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2019-02-15 10:50:34,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-02-15 10:50:34,886 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2019-02-15 10:50:34,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-02-15 10:50:34,887 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:50:34,887 INFO L402 BasicCegarLoop]: trace histogram [51, 50, 1, 1] [2019-02-15 10:50:34,887 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:50:34,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:50:34,887 INFO L82 PathProgramCache]: Analyzing trace with hash -315445948, now seen corresponding path program 50 times [2019-02-15 10:50:34,888 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:50:34,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:50:34,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:50:34,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:50:34,889 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:50:34,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:50:35,177 WARN L181 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-15 10:50:35,432 WARN L181 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-15 10:50:35,723 WARN L181 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-15 10:50:36,033 WARN L181 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-15 10:50:38,425 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-15 10:50:38,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:50:38,425 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:50:38,426 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:50:38,426 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:50:38,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:50:38,426 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-15 10:50:38,437 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:50:38,437 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:50:38,540 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2019-02-15 10:50:38,540 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:50:38,543 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:50:38,556 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-15 10:50:38,557 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:38,563 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:38,563 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 10:50:42,314 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-15 10:50:42,314 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:42,318 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:42,318 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 10:50:42,403 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-15 10:50:42,403 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:50:48,985 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-15 10:50:49,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:50:49,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 158 [2019-02-15 10:50:49,004 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:50:49,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-02-15 10:50:49,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-02-15 10:50:49,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3082, Invalid=22358, Unknown=0, NotChecked=0, Total=25440 [2019-02-15 10:50:49,005 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 107 states. [2019-02-15 10:50:54,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:50:54,560 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2019-02-15 10:50:54,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-02-15 10:50:54,561 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 103 [2019-02-15 10:50:54,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:50:54,562 INFO L225 Difference]: With dead ends: 108 [2019-02-15 10:50:54,562 INFO L226 Difference]: Without dead ends: 107 [2019-02-15 10:50:54,563 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5720 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=3082, Invalid=22358, Unknown=0, NotChecked=0, Total=25440 [2019-02-15 10:50:54,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-02-15 10:50:54,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2019-02-15 10:50:54,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-02-15 10:50:54,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2019-02-15 10:50:54,569 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 103 [2019-02-15 10:50:54,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:50:54,569 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2019-02-15 10:50:54,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-02-15 10:50:54,569 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2019-02-15 10:50:54,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-02-15 10:50:54,570 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:50:54,570 INFO L402 BasicCegarLoop]: trace histogram [52, 51, 1, 1] [2019-02-15 10:50:54,570 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:50:54,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:50:54,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1799123078, now seen corresponding path program 51 times [2019-02-15 10:50:54,571 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:50:54,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:50:54,571 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:50:54,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:50:54,571 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:50:54,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:50:57,290 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-15 10:50:57,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:50:57,290 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:50:57,290 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:50:57,290 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:50:57,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:50:57,290 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-15 10:50:57,299 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:50:57,299 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:50:57,328 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:50:57,328 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:50:57,331 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:50:57,333 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-15 10:50:57,333 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:57,339 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:57,339 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 10:51:01,254 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-15 10:51:01,254 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:01,258 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:01,259 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 10:51:01,343 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-15 10:51:01,343 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:51:08,252 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-15 10:51:08,272 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:51:08,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 161 [2019-02-15 10:51:08,272 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:51:08,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 109 states [2019-02-15 10:51:08,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2019-02-15 10:51:08,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3194, Invalid=23212, Unknown=0, NotChecked=0, Total=26406 [2019-02-15 10:51:08,274 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 109 states. [2019-02-15 10:51:15,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:51:15,058 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2019-02-15 10:51:15,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-02-15 10:51:15,059 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 105 [2019-02-15 10:51:15,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:51:15,060 INFO L225 Difference]: With dead ends: 110 [2019-02-15 10:51:15,060 INFO L226 Difference]: Without dead ends: 109 [2019-02-15 10:51:15,061 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5936 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=3194, Invalid=23212, Unknown=0, NotChecked=0, Total=26406 [2019-02-15 10:51:15,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-02-15 10:51:15,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2019-02-15 10:51:15,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-02-15 10:51:15,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2019-02-15 10:51:15,066 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 105 [2019-02-15 10:51:15,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:51:15,066 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2019-02-15 10:51:15,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 109 states. [2019-02-15 10:51:15,067 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2019-02-15 10:51:15,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-02-15 10:51:15,067 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:51:15,067 INFO L402 BasicCegarLoop]: trace histogram [53, 52, 1, 1] [2019-02-15 10:51:15,067 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:51:15,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:51:15,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1914541240, now seen corresponding path program 52 times [2019-02-15 10:51:15,068 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:51:15,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:15,068 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:51:15,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:15,068 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:51:15,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:51:15,302 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-15 10:51:17,865 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-15 10:51:17,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:17,865 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:51:17,865 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:51:17,865 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:51:17,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:17,866 INFO 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-15 10:51:17,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:51:17,874 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:51:17,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:51:17,917 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:51:17,926 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-15 10:51:17,926 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:17,999 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:17,999 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 10:51:22,248 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-15 10:51:22,248 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:22,254 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:22,254 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 10:51:22,339 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-15 10:51:22,339 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:51:29,631 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-15 10:51:29,649 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:51:29,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 164 [2019-02-15 10:51:29,649 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:51:29,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-02-15 10:51:29,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-02-15 10:51:29,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3308, Invalid=24082, Unknown=0, NotChecked=0, Total=27390 [2019-02-15 10:51:29,651 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 111 states. [2019-02-15 10:51:34,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:51:34,389 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2019-02-15 10:51:34,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-02-15 10:51:34,390 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 107 [2019-02-15 10:51:34,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:51:34,391 INFO L225 Difference]: With dead ends: 112 [2019-02-15 10:51:34,391 INFO L226 Difference]: Without dead ends: 111 [2019-02-15 10:51:34,392 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6156 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=3308, Invalid=24082, Unknown=0, NotChecked=0, Total=27390 [2019-02-15 10:51:34,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-02-15 10:51:34,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2019-02-15 10:51:34,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-02-15 10:51:34,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2019-02-15 10:51:34,403 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 107 [2019-02-15 10:51:34,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:51:34,404 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2019-02-15 10:51:34,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-02-15 10:51:34,404 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2019-02-15 10:51:34,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-02-15 10:51:34,404 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:51:34,404 INFO L402 BasicCegarLoop]: trace histogram [54, 53, 1, 1] [2019-02-15 10:51:34,404 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:51:34,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:51:34,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1628127862, now seen corresponding path program 53 times [2019-02-15 10:51:34,405 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:51:34,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:34,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:51:34,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:34,405 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:51:34,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:51:34,698 WARN L181 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-15 10:51:34,949 WARN L181 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-15 10:51:35,244 WARN L181 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-15 10:51:35,524 WARN L181 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-15 10:51:38,300 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-15 10:51:38,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:38,300 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:51:38,301 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:51:38,301 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:51:38,301 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:38,301 INFO 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-15 10:51:38,429 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:51:38,429 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:51:38,516 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 54 check-sat command(s) [2019-02-15 10:51:38,516 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:51:38,519 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:51:38,522 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-15 10:51:38,522 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:38,529 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:38,529 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 10:51:42,703 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-15 10:51:42,703 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:42,708 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:42,708 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 10:51:42,796 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-15 10:51:42,796 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:51:50,009 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-15 10:51:50,028 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:51:50,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 167 [2019-02-15 10:51:50,028 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:51:50,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-02-15 10:51:50,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-02-15 10:51:50,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3424, Invalid=24968, Unknown=0, NotChecked=0, Total=28392 [2019-02-15 10:51:50,029 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 113 states. [2019-02-15 10:51:56,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:51:56,586 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2019-02-15 10:51:56,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-02-15 10:51:56,586 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 109 [2019-02-15 10:51:56,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:51:56,587 INFO L225 Difference]: With dead ends: 114 [2019-02-15 10:51:56,588 INFO L226 Difference]: Without dead ends: 113 [2019-02-15 10:51:56,589 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 104 SyntacticMatches, 1 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6380 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=3424, Invalid=24968, Unknown=0, NotChecked=0, Total=28392 [2019-02-15 10:51:56,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-02-15 10:51:56,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2019-02-15 10:51:56,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-02-15 10:51:56,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2019-02-15 10:51:56,594 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 109 [2019-02-15 10:51:56,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:51:56,594 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2019-02-15 10:51:56,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-02-15 10:51:56,594 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2019-02-15 10:51:56,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-02-15 10:51:56,595 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:51:56,595 INFO L402 BasicCegarLoop]: trace histogram [55, 54, 1, 1] [2019-02-15 10:51:56,595 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:51:56,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:51:56,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1262778548, now seen corresponding path program 54 times [2019-02-15 10:51:56,596 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:51:56,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:56,596 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:51:56,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:56,597 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:51:56,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:51:56,866 WARN L181 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-15 10:51:59,490 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-15 10:51:59,490 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:59,490 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:51:59,490 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:51:59,491 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:51:59,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:59,491 INFO 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-15 10:51:59,500 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:51:59,501 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:51:59,532 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:51:59,532 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:51:59,536 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:51:59,537 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-15 10:51:59,537 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:59,543 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:59,543 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 10:52:03,947 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-15 10:52:03,947 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:52:03,951 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:03,951 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 10:52:04,039 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-15 10:52:04,039 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:52:11,629 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-15 10:52:11,648 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:52:11,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 170 [2019-02-15 10:52:11,648 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:52:11,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 115 states [2019-02-15 10:52:11,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2019-02-15 10:52:11,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3542, Invalid=25870, Unknown=0, NotChecked=0, Total=29412 [2019-02-15 10:52:11,650 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 115 states. [2019-02-15 10:52:17,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:52:17,120 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2019-02-15 10:52:17,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-02-15 10:52:17,120 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 111 [2019-02-15 10:52:17,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:52:17,121 INFO L225 Difference]: With dead ends: 116 [2019-02-15 10:52:17,122 INFO L226 Difference]: Without dead ends: 115 [2019-02-15 10:52:17,123 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-15 10:52:17,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-02-15 10:52:17,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2019-02-15 10:52:17,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-02-15 10:52:17,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2019-02-15 10:52:17,128 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 111 [2019-02-15 10:52:17,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:52:17,128 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2019-02-15 10:52:17,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 115 states. [2019-02-15 10:52:17,128 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2019-02-15 10:52:17,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-02-15 10:52:17,129 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:52:17,129 INFO L402 BasicCegarLoop]: trace histogram [56, 55, 1, 1] [2019-02-15 10:52:17,129 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:52:17,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:52:17,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1945561230, now seen corresponding path program 55 times [2019-02-15 10:52:17,129 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:52:17,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:52:17,130 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:52:17,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:52:17,130 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:52:17,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:52:19,894 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-15 10:52:19,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:52:19,895 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:52:19,895 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:52:19,895 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:52:19,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:52:19,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 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-15 10:52:19,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:52:19,905 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:52:19,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:52:19,940 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:52:19,943 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-15 10:52:19,943 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:52:19,949 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:19,949 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 10:52:24,377 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-15 10:52:24,377 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:52:24,382 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:24,382 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 10:52:24,470 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-15 10:52:24,470 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:52:32,555 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-15 10:52:32,573 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:52:32,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 173 [2019-02-15 10:52:32,574 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:52:32,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 117 states [2019-02-15 10:52:32,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2019-02-15 10:52:32,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3662, Invalid=26788, Unknown=0, NotChecked=0, Total=30450 [2019-02-15 10:52:32,575 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand 117 states. [2019-02-15 10:52:39,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:52:39,884 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2019-02-15 10:52:39,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-02-15 10:52:39,885 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 113 [2019-02-15 10:52:39,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:52:39,886 INFO L225 Difference]: With dead ends: 118 [2019-02-15 10:52:39,886 INFO L226 Difference]: Without dead ends: 117 [2019-02-15 10:52:39,887 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 108 SyntacticMatches, 1 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6840 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=3662, Invalid=26788, Unknown=0, NotChecked=0, Total=30450 [2019-02-15 10:52:39,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-02-15 10:52:39,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 116. [2019-02-15 10:52:39,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-02-15 10:52:39,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2019-02-15 10:52:39,893 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 113 [2019-02-15 10:52:39,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:52:39,893 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2019-02-15 10:52:39,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 117 states. [2019-02-15 10:52:39,893 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2019-02-15 10:52:39,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-02-15 10:52:39,894 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:52:39,894 INFO L402 BasicCegarLoop]: trace histogram [57, 56, 1, 1] [2019-02-15 10:52:39,894 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:52:39,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:52:39,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1373569360, now seen corresponding path program 56 times [2019-02-15 10:52:39,895 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:52:39,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:52:39,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:52:39,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:52:39,896 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:52:39,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:52:40,192 WARN L181 SmtUtils]: Spent 219.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-15 10:52:40,459 WARN L181 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-15 10:52:40,733 WARN L181 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-15 10:52:41,045 WARN L181 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-15 10:52:44,074 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-15 10:52:44,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:52:44,074 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:52:44,074 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:52:44,074 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:52:44,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:52:44,075 INFO 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-15 10:52:44,084 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:52:44,084 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:52:44,175 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 57 check-sat command(s) [2019-02-15 10:52:44,175 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:52:44,179 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:52:44,198 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-15 10:52:44,199 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:52:44,266 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:44,267 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 10:52:48,732 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-15 10:52:48,733 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:52:48,736 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:48,736 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 10:52:48,829 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-15 10:52:48,829 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:52:56,897 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-15 10:52:56,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:52:56,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 176 [2019-02-15 10:52:56,916 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:52:56,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 119 states [2019-02-15 10:52:56,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2019-02-15 10:52:56,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3784, Invalid=27722, Unknown=0, NotChecked=0, Total=31506 [2019-02-15 10:52:56,917 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 119 states. [2019-02-15 10:53:03,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:53:03,217 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2019-02-15 10:53:03,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-02-15 10:53:03,217 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 115 [2019-02-15 10:53:03,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:53:03,218 INFO L225 Difference]: With dead ends: 120 [2019-02-15 10:53:03,218 INFO L226 Difference]: Without dead ends: 119 [2019-02-15 10:53:03,219 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 110 SyntacticMatches, 1 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7076 ImplicationChecksByTransitivity, 16.5s TimeCoverageRelationStatistics Valid=3784, Invalid=27722, Unknown=0, NotChecked=0, Total=31506 [2019-02-15 10:53:03,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-02-15 10:53:03,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2019-02-15 10:53:03,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-02-15 10:53:03,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 118 transitions. [2019-02-15 10:53:03,223 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 118 transitions. Word has length 115 [2019-02-15 10:53:03,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:53:03,224 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 118 transitions. [2019-02-15 10:53:03,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 119 states. [2019-02-15 10:53:03,224 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2019-02-15 10:53:03,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-02-15 10:53:03,224 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:53:03,224 INFO L402 BasicCegarLoop]: trace histogram [58, 57, 1, 1] [2019-02-15 10:53:03,224 INFO L423 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:53:03,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:53:03,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1445196178, now seen corresponding path program 57 times [2019-02-15 10:53:03,225 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:53:03,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:03,225 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:53:03,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:03,226 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:53:03,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:53:03,507 WARN L181 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-15 10:53:03,757 WARN L181 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-15 10:53:04,045 WARN L181 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-15 10:53:07,080 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-15 10:53:07,080 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:07,081 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:53:07,081 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:53:07,081 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:53:07,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:07,081 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-15 10:53:07,089 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:53:07,089 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:53:07,123 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:53:07,123 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:53:07,127 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:53:07,145 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-15 10:53:07,146 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:07,213 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:07,214 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 10:53:12,354 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-15 10:53:12,355 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:12,360 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:12,360 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 10:53:12,451 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-15 10:53:12,452 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:53:20,931 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-15 10:53:20,950 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:53:20,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 179 [2019-02-15 10:53:20,950 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:53:20,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 121 states [2019-02-15 10:53:20,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2019-02-15 10:53:20,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3908, Invalid=28672, Unknown=0, NotChecked=0, Total=32580 [2019-02-15 10:53:20,952 INFO L87 Difference]: Start difference. First operand 118 states and 118 transitions. Second operand 121 states. [2019-02-15 10:53:26,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:53:26,316 INFO L93 Difference]: Finished difference Result 122 states and 122 transitions. [2019-02-15 10:53:26,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-02-15 10:53:26,316 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 117 [2019-02-15 10:53:26,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:53:26,317 INFO L225 Difference]: With dead ends: 122 [2019-02-15 10:53:26,317 INFO L226 Difference]: Without dead ends: 121 [2019-02-15 10:53:26,318 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 112 SyntacticMatches, 1 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7316 ImplicationChecksByTransitivity, 17.3s TimeCoverageRelationStatistics Valid=3908, Invalid=28672, Unknown=0, NotChecked=0, Total=32580 [2019-02-15 10:53:26,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-02-15 10:53:26,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2019-02-15 10:53:26,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-02-15 10:53:26,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 120 transitions. [2019-02-15 10:53:26,322 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 120 transitions. Word has length 117 [2019-02-15 10:53:26,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:53:26,323 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 120 transitions. [2019-02-15 10:53:26,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 121 states. [2019-02-15 10:53:26,323 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 120 transitions. [2019-02-15 10:53:26,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-02-15 10:53:26,323 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:53:26,323 INFO L402 BasicCegarLoop]: trace histogram [59, 58, 1, 1] [2019-02-15 10:53:26,323 INFO L423 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:53:26,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:53:26,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1559091540, now seen corresponding path program 58 times [2019-02-15 10:53:26,324 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:53:26,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:26,324 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:53:26,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:26,324 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:53:26,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:53:26,512 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-15 10:53:29,607 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-15 10:53:29,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:29,607 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:53:29,607 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:53:29,607 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:53:29,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:29,608 INFO 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-15 10:53:29,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:53:29,618 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:53:29,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:53:29,654 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:53:29,660 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-15 10:53:29,660 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:29,670 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:29,670 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 10:53:34,556 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-15 10:53:34,556 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:34,562 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:34,563 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 10:53:34,659 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-15 10:53:34,659 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:53:43,145 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-15 10:53:43,164 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:53:43,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 182 [2019-02-15 10:53:43,165 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:53:43,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 123 states [2019-02-15 10:53:43,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2019-02-15 10:53:43,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4034, Invalid=29638, Unknown=0, NotChecked=0, Total=33672 [2019-02-15 10:53:43,166 INFO L87 Difference]: Start difference. First operand 120 states and 120 transitions. Second operand 123 states. [2019-02-15 10:53:50,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:53:50,460 INFO L93 Difference]: Finished difference Result 124 states and 124 transitions. [2019-02-15 10:53:50,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-02-15 10:53:50,466 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 119 [2019-02-15 10:53:50,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:53:50,467 INFO L225 Difference]: With dead ends: 124 [2019-02-15 10:53:50,467 INFO L226 Difference]: Without dead ends: 123 [2019-02-15 10:53:50,468 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 114 SyntacticMatches, 1 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7560 ImplicationChecksByTransitivity, 16.4s TimeCoverageRelationStatistics Valid=4034, Invalid=29638, Unknown=0, NotChecked=0, Total=33672 [2019-02-15 10:53:50,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-02-15 10:53:50,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2019-02-15 10:53:50,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-02-15 10:53:50,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 122 transitions. [2019-02-15 10:53:50,472 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 122 transitions. Word has length 119 [2019-02-15 10:53:50,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:53:50,473 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 122 transitions. [2019-02-15 10:53:50,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has 123 states. [2019-02-15 10:53:50,473 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 122 transitions. [2019-02-15 10:53:50,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-02-15 10:53:50,474 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:53:50,474 INFO L402 BasicCegarLoop]: trace histogram [60, 59, 1, 1] [2019-02-15 10:53:50,474 INFO L423 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:53:50,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:53:50,474 INFO L82 PathProgramCache]: Analyzing trace with hash -656615274, now seen corresponding path program 59 times [2019-02-15 10:53:50,474 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:53:50,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:50,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:53:50,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:50,475 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:53:50,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:53:53,554 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-15 10:53:53,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:53,554 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:53:53,554 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:53:53,554 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:53:53,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:53,554 INFO 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-15 10:53:53,563 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:53:53,563 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:53:53,666 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 60 check-sat command(s) [2019-02-15 10:53:53,666 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:53:53,670 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:53:53,674 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-15 10:53:53,674 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:53,683 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:53,683 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 10:53:58,769 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-15 10:53:58,770 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:58,776 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:58,777 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 10:53:58,878 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-15 10:53:58,878 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:54:07,919 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-15 10:54:07,938 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:54:07,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 185 [2019-02-15 10:54:07,938 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:54:07,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 125 states [2019-02-15 10:54:07,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2019-02-15 10:54:07,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4162, Invalid=30620, Unknown=0, NotChecked=0, Total=34782 [2019-02-15 10:54:07,940 INFO L87 Difference]: Start difference. First operand 122 states and 122 transitions. Second operand 125 states. [2019-02-15 10:54:16,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:54:16,913 INFO L93 Difference]: Finished difference Result 126 states and 126 transitions. [2019-02-15 10:54:16,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-02-15 10:54:16,913 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 121 [2019-02-15 10:54:16,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:54:16,914 INFO L225 Difference]: With dead ends: 126 [2019-02-15 10:54:16,914 INFO L226 Difference]: Without dead ends: 125 [2019-02-15 10:54:16,915 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 116 SyntacticMatches, 1 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7808 ImplicationChecksByTransitivity, 17.0s TimeCoverageRelationStatistics Valid=4162, Invalid=30620, Unknown=0, NotChecked=0, Total=34782 [2019-02-15 10:54:16,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-02-15 10:54:16,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2019-02-15 10:54:16,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-02-15 10:54:16,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 124 transitions. [2019-02-15 10:54:16,921 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 124 transitions. Word has length 121 [2019-02-15 10:54:16,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:54:16,921 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 124 transitions. [2019-02-15 10:54:16,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 125 states. [2019-02-15 10:54:16,921 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 124 transitions. [2019-02-15 10:54:16,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-02-15 10:54:16,922 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:54:16,922 INFO L402 BasicCegarLoop]: trace histogram [61, 60, 1, 1] [2019-02-15 10:54:16,922 INFO L423 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:54:16,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:54:16,922 INFO L82 PathProgramCache]: Analyzing trace with hash 352915288, now seen corresponding path program 60 times [2019-02-15 10:54:16,922 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:54:16,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:54:16,923 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:54:16,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:54:16,923 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:54:16,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:54:20,358 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-15 10:54:20,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:54:20,358 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:54:20,358 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:54:20,359 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:54:20,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:54:20,359 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-15 10:54:20,368 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:54:20,368 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:54:20,409 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:54:20,409 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:54:20,413 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:54:20,415 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-15 10:54:20,415 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:20,423 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:20,423 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 10:54:25,620 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-15 10:54:25,621 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:25,625 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:25,625 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 10:54:25,721 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-15 10:54:25,721 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:54:34,864 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-15 10:54:34,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:54:34,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 188 [2019-02-15 10:54:34,883 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:54:34,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 127 states [2019-02-15 10:54:34,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2019-02-15 10:54:34,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4292, Invalid=31618, Unknown=0, NotChecked=0, Total=35910 [2019-02-15 10:54:34,884 INFO L87 Difference]: Start difference. First operand 124 states and 124 transitions. Second operand 127 states. [2019-02-15 10:54:44,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:54:44,019 INFO L93 Difference]: Finished difference Result 128 states and 128 transitions. [2019-02-15 10:54:44,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-02-15 10:54:44,020 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 123 [2019-02-15 10:54:44,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:54:44,021 INFO L225 Difference]: With dead ends: 128 [2019-02-15 10:54:44,021 INFO L226 Difference]: Without dead ends: 127 [2019-02-15 10:54:44,022 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 118 SyntacticMatches, 1 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8060 ImplicationChecksByTransitivity, 17.5s TimeCoverageRelationStatistics Valid=4292, Invalid=31618, Unknown=0, NotChecked=0, Total=35910 [2019-02-15 10:54:44,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-02-15 10:54:44,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 126. [2019-02-15 10:54:44,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-02-15 10:54:44,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 126 transitions. [2019-02-15 10:54:44,028 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 126 transitions. Word has length 123 [2019-02-15 10:54:44,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:54:44,028 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 126 transitions. [2019-02-15 10:54:44,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has 127 states. [2019-02-15 10:54:44,028 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 126 transitions. [2019-02-15 10:54:44,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-02-15 10:54:44,029 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:54:44,029 INFO L402 BasicCegarLoop]: trace histogram [62, 61, 1, 1] [2019-02-15 10:54:44,029 INFO L423 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:54:44,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:54:44,030 INFO L82 PathProgramCache]: Analyzing trace with hash -150823526, now seen corresponding path program 61 times [2019-02-15 10:54:44,030 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:54:44,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:54:44,030 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:54:44,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:54:44,031 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:54:44,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:54:47,592 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-15 10:54:47,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:54:47,592 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:54:47,592 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:54:47,593 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:54:47,593 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:54:47,593 INFO 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-15 10:54:47,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:54:47,601 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:54:47,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:54:47,641 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:54:47,642 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-15 10:54:47,643 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:47,653 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:47,653 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 10:54:53,122 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-15 10:54:53,123 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:53,126 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:53,126 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 10:54:53,229 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-15 10:54:53,229 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:55:02,887 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-15 10:55:02,906 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:55:02,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 191 [2019-02-15 10:55:02,906 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:55:02,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 129 states [2019-02-15 10:55:02,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2019-02-15 10:55:02,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4424, Invalid=32632, Unknown=0, NotChecked=0, Total=37056 [2019-02-15 10:55:02,908 INFO L87 Difference]: Start difference. First operand 126 states and 126 transitions. Second operand 129 states. [2019-02-15 10:55:10,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:55:10,819 INFO L93 Difference]: Finished difference Result 130 states and 130 transitions. [2019-02-15 10:55:10,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-02-15 10:55:10,820 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 125 [2019-02-15 10:55:10,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:55:10,820 INFO L225 Difference]: With dead ends: 130 [2019-02-15 10:55:10,820 INFO L226 Difference]: Without dead ends: 129 [2019-02-15 10:55:10,821 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-15 10:55:10,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-02-15 10:55:10,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 128. [2019-02-15 10:55:10,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-02-15 10:55:10,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 128 transitions. [2019-02-15 10:55:10,826 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 128 transitions. Word has length 125 [2019-02-15 10:55:10,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:55:10,826 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 128 transitions. [2019-02-15 10:55:10,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 129 states. [2019-02-15 10:55:10,826 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 128 transitions. [2019-02-15 10:55:10,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-02-15 10:55:10,827 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:55:10,827 INFO L402 BasicCegarLoop]: trace histogram [63, 62, 1, 1] [2019-02-15 10:55:10,827 INFO L423 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:55:10,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:55:10,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1087480668, now seen corresponding path program 62 times [2019-02-15 10:55:10,827 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:55:10,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:55:10,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:55:10,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:55:10,828 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:55:10,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:55:11,018 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-15 10:55:14,357 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-15 10:55:14,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:55:14,357 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:55:14,357 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:55:14,358 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:55:14,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:55:14,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 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-15 10:55:14,367 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:55:14,367 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:55:14,476 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 63 check-sat command(s) [2019-02-15 10:55:14,477 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:55:14,480 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:55:14,482 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-15 10:55:14,482 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:55:14,488 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:55:14,488 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 10:55:20,016 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-15 10:55:20,017 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:55:20,021 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:55:20,021 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 10:55:20,124 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-15 10:55:20,125 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:55:30,083 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-15 10:55:30,102 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:55:30,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 194 [2019-02-15 10:55:30,103 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:55:30,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 131 states [2019-02-15 10:55:30,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2019-02-15 10:55:30,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4558, Invalid=33662, Unknown=0, NotChecked=0, Total=38220 [2019-02-15 10:55:30,104 INFO L87 Difference]: Start difference. First operand 128 states and 128 transitions. Second operand 131 states. [2019-02-15 10:55:36,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:55:36,557 INFO L93 Difference]: Finished difference Result 132 states and 132 transitions. [2019-02-15 10:55:36,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-02-15 10:55:36,557 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 127 [2019-02-15 10:55:36,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:55:36,558 INFO L225 Difference]: With dead ends: 132 [2019-02-15 10:55:36,558 INFO L226 Difference]: Without dead ends: 131 [2019-02-15 10:55:36,560 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 122 SyntacticMatches, 1 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8576 ImplicationChecksByTransitivity, 18.8s TimeCoverageRelationStatistics Valid=4558, Invalid=33662, Unknown=0, NotChecked=0, Total=38220 [2019-02-15 10:55:36,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-02-15 10:55:36,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2019-02-15 10:55:36,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-02-15 10:55:36,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 130 transitions. [2019-02-15 10:55:36,564 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 130 transitions. Word has length 127 [2019-02-15 10:55:36,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:55:36,564 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 130 transitions. [2019-02-15 10:55:36,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has 131 states. [2019-02-15 10:55:36,564 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 130 transitions. [2019-02-15 10:55:36,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-02-15 10:55:36,564 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:55:36,564 INFO L402 BasicCegarLoop]: trace histogram [64, 63, 1, 1] [2019-02-15 10:55:36,565 INFO L423 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:55:36,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:55:36,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1391870110, now seen corresponding path program 63 times [2019-02-15 10:55:36,565 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:55:36,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:55:36,566 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:55:36,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:55:36,566 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:55:36,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:55:40,067 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-15 10:55:40,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:55:40,067 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:55:40,067 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:55:40,067 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:55:40,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:55:40,068 INFO 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-15 10:55:40,087 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:55:40,087 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:55:40,122 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:55:40,122 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:55:40,126 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:55:40,131 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-15 10:55:40,132 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:55:40,137 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:55:40,137 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 10:55:45,894 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-15 10:55:45,895 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:55:45,898 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:55:45,898 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 10:55:46,006 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-15 10:55:46,006 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:55:56,325 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-15 10:55:56,345 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:55:56,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 197 [2019-02-15 10:55:56,345 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:55:56,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 133 states [2019-02-15 10:55:56,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2019-02-15 10:55:56,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4694, Invalid=34708, Unknown=0, NotChecked=0, Total=39402 [2019-02-15 10:55:56,348 INFO L87 Difference]: Start difference. First operand 130 states and 130 transitions. Second operand 133 states. [2019-02-15 10:56:04,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:56:04,463 INFO L93 Difference]: Finished difference Result 134 states and 134 transitions. [2019-02-15 10:56:04,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-02-15 10:56:04,463 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 129 [2019-02-15 10:56:04,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:56:04,465 INFO L225 Difference]: With dead ends: 134 [2019-02-15 10:56:04,465 INFO L226 Difference]: Without dead ends: 133 [2019-02-15 10:56:04,467 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 124 SyntacticMatches, 1 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8840 ImplicationChecksByTransitivity, 19.4s TimeCoverageRelationStatistics Valid=4694, Invalid=34708, Unknown=0, NotChecked=0, Total=39402 [2019-02-15 10:56:04,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-02-15 10:56:04,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 132. [2019-02-15 10:56:04,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-02-15 10:56:04,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 132 transitions. [2019-02-15 10:56:04,472 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 132 transitions. Word has length 129 [2019-02-15 10:56:04,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:56:04,472 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 132 transitions. [2019-02-15 10:56:04,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 133 states. [2019-02-15 10:56:04,473 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 132 transitions. [2019-02-15 10:56:04,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-02-15 10:56:04,473 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:56:04,473 INFO L402 BasicCegarLoop]: trace histogram [65, 64, 1, 1] [2019-02-15 10:56:04,474 INFO L423 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:56:04,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:56:04,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1852347744, now seen corresponding path program 64 times [2019-02-15 10:56:04,474 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:56:04,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:56:04,475 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:56:04,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:56:04,475 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:56:04,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:56:04,756 WARN L181 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-15 10:56:04,991 WARN L181 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-02-15 10:56:05,243 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-15 10:56:05,519 WARN L181 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-15 10:56:09,253 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-15 10:56:09,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:56:09,253 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:56:09,253 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:56:09,253 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:56:09,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:56:09,254 INFO 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-15 10:56:09,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:56:09,263 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:56:09,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:56:09,304 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:56:09,338 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-15 10:56:09,339 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:09,398 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:09,398 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 10:56:15,287 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-15 10:56:15,288 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:15,293 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:15,293 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 10:56:15,405 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-15 10:56:15,405 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:56:25,979 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-15 10:56:25,998 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:56:25,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 200 [2019-02-15 10:56:25,998 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:56:25,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 135 states [2019-02-15 10:56:25,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2019-02-15 10:56:26,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4832, Invalid=35770, Unknown=0, NotChecked=0, Total=40602 [2019-02-15 10:56:26,000 INFO L87 Difference]: Start difference. First operand 132 states and 132 transitions. Second operand 135 states. [2019-02-15 10:56:36,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:56:36,255 INFO L93 Difference]: Finished difference Result 136 states and 136 transitions. [2019-02-15 10:56:36,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-02-15 10:56:36,256 INFO L78 Accepts]: Start accepts. Automaton has 135 states. Word has length 131 [2019-02-15 10:56:36,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:56:36,257 INFO L225 Difference]: With dead ends: 136 [2019-02-15 10:56:36,257 INFO L226 Difference]: Without dead ends: 135 [2019-02-15 10:56:36,259 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 126 SyntacticMatches, 1 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9108 ImplicationChecksByTransitivity, 21.0s TimeCoverageRelationStatistics Valid=4832, Invalid=35770, Unknown=0, NotChecked=0, Total=40602 [2019-02-15 10:56:36,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-02-15 10:56:36,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 134. [2019-02-15 10:56:36,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-02-15 10:56:36,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 134 transitions. [2019-02-15 10:56:36,264 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 134 transitions. Word has length 131 [2019-02-15 10:56:36,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:56:36,264 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 134 transitions. [2019-02-15 10:56:36,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 135 states. [2019-02-15 10:56:36,265 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 134 transitions. [2019-02-15 10:56:36,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-02-15 10:56:36,265 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:56:36,265 INFO L402 BasicCegarLoop]: trace histogram [66, 65, 1, 1] [2019-02-15 10:56:36,266 INFO L423 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:56:36,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:56:36,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1989722530, now seen corresponding path program 65 times [2019-02-15 10:56:36,266 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:56:36,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:56:36,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:56:36,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:56:36,267 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:56:36,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:56:40,088 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-15 10:56:40,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:56:40,088 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:56:40,088 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:56:40,089 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:56:40,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:56:40,089 INFO 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-15 10:56:40,098 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:56:40,098 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:56:40,218 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 66 check-sat command(s) [2019-02-15 10:56:40,219 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:56:40,223 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:56:40,243 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-15 10:56:40,244 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:40,301 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:40,301 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 10:56:47,926 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-15 10:56:47,926 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:47,930 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:47,930 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 10:56:48,050 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-15 10:56:48,051 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:56:59,223 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-15 10:56:59,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:56:59,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 203 [2019-02-15 10:56:59,244 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:56:59,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 137 states [2019-02-15 10:56:59,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2019-02-15 10:56:59,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4972, Invalid=36848, Unknown=0, NotChecked=0, Total=41820 [2019-02-15 10:56:59,245 INFO L87 Difference]: Start difference. First operand 134 states and 134 transitions. Second operand 137 states. [2019-02-15 10:57:06,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:57:06,263 INFO L93 Difference]: Finished difference Result 138 states and 138 transitions. [2019-02-15 10:57:06,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-02-15 10:57:06,264 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 133 [2019-02-15 10:57:06,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:57:06,265 INFO L225 Difference]: With dead ends: 138 [2019-02-15 10:57:06,265 INFO L226 Difference]: Without dead ends: 137 [2019-02-15 10:57:06,266 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 128 SyntacticMatches, 1 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9380 ImplicationChecksByTransitivity, 22.4s TimeCoverageRelationStatistics Valid=4972, Invalid=36848, Unknown=0, NotChecked=0, Total=41820 [2019-02-15 10:57:06,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-02-15 10:57:06,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 136. [2019-02-15 10:57:06,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-02-15 10:57:06,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 136 transitions. [2019-02-15 10:57:06,271 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 136 transitions. Word has length 133 [2019-02-15 10:57:06,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:57:06,271 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 136 transitions. [2019-02-15 10:57:06,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has 137 states. [2019-02-15 10:57:06,271 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 136 transitions. [2019-02-15 10:57:06,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-02-15 10:57:06,272 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:57:06,272 INFO L402 BasicCegarLoop]: trace histogram [67, 66, 1, 1] [2019-02-15 10:57:06,272 INFO L423 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:57:06,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:06,272 INFO L82 PathProgramCache]: Analyzing trace with hash 862905700, now seen corresponding path program 66 times [2019-02-15 10:57:06,272 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:57:06,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:06,273 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:57:06,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:06,273 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:57:06,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:10,161 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-15 10:57:10,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:10,161 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:57:10,161 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:57:10,162 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:57:10,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:10,162 INFO 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-15 10:57:10,171 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:57:10,171 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:57:10,212 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:57:10,212 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:57:10,216 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:57:10,233 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-15 10:57:10,233 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:10,299 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:10,299 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 10:57:16,515 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-15 10:57:16,515 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:16,520 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:16,520 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 10:57:16,635 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-15 10:57:16,635 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:57:27,743 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-15 10:57:27,762 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:57:27,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 206 [2019-02-15 10:57:27,762 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:57:27,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 139 states [2019-02-15 10:57:27,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2019-02-15 10:57:27,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5114, Invalid=37942, Unknown=0, NotChecked=0, Total=43056 [2019-02-15 10:57:27,764 INFO L87 Difference]: Start difference. First operand 136 states and 136 transitions. Second operand 139 states. [2019-02-15 10:57:38,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:57:38,075 INFO L93 Difference]: Finished difference Result 140 states and 140 transitions. [2019-02-15 10:57:38,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-02-15 10:57:38,076 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 135 [2019-02-15 10:57:38,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:57:38,077 INFO L225 Difference]: With dead ends: 140 [2019-02-15 10:57:38,077 INFO L226 Difference]: Without dead ends: 139 [2019-02-15 10:57:38,079 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 130 SyntacticMatches, 1 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9656 ImplicationChecksByTransitivity, 21.0s TimeCoverageRelationStatistics Valid=5114, Invalid=37942, Unknown=0, NotChecked=0, Total=43056 [2019-02-15 10:57:38,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-02-15 10:57:38,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 138. [2019-02-15 10:57:38,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-02-15 10:57:38,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 138 transitions. [2019-02-15 10:57:38,083 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 138 transitions. Word has length 135 [2019-02-15 10:57:38,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:57:38,083 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 138 transitions. [2019-02-15 10:57:38,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 139 states. [2019-02-15 10:57:38,083 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 138 transitions. [2019-02-15 10:57:38,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-02-15 10:57:38,084 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:57:38,084 INFO L402 BasicCegarLoop]: trace histogram [68, 67, 1, 1] [2019-02-15 10:57:38,084 INFO L423 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:57:38,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:38,084 INFO L82 PathProgramCache]: Analyzing trace with hash 323690662, now seen corresponding path program 67 times [2019-02-15 10:57:38,084 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:57:38,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:38,085 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:57:38,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:38,085 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:57:38,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:42,012 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-15 10:57:42,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:42,013 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:57:42,013 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:57:42,013 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:57:42,013 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:42,013 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-15 10:57:42,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:42,022 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:57:42,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:42,062 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:57:42,065 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-15 10:57:42,065 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:42,073 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:42,073 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-15 10:57:48,356 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-15 10:57:48,357 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:48,361 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:48,361 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-15 10:57:48,473 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-15 10:57:48,473 INFO L316 TraceCheckSpWp]: Computing backward predicates...