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_array_oct.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified02.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b7bd044-m [2019-01-20 10:27:02,566 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-20 10:27:02,568 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-20 10:27:02,580 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-20 10:27:02,580 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-20 10:27:02,581 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-20 10:27:02,582 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-20 10:27:02,584 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-20 10:27:02,586 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-20 10:27:02,587 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-20 10:27:02,588 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-20 10:27:02,588 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-20 10:27:02,589 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-20 10:27:02,590 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-20 10:27:02,591 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-20 10:27:02,592 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-20 10:27:02,593 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-20 10:27:02,595 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-20 10:27:02,597 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-20 10:27:02,598 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-20 10:27:02,599 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-20 10:27:02,600 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-20 10:27:02,603 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-20 10:27:02,603 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-20 10:27:02,604 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-20 10:27:02,604 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-20 10:27:02,608 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-20 10:27:02,609 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-20 10:27:02,610 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-20 10:27:02,612 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-20 10:27:02,613 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-20 10:27:02,614 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-20 10:27:02,614 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-20 10:27:02,614 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-20 10:27:02,617 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-20 10:27:02,617 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-20 10:27:02,618 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2019-01-20 10:27:02,645 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-20 10:27:02,645 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-20 10:27:02,646 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-20 10:27:02,646 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-20 10:27:02,646 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-20 10:27:02,646 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-20 10:27:02,646 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-20 10:27:02,647 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-20 10:27:02,647 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-20 10:27:02,647 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-01-20 10:27:02,647 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-01-20 10:27:02,647 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-20 10:27:02,648 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-20 10:27:02,649 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-20 10:27:02,649 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-20 10:27:02,650 INFO L133 SettingsManager]: * Use SBE=true [2019-01-20 10:27:02,650 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-20 10:27:02,650 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-20 10:27:02,650 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-20 10:27:02,650 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-20 10:27:02,652 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-20 10:27:02,652 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-20 10:27:02,653 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-20 10:27:02,653 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-20 10:27:02,653 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-20 10:27:02,653 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-20 10:27:02,653 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-20 10:27:02,654 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-20 10:27:02,654 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-20 10:27:02,654 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-20 10:27:02,654 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-20 10:27:02,655 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-20 10:27:02,655 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-20 10:27:02,655 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-20 10:27:02,655 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-20 10:27:02,655 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-20 10:27:02,655 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-20 10:27:02,656 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-20 10:27:02,657 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-20 10:27:02,694 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-20 10:27:02,705 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-20 10:27:02,710 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-20 10:27:02,713 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-20 10:27:02,714 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-20 10:27:02,714 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified02.bpl [2019-01-20 10:27:02,715 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified02.bpl' [2019-01-20 10:27:02,770 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-20 10:27:02,773 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-20 10:27:02,773 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-20 10:27:02,774 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-20 10:27:02,774 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-20 10:27:02,790 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:27:02" (1/1) ... [2019-01-20 10:27:02,804 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:27:02" (1/1) ... [2019-01-20 10:27:02,813 WARN L165 Inliner]: Program contained no entry procedure! [2019-01-20 10:27:02,813 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-01-20 10:27:02,813 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-01-20 10:27:02,831 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-20 10:27:02,832 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-20 10:27:02,832 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-20 10:27:02,832 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-20 10:27:02,843 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:27:02" (1/1) ... [2019-01-20 10:27:02,843 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:27:02" (1/1) ... [2019-01-20 10:27:02,844 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:27:02" (1/1) ... [2019-01-20 10:27:02,845 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:27:02" (1/1) ... [2019-01-20 10:27:02,848 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:27:02" (1/1) ... [2019-01-20 10:27:02,853 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:27:02" (1/1) ... [2019-01-20 10:27:02,854 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:27:02" (1/1) ... [2019-01-20 10:27:02,856 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-20 10:27:02,856 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-20 10:27:02,856 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-20 10:27:02,856 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-20 10:27:02,857 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:27:02" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-20 10:27:02,923 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-20 10:27:02,923 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-20 10:27:02,923 INFO L130 BoogieDeclarations]: Found specification of procedure ~malloc [2019-01-20 10:27:03,107 INFO L278 CfgBuilder]: Using library mode [2019-01-20 10:27:03,107 INFO L286 CfgBuilder]: Removed 3 assue(true) statements. [2019-01-20 10:27:03,109 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 10:27:03 BoogieIcfgContainer [2019-01-20 10:27:03,109 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-20 10:27:03,110 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-20 10:27:03,110 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-20 10:27:03,114 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-20 10:27:03,114 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:27:02" (1/2) ... [2019-01-20 10:27:03,115 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e13d5e0 and model type PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 10:27:03, skipping insertion in model container [2019-01-20 10:27:03,115 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 10:27:03" (2/2) ... [2019-01-20 10:27:03,117 INFO L112 eAbstractionObserver]: Analyzing ICFG PointerIncrement-simplified02.bpl [2019-01-20 10:27:03,127 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-20 10:27:03,136 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-20 10:27:03,160 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-20 10:27:03,211 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-20 10:27:03,212 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-20 10:27:03,212 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-20 10:27:03,214 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-20 10:27:03,214 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-20 10:27:03,214 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-20 10:27:03,214 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-20 10:27:03,215 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-20 10:27:03,235 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states. [2019-01-20 10:27:03,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:27:03,244 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:27:03,246 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:27:03,248 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:27:03,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:27:03,255 INFO L82 PathProgramCache]: Analyzing trace with hash 927590, now seen corresponding path program 1 times [2019-01-20 10:27:03,257 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:27:03,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:03,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:27:03,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:03,311 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:27:03,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:27:03,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:03,460 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-20 10:27:03,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-20 10:27:03,461 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 10:27:03,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-20 10:27:03,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-20 10:27:03,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-20 10:27:03,477 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 3 states. [2019-01-20 10:27:03,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:27:03,533 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2019-01-20 10:27:03,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-20 10:27:03,534 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-01-20 10:27:03,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:27:03,547 INFO L225 Difference]: With dead ends: 17 [2019-01-20 10:27:03,547 INFO L226 Difference]: Without dead ends: 10 [2019-01-20 10:27:03,552 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-20 10:27:03,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-01-20 10:27:03,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2019-01-20 10:27:03,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-20 10:27:03,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-01-20 10:27:03,585 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 4 [2019-01-20 10:27:03,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:27:03,586 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-01-20 10:27:03,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-20 10:27:03,586 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-01-20 10:27:03,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-20 10:27:03,586 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:27:03,587 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2019-01-20 10:27:03,587 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:27:03,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:27:03,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1951667359, now seen corresponding path program 1 times [2019-01-20 10:27:03,588 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:27:03,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:03,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:27:03,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:03,589 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:27:03,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:27:03,673 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:03,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:03,674 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:27:03,675 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-20 10:27:03,677 INFO L207 CegarAbsIntRunner]: [0], [4], [7], [8], [9], [13] [2019-01-20 10:27:03,753 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:27:03,753 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:27:28,440 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:27:28,442 INFO L272 AbstractInterpreter]: Visited 6 different actions 71 times. Merged at 5 different actions 65 times. Widened at 1 different actions 9 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-20 10:27:28,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:27:28,449 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:27:28,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:28,450 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:27:28,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:27:28,469 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:27:28,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:27:28,513 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:27:28,585 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 6 treesize of output 5 [2019-01-20 10:27:28,588 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:27:28,701 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:27:28,702 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:27:28,862 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:28,863 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:27:28,895 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:28,919 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:27:28,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-20 10:27:28,920 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:27:28,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-20 10:27:28,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-20 10:27:28,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2019-01-20 10:27:28,921 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 6 states. [2019-01-20 10:27:29,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:27:29,064 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-01-20 10:27:29,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-20 10:27:29,065 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2019-01-20 10:27:29,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:27:29,066 INFO L225 Difference]: With dead ends: 15 [2019-01-20 10:27:29,066 INFO L226 Difference]: Without dead ends: 14 [2019-01-20 10:27:29,067 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2019-01-20 10:27:29,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-01-20 10:27:29,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-01-20 10:27:29,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-20 10:27:29,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-01-20 10:27:29,071 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 8 [2019-01-20 10:27:29,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:27:29,071 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-01-20 10:27:29,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-20 10:27:29,072 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-01-20 10:27:29,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-20 10:27:29,073 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:27:29,073 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1] [2019-01-20 10:27:29,073 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:27:29,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:27:29,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1291763032, now seen corresponding path program 2 times [2019-01-20 10:27:29,074 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:27:29,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:29,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:27:29,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:29,076 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:27:29,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:27:29,214 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:29,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:29,214 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:27:29,214 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:27:29,215 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:27:29,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:29,215 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:27:29,227 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:27:29,227 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:27:29,243 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-20 10:27:29,243 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:27:29,247 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:27:29,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 6 treesize of output 5 [2019-01-20 10:27:29,260 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:27:29,277 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:27:29,277 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:27:29,632 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:29,633 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:27:29,782 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:29,800 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:27:29,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:27:29,800 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:27:29,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:27:29,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:27:29,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=58, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:27:29,801 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 8 states. [2019-01-20 10:27:29,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:27:29,928 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-01-20 10:27:29,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-20 10:27:29,929 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-01-20 10:27:29,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:27:29,929 INFO L225 Difference]: With dead ends: 19 [2019-01-20 10:27:29,930 INFO L226 Difference]: Without dead ends: 18 [2019-01-20 10:27:29,930 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=52, Invalid=58, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:27:29,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-01-20 10:27:29,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-01-20 10:27:29,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-20 10:27:29,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-01-20 10:27:29,934 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 12 [2019-01-20 10:27:29,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:27:29,934 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-01-20 10:27:29,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:27:29,935 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-01-20 10:27:29,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-20 10:27:29,935 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:27:29,936 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1] [2019-01-20 10:27:29,936 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:27:29,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:27:29,936 INFO L82 PathProgramCache]: Analyzing trace with hash 172253585, now seen corresponding path program 3 times [2019-01-20 10:27:29,936 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:27:29,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:29,937 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:27:29,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:29,938 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:27:29,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:27:30,059 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:30,059 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:30,060 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:27:30,060 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:27:30,060 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:27:30,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:30,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 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:27:30,070 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:27:30,070 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:27:30,085 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:27:30,086 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:27:30,088 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:27:30,109 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 6 treesize of output 5 [2019-01-20 10:27:30,109 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:27:30,144 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:27:30,145 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:27:30,214 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:30,215 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:27:30,306 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:30,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:27:30,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-20 10:27:30,334 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:27:30,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:27:30,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:27:30,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=97, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:27:30,335 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 10 states. [2019-01-20 10:27:30,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:27:30,690 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-01-20 10:27:30,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:27:30,690 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-01-20 10:27:30,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:27:30,691 INFO L225 Difference]: With dead ends: 23 [2019-01-20 10:27:30,691 INFO L226 Difference]: Without dead ends: 22 [2019-01-20 10:27:30,692 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=97, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:27:30,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-01-20 10:27:30,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-01-20 10:27:30,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-20 10:27:30,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-01-20 10:27:30,696 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 16 [2019-01-20 10:27:30,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:27:30,696 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-01-20 10:27:30,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:27:30,697 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-01-20 10:27:30,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-20 10:27:30,697 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:27:30,697 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1] [2019-01-20 10:27:30,698 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:27:30,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:27:30,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1489288886, now seen corresponding path program 4 times [2019-01-20 10:27:30,698 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:27:30,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:30,699 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:27:30,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:30,699 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:27:30,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:27:30,810 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:30,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:30,811 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:27:30,811 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:27:30,811 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:27:30,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:30,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 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:27:30,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:27:30,821 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:27:30,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:27:30,850 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:27:30,860 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 6 treesize of output 5 [2019-01-20 10:27:30,861 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:27:30,875 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:27:30,875 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:27:31,005 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:31,005 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:27:31,171 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:31,190 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:27:31,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-20 10:27:31,190 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:27:31,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-20 10:27:31,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-20 10:27:31,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=146, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:27:31,192 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 12 states. [2019-01-20 10:27:31,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:27:31,272 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-01-20 10:27:31,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:27:31,272 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2019-01-20 10:27:31,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:27:31,273 INFO L225 Difference]: With dead ends: 27 [2019-01-20 10:27:31,273 INFO L226 Difference]: Without dead ends: 26 [2019-01-20 10:27:31,274 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=146, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:27:31,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-01-20 10:27:31,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2019-01-20 10:27:31,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-20 10:27:31,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-01-20 10:27:31,279 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 20 [2019-01-20 10:27:31,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:27:31,279 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-01-20 10:27:31,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-20 10:27:31,279 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-01-20 10:27:31,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-20 10:27:31,280 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:27:31,280 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 1, 1] [2019-01-20 10:27:31,281 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:27:31,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:27:31,281 INFO L82 PathProgramCache]: Analyzing trace with hash 702127235, now seen corresponding path program 5 times [2019-01-20 10:27:31,281 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:27:31,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:31,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:27:31,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:31,282 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:27:31,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:27:31,385 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:31,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:31,386 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:27:31,386 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:27:31,386 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:27:31,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:31,386 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:27:31,395 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:27:31,395 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:27:31,411 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-01-20 10:27:31,412 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:27:31,415 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:27:31,420 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 6 treesize of output 5 [2019-01-20 10:27:31,421 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:27:31,447 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:27:31,447 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:27:31,571 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:31,571 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:27:31,696 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:31,715 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:27:31,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2019-01-20 10:27:31,715 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:27:31,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-20 10:27:31,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-20 10:27:31,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=205, Unknown=0, NotChecked=0, Total=380 [2019-01-20 10:27:31,717 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 14 states. [2019-01-20 10:27:31,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:27:31,766 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-01-20 10:27:31,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:27:31,766 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2019-01-20 10:27:31,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:27:31,768 INFO L225 Difference]: With dead ends: 31 [2019-01-20 10:27:31,768 INFO L226 Difference]: Without dead ends: 30 [2019-01-20 10:27:31,769 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=175, Invalid=205, Unknown=0, NotChecked=0, Total=380 [2019-01-20 10:27:31,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-01-20 10:27:31,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-01-20 10:27:31,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-20 10:27:31,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-01-20 10:27:31,774 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 24 [2019-01-20 10:27:31,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:27:31,774 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-01-20 10:27:31,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-20 10:27:31,774 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-01-20 10:27:31,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-20 10:27:31,775 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:27:31,775 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 1, 1] [2019-01-20 10:27:31,776 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:27:31,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:27:31,776 INFO L82 PathProgramCache]: Analyzing trace with hash 854963004, now seen corresponding path program 6 times [2019-01-20 10:27:31,776 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:27:31,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:31,777 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:27:31,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:31,777 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:27:31,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:27:31,898 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:31,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:31,898 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:27:31,899 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:27:31,899 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:27:31,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:31,899 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:27:31,908 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:27:31,908 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:27:31,922 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:27:31,922 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:27:31,925 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:27:31,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 6 treesize of output 5 [2019-01-20 10:27:31,929 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:27:31,940 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:27:31,940 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:27:32,047 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:32,047 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:27:32,150 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:32,178 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:27:32,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2019-01-20 10:27:32,178 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:27:32,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-20 10:27:32,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-20 10:27:32,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=274, Unknown=0, NotChecked=0, Total=506 [2019-01-20 10:27:32,180 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 16 states. [2019-01-20 10:27:32,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:27:32,267 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-01-20 10:27:32,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 10:27:32,271 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 28 [2019-01-20 10:27:32,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:27:32,273 INFO L225 Difference]: With dead ends: 35 [2019-01-20 10:27:32,273 INFO L226 Difference]: Without dead ends: 34 [2019-01-20 10:27:32,273 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=232, Invalid=274, Unknown=0, NotChecked=0, Total=506 [2019-01-20 10:27:32,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-01-20 10:27:32,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-01-20 10:27:32,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-20 10:27:32,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-01-20 10:27:32,278 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 28 [2019-01-20 10:27:32,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:27:32,278 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-01-20 10:27:32,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-20 10:27:32,278 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-01-20 10:27:32,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-20 10:27:32,279 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:27:32,279 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 1, 1] [2019-01-20 10:27:32,280 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:27:32,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:27:32,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1908030091, now seen corresponding path program 7 times [2019-01-20 10:27:32,280 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:27:32,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:32,282 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:27:32,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:32,282 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:27:32,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:27:32,407 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:32,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:32,408 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:27:32,408 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:27:32,408 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:27:32,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:32,408 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:27:32,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:27:32,417 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:27:32,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:27:32,432 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:27:32,435 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-20 10:27:32,435 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:27:32,448 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:27:32,449 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:27:32,567 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:32,568 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:27:32,719 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:32,737 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:27:32,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2019-01-20 10:27:32,738 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:27:32,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-20 10:27:32,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-20 10:27:32,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=353, Unknown=0, NotChecked=0, Total=650 [2019-01-20 10:27:32,739 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 18 states. [2019-01-20 10:27:32,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:27:32,947 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-01-20 10:27:32,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-20 10:27:32,948 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 32 [2019-01-20 10:27:32,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:27:32,949 INFO L225 Difference]: With dead ends: 39 [2019-01-20 10:27:32,949 INFO L226 Difference]: Without dead ends: 38 [2019-01-20 10:27:32,950 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=297, Invalid=353, Unknown=0, NotChecked=0, Total=650 [2019-01-20 10:27:32,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-20 10:27:32,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2019-01-20 10:27:32,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-20 10:27:32,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-01-20 10:27:32,955 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 32 [2019-01-20 10:27:32,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:27:32,955 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-01-20 10:27:32,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-20 10:27:32,956 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-01-20 10:27:32,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-20 10:27:32,956 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:27:32,956 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 1, 1] [2019-01-20 10:27:32,957 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:27:32,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:27:32,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1033891026, now seen corresponding path program 8 times [2019-01-20 10:27:32,957 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:27:32,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:32,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:27:32,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:32,958 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:27:32,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:27:33,140 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:33,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:33,140 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:27:33,140 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:27:33,140 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:27:33,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:33,141 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:27:33,154 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:27:33,154 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:27:33,176 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-01-20 10:27:33,177 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:27:33,179 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:27:33,186 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 6 treesize of output 5 [2019-01-20 10:27:33,186 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:27:33,195 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:27:33,196 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:27:33,337 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:33,337 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:27:33,714 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:33,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:27:33,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2019-01-20 10:27:33,744 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:27:33,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-20 10:27:33,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-20 10:27:33,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=370, Invalid=442, Unknown=0, NotChecked=0, Total=812 [2019-01-20 10:27:33,745 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 20 states. [2019-01-20 10:27:33,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:27:33,844 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-01-20 10:27:33,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-20 10:27:33,844 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 36 [2019-01-20 10:27:33,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:27:33,845 INFO L225 Difference]: With dead ends: 43 [2019-01-20 10:27:33,846 INFO L226 Difference]: Without dead ends: 42 [2019-01-20 10:27:33,847 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=370, Invalid=442, Unknown=0, NotChecked=0, Total=812 [2019-01-20 10:27:33,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-01-20 10:27:33,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2019-01-20 10:27:33,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-20 10:27:33,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-01-20 10:27:33,852 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 36 [2019-01-20 10:27:33,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:27:33,852 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-01-20 10:27:33,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-20 10:27:33,853 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-01-20 10:27:33,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-01-20 10:27:33,854 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:27:33,854 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 1, 1] [2019-01-20 10:27:33,854 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:27:33,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:27:33,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1598366617, now seen corresponding path program 9 times [2019-01-20 10:27:33,855 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:27:33,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:33,856 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:27:33,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:33,856 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:27:33,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:27:34,034 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:34,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:34,035 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:27:34,035 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:27:34,035 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:27:34,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:34,035 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:27:34,045 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:27:34,045 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:27:34,060 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:27:34,061 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:27:34,064 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:27:34,067 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 6 treesize of output 5 [2019-01-20 10:27:34,067 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:27:34,076 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:27:34,077 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:27:34,218 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:34,218 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:27:34,421 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:34,440 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:27:34,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2019-01-20 10:27:34,441 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:27:34,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-20 10:27:34,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-20 10:27:34,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=451, Invalid=541, Unknown=0, NotChecked=0, Total=992 [2019-01-20 10:27:34,442 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 22 states. [2019-01-20 10:27:34,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:27:34,526 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-01-20 10:27:34,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-20 10:27:34,526 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 40 [2019-01-20 10:27:34,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:27:34,527 INFO L225 Difference]: With dead ends: 47 [2019-01-20 10:27:34,527 INFO L226 Difference]: Without dead ends: 46 [2019-01-20 10:27:34,529 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=451, Invalid=541, Unknown=0, NotChecked=0, Total=992 [2019-01-20 10:27:34,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-01-20 10:27:34,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2019-01-20 10:27:34,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-20 10:27:34,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-01-20 10:27:34,535 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 40 [2019-01-20 10:27:34,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:27:34,535 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-01-20 10:27:34,535 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-20 10:27:34,535 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-01-20 10:27:34,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-20 10:27:34,536 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:27:34,537 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 1, 1] [2019-01-20 10:27:34,537 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:27:34,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:27:34,537 INFO L82 PathProgramCache]: Analyzing trace with hash -710123232, now seen corresponding path program 10 times [2019-01-20 10:27:34,537 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:27:34,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:34,538 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:27:34,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:34,539 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:27:34,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:27:34,728 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:34,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:34,729 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:27:34,729 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:27:34,729 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:27:34,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:34,729 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:27:34,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:27:34,739 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:27:34,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:27:34,758 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:27:34,767 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 6 treesize of output 5 [2019-01-20 10:27:34,768 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:27:34,777 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:27:34,777 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:27:34,934 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:34,934 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:27:35,189 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:35,209 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:27:35,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2019-01-20 10:27:35,209 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:27:35,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-01-20 10:27:35,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-20 10:27:35,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=540, Invalid=650, Unknown=0, NotChecked=0, Total=1190 [2019-01-20 10:27:35,211 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 24 states. [2019-01-20 10:27:35,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:27:35,307 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-01-20 10:27:35,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-20 10:27:35,307 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 44 [2019-01-20 10:27:35,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:27:35,309 INFO L225 Difference]: With dead ends: 51 [2019-01-20 10:27:35,309 INFO L226 Difference]: Without dead ends: 50 [2019-01-20 10:27:35,311 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=540, Invalid=650, Unknown=0, NotChecked=0, Total=1190 [2019-01-20 10:27:35,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-01-20 10:27:35,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2019-01-20 10:27:35,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-01-20 10:27:35,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-01-20 10:27:35,316 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 44 [2019-01-20 10:27:35,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:27:35,316 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-01-20 10:27:35,316 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-01-20 10:27:35,316 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-01-20 10:27:35,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-20 10:27:35,317 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:27:35,317 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 1, 1] [2019-01-20 10:27:35,317 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:27:35,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:27:35,318 INFO L82 PathProgramCache]: Analyzing trace with hash 2020270425, now seen corresponding path program 11 times [2019-01-20 10:27:35,318 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:27:35,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:35,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:27:35,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:35,319 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:27:35,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:27:35,548 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:35,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:35,548 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:27:35,549 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:27:35,549 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:27:35,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:35,549 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:27:35,557 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:27:35,557 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:27:35,584 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-01-20 10:27:35,584 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:27:35,588 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:27:35,606 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 6 treesize of output 5 [2019-01-20 10:27:35,607 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:27:35,626 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:27:35,626 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:27:35,852 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:35,853 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:27:36,371 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:36,390 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:27:36,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 36 [2019-01-20 10:27:36,390 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:27:36,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-01-20 10:27:36,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-01-20 10:27:36,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=637, Invalid=769, Unknown=0, NotChecked=0, Total=1406 [2019-01-20 10:27:36,392 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 26 states. [2019-01-20 10:27:36,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:27:36,487 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-01-20 10:27:36,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-20 10:27:36,487 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 48 [2019-01-20 10:27:36,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:27:36,488 INFO L225 Difference]: With dead ends: 55 [2019-01-20 10:27:36,489 INFO L226 Difference]: Without dead ends: 54 [2019-01-20 10:27:36,490 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 552 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=637, Invalid=769, Unknown=0, NotChecked=0, Total=1406 [2019-01-20 10:27:36,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-01-20 10:27:36,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2019-01-20 10:27:36,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-20 10:27:36,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-01-20 10:27:36,495 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 48 [2019-01-20 10:27:36,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:27:36,496 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-01-20 10:27:36,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-01-20 10:27:36,496 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-01-20 10:27:36,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-01-20 10:27:36,497 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:27:36,497 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 1, 1] [2019-01-20 10:27:36,497 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:27:36,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:27:36,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1693672174, now seen corresponding path program 12 times [2019-01-20 10:27:36,497 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:27:36,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:36,498 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:27:36,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:36,498 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:27:36,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:27:36,981 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:36,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:36,982 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:27:36,982 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:27:36,982 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:27:36,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:36,982 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:27:36,991 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:27:36,992 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:27:37,008 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:27:37,009 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:27:37,013 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:27:37,022 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-20 10:27:37,022 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:27:37,032 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:27:37,033 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:27:37,206 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:37,206 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:27:37,506 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:37,525 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:27:37,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 39 [2019-01-20 10:27:37,525 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:27:37,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-01-20 10:27:37,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-01-20 10:27:37,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=742, Invalid=898, Unknown=0, NotChecked=0, Total=1640 [2019-01-20 10:27:37,527 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 28 states. [2019-01-20 10:27:37,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:27:37,622 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-01-20 10:27:37,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-20 10:27:37,622 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 52 [2019-01-20 10:27:37,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:27:37,623 INFO L225 Difference]: With dead ends: 59 [2019-01-20 10:27:37,623 INFO L226 Difference]: Without dead ends: 58 [2019-01-20 10:27:37,625 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 650 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=742, Invalid=898, Unknown=0, NotChecked=0, Total=1640 [2019-01-20 10:27:37,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-01-20 10:27:37,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2019-01-20 10:27:37,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-01-20 10:27:37,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-01-20 10:27:37,630 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 52 [2019-01-20 10:27:37,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:27:37,631 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-01-20 10:27:37,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-01-20 10:27:37,631 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-01-20 10:27:37,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-20 10:27:37,632 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:27:37,632 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 1, 1] [2019-01-20 10:27:37,632 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:27:37,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:27:37,632 INFO L82 PathProgramCache]: Analyzing trace with hash -628632501, now seen corresponding path program 13 times [2019-01-20 10:27:37,632 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:27:37,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:37,633 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:27:37,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:37,634 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:27:37,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:27:37,863 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:37,863 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:37,863 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:27:37,863 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:27:37,864 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:27:37,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:37,864 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:27:37,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:27:37,874 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:27:37,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:27:37,893 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:27:37,901 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-20 10:27:37,901 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:27:37,916 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:27:37,917 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:27:38,117 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:38,117 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:27:38,913 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:38,932 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:27:38,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 42 [2019-01-20 10:27:38,932 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:27:38,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-01-20 10:27:38,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-01-20 10:27:38,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=855, Invalid=1037, Unknown=0, NotChecked=0, Total=1892 [2019-01-20 10:27:38,934 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 30 states. [2019-01-20 10:27:39,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:27:39,167 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-01-20 10:27:39,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-20 10:27:39,167 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 56 [2019-01-20 10:27:39,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:27:39,168 INFO L225 Difference]: With dead ends: 63 [2019-01-20 10:27:39,169 INFO L226 Difference]: Without dead ends: 62 [2019-01-20 10:27:39,170 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 756 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=855, Invalid=1037, Unknown=0, NotChecked=0, Total=1892 [2019-01-20 10:27:39,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-01-20 10:27:39,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2019-01-20 10:27:39,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-20 10:27:39,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-01-20 10:27:39,175 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 56 [2019-01-20 10:27:39,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:27:39,176 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-01-20 10:27:39,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-01-20 10:27:39,176 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-01-20 10:27:39,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-01-20 10:27:39,177 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:27:39,177 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 1, 1] [2019-01-20 10:27:39,177 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:27:39,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:27:39,178 INFO L82 PathProgramCache]: Analyzing trace with hash -290273532, now seen corresponding path program 14 times [2019-01-20 10:27:39,178 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:27:39,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:39,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:27:39,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:39,179 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:27:39,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:27:40,121 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:40,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:40,121 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:27:40,122 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:27:40,122 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:27:40,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:40,122 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:27:40,130 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:27:40,130 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:27:40,161 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-01-20 10:27:40,162 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:27:40,165 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:27:40,171 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 6 treesize of output 5 [2019-01-20 10:27:40,172 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:27:40,181 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:27:40,181 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:27:40,544 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:40,544 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:27:40,861 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:40,879 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:27:40,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 45 [2019-01-20 10:27:40,880 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:27:40,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-01-20 10:27:40,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-01-20 10:27:40,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=976, Invalid=1186, Unknown=0, NotChecked=0, Total=2162 [2019-01-20 10:27:40,882 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 32 states. [2019-01-20 10:27:41,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:27:41,071 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-01-20 10:27:41,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-20 10:27:41,072 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 60 [2019-01-20 10:27:41,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:27:41,073 INFO L225 Difference]: With dead ends: 67 [2019-01-20 10:27:41,073 INFO L226 Difference]: Without dead ends: 66 [2019-01-20 10:27:41,075 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 870 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=976, Invalid=1186, Unknown=0, NotChecked=0, Total=2162 [2019-01-20 10:27:41,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-01-20 10:27:41,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2019-01-20 10:27:41,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-01-20 10:27:41,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-01-20 10:27:41,081 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 60 [2019-01-20 10:27:41,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:27:41,082 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-01-20 10:27:41,082 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-01-20 10:27:41,082 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-01-20 10:27:41,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-01-20 10:27:41,083 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:27:41,083 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 1, 1] [2019-01-20 10:27:41,084 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:27:41,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:27:41,084 INFO L82 PathProgramCache]: Analyzing trace with hash 977515837, now seen corresponding path program 15 times [2019-01-20 10:27:41,084 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:27:41,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:41,085 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:27:41,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:41,085 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:27:41,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:27:41,524 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:41,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:41,525 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:27:41,525 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:27:41,525 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:27:41,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:41,525 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:27:41,534 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:27:41,534 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:27:41,575 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:27:41,575 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:27:41,578 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:27:41,593 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-20 10:27:41,594 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:27:41,605 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:27:41,606 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:27:41,820 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:41,820 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:27:42,150 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:42,168 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:27:42,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 48 [2019-01-20 10:27:42,168 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:27:42,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-01-20 10:27:42,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-01-20 10:27:42,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1105, Invalid=1345, Unknown=0, NotChecked=0, Total=2450 [2019-01-20 10:27:42,170 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 34 states. [2019-01-20 10:27:42,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:27:42,295 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-01-20 10:27:42,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-20 10:27:42,296 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 64 [2019-01-20 10:27:42,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:27:42,297 INFO L225 Difference]: With dead ends: 71 [2019-01-20 10:27:42,297 INFO L226 Difference]: Without dead ends: 70 [2019-01-20 10:27:42,299 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 992 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1105, Invalid=1345, Unknown=0, NotChecked=0, Total=2450 [2019-01-20 10:27:42,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-01-20 10:27:42,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2019-01-20 10:27:42,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-01-20 10:27:42,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-01-20 10:27:42,305 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 64 [2019-01-20 10:27:42,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:27:42,305 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-01-20 10:27:42,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-01-20 10:27:42,305 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-01-20 10:27:42,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-01-20 10:27:42,306 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:27:42,306 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 1, 1] [2019-01-20 10:27:42,306 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:27:42,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:27:42,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1523638006, now seen corresponding path program 16 times [2019-01-20 10:27:42,307 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:27:42,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:42,308 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:27:42,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:42,308 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:27:42,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:27:42,572 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:42,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:42,572 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:27:42,572 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:27:42,572 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:27:42,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:42,573 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:27:42,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:27:42,583 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:27:42,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:27:42,608 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:27:42,628 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-20 10:27:42,629 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:27:42,704 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:27:42,705 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:27:44,215 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:44,216 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:27:44,595 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:44,613 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:27:44,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 51 [2019-01-20 10:27:44,614 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:27:44,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-01-20 10:27:44,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-01-20 10:27:44,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1242, Invalid=1514, Unknown=0, NotChecked=0, Total=2756 [2019-01-20 10:27:44,615 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 36 states. [2019-01-20 10:27:44,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:27:44,719 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-01-20 10:27:44,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-20 10:27:44,719 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 68 [2019-01-20 10:27:44,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:27:44,720 INFO L225 Difference]: With dead ends: 75 [2019-01-20 10:27:44,720 INFO L226 Difference]: Without dead ends: 74 [2019-01-20 10:27:44,722 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1122 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1242, Invalid=1514, Unknown=0, NotChecked=0, Total=2756 [2019-01-20 10:27:44,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-01-20 10:27:44,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2019-01-20 10:27:44,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-20 10:27:44,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-01-20 10:27:44,727 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 68 [2019-01-20 10:27:44,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:27:44,727 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-01-20 10:27:44,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-01-20 10:27:44,728 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-01-20 10:27:44,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-01-20 10:27:44,728 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:27:44,729 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 1, 1] [2019-01-20 10:27:44,729 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:27:44,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:27:44,729 INFO L82 PathProgramCache]: Analyzing trace with hash -1194294225, now seen corresponding path program 17 times [2019-01-20 10:27:44,729 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:27:44,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:44,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:27:44,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:44,730 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:27:44,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:27:45,022 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:45,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:45,023 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:27:45,023 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:27:45,023 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:27:45,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:45,023 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:27:45,040 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:27:45,040 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:27:45,124 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-01-20 10:27:45,124 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:27:45,127 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:27:45,130 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 6 treesize of output 5 [2019-01-20 10:27:45,130 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:27:45,140 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:27:45,140 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:27:45,401 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:45,401 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:27:46,077 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:46,096 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:27:46,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 54 [2019-01-20 10:27:46,096 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:27:46,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-01-20 10:27:46,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-01-20 10:27:46,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1387, Invalid=1693, Unknown=0, NotChecked=0, Total=3080 [2019-01-20 10:27:46,098 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 38 states. [2019-01-20 10:27:46,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:27:46,205 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-01-20 10:27:46,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-20 10:27:46,206 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 72 [2019-01-20 10:27:46,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:27:46,207 INFO L225 Difference]: With dead ends: 79 [2019-01-20 10:27:46,207 INFO L226 Difference]: Without dead ends: 78 [2019-01-20 10:27:46,209 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1260 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1387, Invalid=1693, Unknown=0, NotChecked=0, Total=3080 [2019-01-20 10:27:46,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-01-20 10:27:46,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2019-01-20 10:27:46,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-20 10:27:46,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-01-20 10:27:46,214 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 72 [2019-01-20 10:27:46,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:27:46,214 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-01-20 10:27:46,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-01-20 10:27:46,215 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-01-20 10:27:46,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-01-20 10:27:46,215 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:27:46,216 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 1, 1] [2019-01-20 10:27:46,216 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:27:46,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:27:46,216 INFO L82 PathProgramCache]: Analyzing trace with hash 395896040, now seen corresponding path program 18 times [2019-01-20 10:27:46,216 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:27:46,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:46,217 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:27:46,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:46,217 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:27:46,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:27:46,630 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:46,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:46,630 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:27:46,630 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:27:46,631 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:27:46,631 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:46,631 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:27:46,640 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:27:46,641 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:27:46,664 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:27:46,665 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:27:46,667 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:27:46,670 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 6 treesize of output 5 [2019-01-20 10:27:46,670 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:27:46,680 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:27:46,680 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:27:47,144 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:47,144 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:27:47,654 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:47,673 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:27:47,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 57 [2019-01-20 10:27:47,674 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:27:47,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-01-20 10:27:47,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-01-20 10:27:47,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1882, Unknown=0, NotChecked=0, Total=3422 [2019-01-20 10:27:47,676 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 40 states. [2019-01-20 10:27:47,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:27:47,829 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-01-20 10:27:47,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-20 10:27:47,830 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 76 [2019-01-20 10:27:47,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:27:47,831 INFO L225 Difference]: With dead ends: 83 [2019-01-20 10:27:47,831 INFO L226 Difference]: Without dead ends: 82 [2019-01-20 10:27:47,833 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1406 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1540, Invalid=1882, Unknown=0, NotChecked=0, Total=3422 [2019-01-20 10:27:47,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-01-20 10:27:47,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2019-01-20 10:27:47,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-01-20 10:27:47,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-01-20 10:27:47,836 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 76 [2019-01-20 10:27:47,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:27:47,837 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-01-20 10:27:47,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-01-20 10:27:47,837 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-01-20 10:27:47,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-01-20 10:27:47,838 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:27:47,838 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 1, 1] [2019-01-20 10:27:47,838 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:27:47,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:27:47,838 INFO L82 PathProgramCache]: Analyzing trace with hash 627065121, now seen corresponding path program 19 times [2019-01-20 10:27:47,838 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:27:47,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:47,839 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:27:47,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:47,840 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:27:47,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:27:48,619 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:48,619 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:48,619 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:27:48,620 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:27:48,620 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:27:48,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:48,620 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:27:48,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:27:48,630 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:27:48,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:27:48,657 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:27:48,675 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 6 treesize of output 5 [2019-01-20 10:27:48,675 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:27:48,680 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:27:48,680 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:27:49,033 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:49,034 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:27:49,719 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:49,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:27:49,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 60 [2019-01-20 10:27:49,738 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:27:49,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-01-20 10:27:49,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-01-20 10:27:49,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1701, Invalid=2081, Unknown=0, NotChecked=0, Total=3782 [2019-01-20 10:27:49,741 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 42 states. [2019-01-20 10:27:49,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:27:49,875 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2019-01-20 10:27:49,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-20 10:27:49,882 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 80 [2019-01-20 10:27:49,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:27:49,882 INFO L225 Difference]: With dead ends: 87 [2019-01-20 10:27:49,882 INFO L226 Difference]: Without dead ends: 86 [2019-01-20 10:27:49,884 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1560 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1701, Invalid=2081, Unknown=0, NotChecked=0, Total=3782 [2019-01-20 10:27:49,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-01-20 10:27:49,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2019-01-20 10:27:49,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-01-20 10:27:49,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-01-20 10:27:49,887 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 80 [2019-01-20 10:27:49,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:27:49,887 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-01-20 10:27:49,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-01-20 10:27:49,887 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-01-20 10:27:49,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-01-20 10:27:49,888 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:27:49,888 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 1, 1] [2019-01-20 10:27:49,889 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:27:49,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:27:49,889 INFO L82 PathProgramCache]: Analyzing trace with hash 188537050, now seen corresponding path program 20 times [2019-01-20 10:27:49,889 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:27:49,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:49,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:27:49,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:49,890 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:27:49,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:27:50,222 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:50,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:50,222 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:27:50,222 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:27:50,222 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:27:50,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:50,222 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:27:50,231 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:27:50,231 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:27:50,280 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2019-01-20 10:27:50,281 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:27:50,284 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:27:50,286 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 6 treesize of output 5 [2019-01-20 10:27:50,286 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:27:50,302 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:27:50,303 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:27:50,781 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:50,782 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:27:51,486 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:51,505 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:27:51,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 63 [2019-01-20 10:27:51,505 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:27:51,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-01-20 10:27:51,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-01-20 10:27:51,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1870, Invalid=2290, Unknown=0, NotChecked=0, Total=4160 [2019-01-20 10:27:51,507 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 44 states. [2019-01-20 10:27:51,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:27:51,710 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2019-01-20 10:27:51,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-20 10:27:51,710 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 84 [2019-01-20 10:27:51,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:27:51,711 INFO L225 Difference]: With dead ends: 91 [2019-01-20 10:27:51,711 INFO L226 Difference]: Without dead ends: 90 [2019-01-20 10:27:51,713 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1722 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1870, Invalid=2290, Unknown=0, NotChecked=0, Total=4160 [2019-01-20 10:27:51,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-01-20 10:27:51,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2019-01-20 10:27:51,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-01-20 10:27:51,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2019-01-20 10:27:51,717 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 84 [2019-01-20 10:27:51,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:27:51,717 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2019-01-20 10:27:51,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-01-20 10:27:51,717 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2019-01-20 10:27:51,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-01-20 10:27:51,718 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:27:51,718 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 1, 1] [2019-01-20 10:27:51,718 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:27:51,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:27:51,718 INFO L82 PathProgramCache]: Analyzing trace with hash -47911917, now seen corresponding path program 21 times [2019-01-20 10:27:51,718 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:27:51,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:51,719 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:27:51,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:51,719 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:27:51,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:27:52,149 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:52,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:52,149 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:27:52,149 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:27:52,149 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:27:52,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:52,150 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:27:52,158 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:27:52,158 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:27:52,183 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:27:52,183 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:27:52,186 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:27:52,189 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 6 treesize of output 5 [2019-01-20 10:27:52,190 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:27:52,199 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:27:52,200 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:27:52,544 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:52,544 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:27:53,166 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:53,184 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:27:53,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 66 [2019-01-20 10:27:53,185 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:27:53,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-01-20 10:27:53,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-01-20 10:27:53,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2047, Invalid=2509, Unknown=0, NotChecked=0, Total=4556 [2019-01-20 10:27:53,187 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 46 states. [2019-01-20 10:27:53,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:27:53,352 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2019-01-20 10:27:53,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-01-20 10:27:53,354 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 88 [2019-01-20 10:27:53,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:27:53,355 INFO L225 Difference]: With dead ends: 95 [2019-01-20 10:27:53,355 INFO L226 Difference]: Without dead ends: 94 [2019-01-20 10:27:53,356 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1892 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2047, Invalid=2509, Unknown=0, NotChecked=0, Total=4556 [2019-01-20 10:27:53,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-01-20 10:27:53,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2019-01-20 10:27:53,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-01-20 10:27:53,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2019-01-20 10:27:53,359 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 88 [2019-01-20 10:27:53,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:27:53,359 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2019-01-20 10:27:53,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-01-20 10:27:53,359 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2019-01-20 10:27:53,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-20 10:27:53,359 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:27:53,360 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 1, 1] [2019-01-20 10:27:53,360 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:27:53,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:27:53,360 INFO L82 PathProgramCache]: Analyzing trace with hash -907101492, now seen corresponding path program 22 times [2019-01-20 10:27:53,360 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:27:53,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:53,361 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:27:53,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:53,361 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:27:53,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:27:53,781 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:53,782 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:53,782 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:27:53,782 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:27:53,782 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:27:53,782 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:53,782 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:27:53,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:27:53,791 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:27:53,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:27:53,815 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:27:53,818 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-20 10:27:53,818 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:27:53,829 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:27:53,829 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:27:54,249 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:54,249 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:27:55,014 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:55,033 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:27:55,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 69 [2019-01-20 10:27:55,033 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:27:55,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-01-20 10:27:55,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-01-20 10:27:55,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2232, Invalid=2738, Unknown=0, NotChecked=0, Total=4970 [2019-01-20 10:27:55,035 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 48 states. [2019-01-20 10:27:55,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:27:55,175 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2019-01-20 10:27:55,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-01-20 10:27:55,179 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 92 [2019-01-20 10:27:55,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:27:55,180 INFO L225 Difference]: With dead ends: 99 [2019-01-20 10:27:55,180 INFO L226 Difference]: Without dead ends: 98 [2019-01-20 10:27:55,180 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2070 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2232, Invalid=2738, Unknown=0, NotChecked=0, Total=4970 [2019-01-20 10:27:55,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-01-20 10:27:55,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2019-01-20 10:27:55,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-01-20 10:27:55,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2019-01-20 10:27:55,184 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 92 [2019-01-20 10:27:55,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:27:55,184 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2019-01-20 10:27:55,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-01-20 10:27:55,184 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2019-01-20 10:27:55,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-20 10:27:55,185 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:27:55,185 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 1, 1] [2019-01-20 10:27:55,185 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:27:55,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:27:55,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1800439045, now seen corresponding path program 23 times [2019-01-20 10:27:55,186 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:27:55,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:55,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:27:55,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:55,187 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:27:55,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:27:55,791 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:55,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:55,791 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:27:55,791 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:27:55,791 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:27:55,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:55,792 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:27:55,802 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:27:55,802 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:27:55,859 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-01-20 10:27:55,860 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:27:55,864 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:27:55,870 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 6 treesize of output 5 [2019-01-20 10:27:55,871 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:27:55,881 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:27:55,881 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:27:56,461 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:56,461 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:27:57,542 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:57,560 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:27:57,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 72 [2019-01-20 10:27:57,561 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:27:57,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-01-20 10:27:57,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-01-20 10:27:57,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2425, Invalid=2977, Unknown=0, NotChecked=0, Total=5402 [2019-01-20 10:27:57,563 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 50 states. [2019-01-20 10:27:57,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:27:57,776 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2019-01-20 10:27:57,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-20 10:27:57,777 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 96 [2019-01-20 10:27:57,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:27:57,778 INFO L225 Difference]: With dead ends: 103 [2019-01-20 10:27:57,779 INFO L226 Difference]: Without dead ends: 102 [2019-01-20 10:27:57,780 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2256 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2425, Invalid=2977, Unknown=0, NotChecked=0, Total=5402 [2019-01-20 10:27:57,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-01-20 10:27:57,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2019-01-20 10:27:57,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-01-20 10:27:57,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2019-01-20 10:27:57,784 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 96 [2019-01-20 10:27:57,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:27:57,785 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2019-01-20 10:27:57,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-01-20 10:27:57,785 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2019-01-20 10:27:57,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-20 10:27:57,786 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:27:57,786 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 1, 1] [2019-01-20 10:27:57,786 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:27:57,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:27:57,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1780446530, now seen corresponding path program 24 times [2019-01-20 10:27:57,786 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:27:57,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:57,787 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:27:57,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:57,787 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:27:57,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:27:58,285 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:58,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:58,286 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:27:58,286 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:27:58,286 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:27:58,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:58,286 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:27:58,296 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:27:58,296 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:27:58,338 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:27:58,338 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:27:58,342 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:27:58,348 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 6 treesize of output 5 [2019-01-20 10:27:58,348 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:27:58,357 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:27:58,358 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:27:58,844 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:58,844 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:27:59,713 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:59,731 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:27:59,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 75 [2019-01-20 10:27:59,731 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:27:59,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-01-20 10:27:59,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-01-20 10:27:59,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2626, Invalid=3226, Unknown=0, NotChecked=0, Total=5852 [2019-01-20 10:27:59,733 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 52 states. [2019-01-20 10:27:59,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:27:59,923 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2019-01-20 10:27:59,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-01-20 10:27:59,924 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 100 [2019-01-20 10:27:59,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:27:59,925 INFO L225 Difference]: With dead ends: 107 [2019-01-20 10:27:59,925 INFO L226 Difference]: Without dead ends: 106 [2019-01-20 10:27:59,926 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2450 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2626, Invalid=3226, Unknown=0, NotChecked=0, Total=5852 [2019-01-20 10:27:59,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-01-20 10:27:59,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2019-01-20 10:27:59,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-01-20 10:27:59,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2019-01-20 10:27:59,931 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 100 [2019-01-20 10:27:59,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:27:59,931 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2019-01-20 10:27:59,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-01-20 10:27:59,931 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2019-01-20 10:27:59,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-01-20 10:27:59,932 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:27:59,932 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 1, 1] [2019-01-20 10:27:59,932 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:27:59,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:27:59,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1226116087, now seen corresponding path program 25 times [2019-01-20 10:27:59,933 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:27:59,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:59,934 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:27:59,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:59,934 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:27:59,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:28:00,398 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:28:00,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:28:00,398 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:28:00,398 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:28:00,399 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:28:00,399 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:28:00,399 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:28:00,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:28:00,408 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:28:00,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:28:00,436 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:28:00,438 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 6 treesize of output 5 [2019-01-20 10:28:00,439 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:28:00,452 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:28:00,453 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:28:00,927 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:28:00,927 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:28:02,291 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:28:02,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:28:02,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 78 [2019-01-20 10:28:02,310 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:28:02,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-01-20 10:28:02,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-01-20 10:28:02,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2835, Invalid=3485, Unknown=0, NotChecked=0, Total=6320 [2019-01-20 10:28:02,313 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 54 states. [2019-01-20 10:28:02,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:28:02,509 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2019-01-20 10:28:02,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-01-20 10:28:02,510 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 104 [2019-01-20 10:28:02,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:28:02,511 INFO L225 Difference]: With dead ends: 111 [2019-01-20 10:28:02,511 INFO L226 Difference]: Without dead ends: 110 [2019-01-20 10:28:02,512 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2652 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2835, Invalid=3485, Unknown=0, NotChecked=0, Total=6320 [2019-01-20 10:28:02,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-01-20 10:28:02,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2019-01-20 10:28:02,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-01-20 10:28:02,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2019-01-20 10:28:02,517 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 104 [2019-01-20 10:28:02,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:28:02,517 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2019-01-20 10:28:02,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-01-20 10:28:02,517 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2019-01-20 10:28:02,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-01-20 10:28:02,517 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:28:02,518 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 1, 1] [2019-01-20 10:28:02,518 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:28:02,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:28:02,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1598310576, now seen corresponding path program 26 times [2019-01-20 10:28:02,518 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:28:02,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:28:02,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:28:02,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:28:02,519 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:28:02,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:28:03,095 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:28:03,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:28:03,095 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:28:03,096 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:28:03,096 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:28:03,096 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:28:03,096 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:28:03,104 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:28:03,104 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:28:03,176 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2019-01-20 10:28:03,177 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:28:03,180 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:28:03,187 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 6 treesize of output 5 [2019-01-20 10:28:03,187 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:28:03,198 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:28:03,199 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:28:03,751 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:28:03,751 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:28:04,704 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:28:04,722 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:28:04,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 81 [2019-01-20 10:28:04,722 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:28:04,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-01-20 10:28:04,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-01-20 10:28:04,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3052, Invalid=3754, Unknown=0, NotChecked=0, Total=6806 [2019-01-20 10:28:04,724 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 56 states. [2019-01-20 10:28:04,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:28:04,904 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2019-01-20 10:28:04,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-01-20 10:28:04,905 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 108 [2019-01-20 10:28:04,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:28:04,906 INFO L225 Difference]: With dead ends: 115 [2019-01-20 10:28:04,906 INFO L226 Difference]: Without dead ends: 114 [2019-01-20 10:28:04,907 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2862 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=3052, Invalid=3754, Unknown=0, NotChecked=0, Total=6806 [2019-01-20 10:28:04,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-01-20 10:28:04,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2019-01-20 10:28:04,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-01-20 10:28:04,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2019-01-20 10:28:04,912 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 108 [2019-01-20 10:28:04,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:28:04,912 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2019-01-20 10:28:04,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-01-20 10:28:04,913 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2019-01-20 10:28:04,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-01-20 10:28:04,913 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:28:04,913 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 1, 1] [2019-01-20 10:28:04,913 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:28:04,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:28:04,914 INFO L82 PathProgramCache]: Analyzing trace with hash 497320169, now seen corresponding path program 27 times [2019-01-20 10:28:04,914 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:28:04,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:28:04,914 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:28:04,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:28:04,914 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:28:04,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:28:05,437 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:28:05,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:28:05,438 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:28:05,438 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:28:05,438 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:28:05,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:28:05,438 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:28:05,447 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:28:05,447 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:28:05,479 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:28:05,480 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:28:05,484 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:28:05,501 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-20 10:28:05,503 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:28:05,522 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:28:05,523 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:28:06,169 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:28:06,169 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:28:07,421 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:28:07,439 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:28:07,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 84 [2019-01-20 10:28:07,439 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:28:07,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-01-20 10:28:07,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-01-20 10:28:07,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3277, Invalid=4033, Unknown=0, NotChecked=0, Total=7310 [2019-01-20 10:28:07,441 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 58 states. [2019-01-20 10:28:07,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:28:07,624 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2019-01-20 10:28:07,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-01-20 10:28:07,625 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 112 [2019-01-20 10:28:07,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:28:07,626 INFO L225 Difference]: With dead ends: 119 [2019-01-20 10:28:07,626 INFO L226 Difference]: Without dead ends: 118 [2019-01-20 10:28:07,627 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3080 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3277, Invalid=4033, Unknown=0, NotChecked=0, Total=7310 [2019-01-20 10:28:07,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-01-20 10:28:07,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2019-01-20 10:28:07,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-01-20 10:28:07,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2019-01-20 10:28:07,631 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 112 [2019-01-20 10:28:07,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:28:07,631 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2019-01-20 10:28:07,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-01-20 10:28:07,631 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2019-01-20 10:28:07,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-01-20 10:28:07,632 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:28:07,632 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 1, 1] [2019-01-20 10:28:07,632 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:28:07,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:28:07,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1001655134, now seen corresponding path program 28 times [2019-01-20 10:28:07,632 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:28:07,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:28:07,633 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:28:07,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:28:07,633 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:28:07,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:28:08,284 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:28:08,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:28:08,284 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:28:08,285 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:28:08,285 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:28:08,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:28:08,285 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:28:08,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:28:08,293 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:28:08,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:28:08,329 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:28:08,331 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-20 10:28:08,332 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:28:08,343 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:28:08,343 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:28:09,042 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:28:09,042 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:28:10,168 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:28:10,186 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:28:10,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 87 [2019-01-20 10:28:10,186 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:28:10,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-01-20 10:28:10,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-01-20 10:28:10,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3510, Invalid=4322, Unknown=0, NotChecked=0, Total=7832 [2019-01-20 10:28:10,188 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 60 states. [2019-01-20 10:28:10,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:28:10,388 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2019-01-20 10:28:10,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-01-20 10:28:10,389 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 116 [2019-01-20 10:28:10,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:28:10,390 INFO L225 Difference]: With dead ends: 123 [2019-01-20 10:28:10,390 INFO L226 Difference]: Without dead ends: 122 [2019-01-20 10:28:10,392 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3306 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3510, Invalid=4322, Unknown=0, NotChecked=0, Total=7832 [2019-01-20 10:28:10,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-01-20 10:28:10,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2019-01-20 10:28:10,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-01-20 10:28:10,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2019-01-20 10:28:10,396 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 116 [2019-01-20 10:28:10,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:28:10,396 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2019-01-20 10:28:10,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-01-20 10:28:10,397 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2019-01-20 10:28:10,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-01-20 10:28:10,397 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:28:10,398 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 1, 1] [2019-01-20 10:28:10,398 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:28:10,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:28:10,398 INFO L82 PathProgramCache]: Analyzing trace with hash 506520539, now seen corresponding path program 29 times [2019-01-20 10:28:10,398 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:28:10,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:28:10,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:28:10,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:28:10,399 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:28:10,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:28:10,951 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:28:10,952 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:28:10,952 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:28:10,952 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:28:10,952 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:28:10,952 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:28:10,952 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:28:10,967 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:28:10,967 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:28:11,054 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2019-01-20 10:28:11,055 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:28:11,059 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:28:11,080 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-20 10:28:11,081 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:28:11,113 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:28:11,113 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:28:11,748 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:28:11,748 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:28:13,217 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:28:13,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:28:13,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 90 [2019-01-20 10:28:13,236 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:28:13,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-01-20 10:28:13,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-01-20 10:28:13,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3751, Invalid=4621, Unknown=0, NotChecked=0, Total=8372 [2019-01-20 10:28:13,240 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 62 states. [2019-01-20 10:28:13,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:28:13,436 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2019-01-20 10:28:13,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-20 10:28:13,436 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 120 [2019-01-20 10:28:13,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:28:13,438 INFO L225 Difference]: With dead ends: 127 [2019-01-20 10:28:13,438 INFO L226 Difference]: Without dead ends: 126 [2019-01-20 10:28:13,439 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3540 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3751, Invalid=4621, Unknown=0, NotChecked=0, Total=8372 [2019-01-20 10:28:13,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-01-20 10:28:13,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2019-01-20 10:28:13,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-01-20 10:28:13,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2019-01-20 10:28:13,443 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 120 [2019-01-20 10:28:13,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:28:13,444 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2019-01-20 10:28:13,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-01-20 10:28:13,444 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2019-01-20 10:28:13,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-01-20 10:28:13,444 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:28:13,445 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 1, 1] [2019-01-20 10:28:13,445 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:28:13,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:28:13,445 INFO L82 PathProgramCache]: Analyzing trace with hash 287936148, now seen corresponding path program 30 times [2019-01-20 10:28:13,445 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:28:13,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:28:13,446 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:28:13,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:28:13,446 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:28:13,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:28:14,177 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:28:14,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:28:14,178 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:28:14,178 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:28:14,178 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:28:14,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:28:14,178 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:28:14,188 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:28:14,188 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:28:14,226 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:28:14,227 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:28:14,230 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:28:14,235 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-20 10:28:14,235 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:28:14,247 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:28:14,247 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:28:14,876 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:28:14,876 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:28:16,096 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:28:16,114 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:28:16,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 93 [2019-01-20 10:28:16,114 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:28:16,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-01-20 10:28:16,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-01-20 10:28:16,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4000, Invalid=4930, Unknown=0, NotChecked=0, Total=8930 [2019-01-20 10:28:16,116 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 64 states. [2019-01-20 10:28:16,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:28:16,349 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2019-01-20 10:28:16,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-01-20 10:28:16,350 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 124 [2019-01-20 10:28:16,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:28:16,351 INFO L225 Difference]: With dead ends: 131 [2019-01-20 10:28:16,351 INFO L226 Difference]: Without dead ends: 130 [2019-01-20 10:28:16,352 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3782 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=4000, Invalid=4930, Unknown=0, NotChecked=0, Total=8930 [2019-01-20 10:28:16,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-01-20 10:28:16,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2019-01-20 10:28:16,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-01-20 10:28:16,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 129 transitions. [2019-01-20 10:28:16,356 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 129 transitions. Word has length 124 [2019-01-20 10:28:16,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:28:16,357 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 129 transitions. [2019-01-20 10:28:16,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-01-20 10:28:16,357 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 129 transitions. [2019-01-20 10:28:16,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-01-20 10:28:16,358 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:28:16,358 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 1, 1] [2019-01-20 10:28:16,358 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:28:16,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:28:16,358 INFO L82 PathProgramCache]: Analyzing trace with hash 770454733, now seen corresponding path program 31 times [2019-01-20 10:28:16,359 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:28:16,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:28:16,359 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:28:16,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:28:16,360 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:28:16,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:28:17,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:28:17,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:28:17,158 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:28:17,158 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:28:17,158 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:28:17,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:28:17,158 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:28:17,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:28:17,168 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:28:17,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:28:17,208 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:28:17,215 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 6 treesize of output 5 [2019-01-20 10:28:17,215 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:28:17,227 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:28:17,227 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:28:17,978 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:28:17,978 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:28:19,301 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:28:19,321 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:28:19,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 96 [2019-01-20 10:28:19,321 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:28:19,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-01-20 10:28:19,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-01-20 10:28:19,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4257, Invalid=5249, Unknown=0, NotChecked=0, Total=9506 [2019-01-20 10:28:19,324 INFO L87 Difference]: Start difference. First operand 129 states and 129 transitions. Second operand 66 states. [2019-01-20 10:28:19,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:28:19,535 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2019-01-20 10:28:19,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-01-20 10:28:19,535 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 128 [2019-01-20 10:28:19,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:28:19,536 INFO L225 Difference]: With dead ends: 135 [2019-01-20 10:28:19,537 INFO L226 Difference]: Without dead ends: 134 [2019-01-20 10:28:19,538 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4032 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=4257, Invalid=5249, Unknown=0, NotChecked=0, Total=9506 [2019-01-20 10:28:19,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-01-20 10:28:19,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2019-01-20 10:28:19,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-01-20 10:28:19,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2019-01-20 10:28:19,543 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 128 [2019-01-20 10:28:19,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:28:19,544 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2019-01-20 10:28:19,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-01-20 10:28:19,544 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2019-01-20 10:28:19,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-01-20 10:28:19,544 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:28:19,545 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 32, 32, 1, 1] [2019-01-20 10:28:19,545 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:28:19,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:28:19,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1074730630, now seen corresponding path program 32 times [2019-01-20 10:28:19,545 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:28:19,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:28:19,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:28:19,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:28:19,546 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:28:19,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:28:21,149 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:28:21,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:28:21,150 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:28:21,150 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:28:21,150 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:28:21,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:28:21,151 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:28:21,159 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:28:21,159 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:28:21,287 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2019-01-20 10:28:21,287 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:28:21,292 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:28:21,312 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 6 treesize of output 5 [2019-01-20 10:28:21,313 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:28:21,406 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:28:21,407 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:28:23,411 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:28:23,411 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:28:24,779 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:28:24,799 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:28:24,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 99 [2019-01-20 10:28:24,799 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:28:24,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-01-20 10:28:24,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-01-20 10:28:24,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4522, Invalid=5578, Unknown=0, NotChecked=0, Total=10100 [2019-01-20 10:28:24,801 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 68 states. [2019-01-20 10:28:25,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:28:25,024 INFO L93 Difference]: Finished difference Result 139 states and 139 transitions. [2019-01-20 10:28:25,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-01-20 10:28:25,024 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 132 [2019-01-20 10:28:25,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:28:25,026 INFO L225 Difference]: With dead ends: 139 [2019-01-20 10:28:25,026 INFO L226 Difference]: Without dead ends: 138 [2019-01-20 10:28:25,028 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4290 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=4522, Invalid=5578, Unknown=0, NotChecked=0, Total=10100 [2019-01-20 10:28:25,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-01-20 10:28:25,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 137. [2019-01-20 10:28:25,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-01-20 10:28:25,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2019-01-20 10:28:25,032 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 132 [2019-01-20 10:28:25,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:28:25,032 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2019-01-20 10:28:25,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-01-20 10:28:25,033 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2019-01-20 10:28:25,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-01-20 10:28:25,033 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:28:25,034 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 1, 1] [2019-01-20 10:28:25,034 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:28:25,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:28:25,034 INFO L82 PathProgramCache]: Analyzing trace with hash -569871425, now seen corresponding path program 33 times [2019-01-20 10:28:25,034 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:28:25,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:28:25,035 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:28:25,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:28:25,035 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:28:25,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:28:25,731 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:28:25,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:28:25,731 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:28:25,731 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:28:25,732 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:28:25,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:28:25,732 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:28:25,740 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:28:25,740 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:28:25,779 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:28:25,779 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:28:25,783 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:28:25,786 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 6 treesize of output 5 [2019-01-20 10:28:25,786 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:28:25,794 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:28:25,794 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:28:26,589 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:28:26,589 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:28:28,669 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:28:28,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:28:28,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 102 [2019-01-20 10:28:28,688 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:28:28,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-01-20 10:28:28,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-01-20 10:28:28,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4795, Invalid=5917, Unknown=0, NotChecked=0, Total=10712 [2019-01-20 10:28:28,690 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 70 states. [2019-01-20 10:28:29,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:28:29,013 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2019-01-20 10:28:29,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-01-20 10:28:29,013 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 136 [2019-01-20 10:28:29,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:28:29,015 INFO L225 Difference]: With dead ends: 143 [2019-01-20 10:28:29,015 INFO L226 Difference]: Without dead ends: 142 [2019-01-20 10:28:29,016 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4556 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4795, Invalid=5917, Unknown=0, NotChecked=0, Total=10712 [2019-01-20 10:28:29,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-01-20 10:28:29,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2019-01-20 10:28:29,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-01-20 10:28:29,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2019-01-20 10:28:29,021 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 136 [2019-01-20 10:28:29,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:28:29,021 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2019-01-20 10:28:29,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-01-20 10:28:29,021 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2019-01-20 10:28:29,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-01-20 10:28:29,022 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:28:29,022 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 34, 34, 1, 1] [2019-01-20 10:28:29,022 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:28:29,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:28:29,022 INFO L82 PathProgramCache]: Analyzing trace with hash -114389896, now seen corresponding path program 34 times [2019-01-20 10:28:29,023 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:28:29,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:28:29,023 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:28:29,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:28:29,023 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:28:29,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:28:29,742 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:28:29,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:28:29,742 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:28:29,742 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:28:29,742 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:28:29,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:28:29,742 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:28:29,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:28:29,751 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:28:29,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:28:29,789 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:28:29,792 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 6 treesize of output 5 [2019-01-20 10:28:29,792 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:28:29,802 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:28:29,802 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:28:30,707 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:28:30,708 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:28:32,263 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:28:32,282 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:28:32,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 105 [2019-01-20 10:28:32,282 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:28:32,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-01-20 10:28:32,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-01-20 10:28:32,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5076, Invalid=6266, Unknown=0, NotChecked=0, Total=11342 [2019-01-20 10:28:32,284 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 72 states. [2019-01-20 10:28:32,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:28:32,768 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2019-01-20 10:28:32,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-01-20 10:28:32,768 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 140 [2019-01-20 10:28:32,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:28:32,770 INFO L225 Difference]: With dead ends: 147 [2019-01-20 10:28:32,770 INFO L226 Difference]: Without dead ends: 146 [2019-01-20 10:28:32,771 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4830 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=5076, Invalid=6266, Unknown=0, NotChecked=0, Total=11342 [2019-01-20 10:28:32,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-01-20 10:28:32,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2019-01-20 10:28:32,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-01-20 10:28:32,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2019-01-20 10:28:32,776 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 140 [2019-01-20 10:28:32,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:28:32,776 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 145 transitions. [2019-01-20 10:28:32,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-01-20 10:28:32,776 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 145 transitions. [2019-01-20 10:28:32,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-01-20 10:28:32,777 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:28:32,777 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 35, 35, 1, 1] [2019-01-20 10:28:32,777 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:28:32,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:28:32,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1840750769, now seen corresponding path program 35 times [2019-01-20 10:28:32,778 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:28:32,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:28:32,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:28:32,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:28:32,779 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:28:32,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:28:33,547 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:28:33,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:28:33,547 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:28:33,547 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:28:33,547 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:28:33,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:28:33,547 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:28:33,555 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:28:33,556 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:28:33,679 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2019-01-20 10:28:33,680 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:28:33,684 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:28:33,687 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 6 treesize of output 5 [2019-01-20 10:28:33,687 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:28:33,702 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:28:33,702 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:28:34,558 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:28:34,558 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:28:36,207 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:28:36,225 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:28:36,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 108 [2019-01-20 10:28:36,226 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:28:36,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-01-20 10:28:36,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-01-20 10:28:36,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5365, Invalid=6625, Unknown=0, NotChecked=0, Total=11990 [2019-01-20 10:28:36,227 INFO L87 Difference]: Start difference. First operand 145 states and 145 transitions. Second operand 74 states. [2019-01-20 10:28:36,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:28:36,594 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2019-01-20 10:28:36,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-01-20 10:28:36,594 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 144 [2019-01-20 10:28:36,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:28:36,596 INFO L225 Difference]: With dead ends: 151 [2019-01-20 10:28:36,596 INFO L226 Difference]: Without dead ends: 150 [2019-01-20 10:28:36,597 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5112 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=5365, Invalid=6625, Unknown=0, NotChecked=0, Total=11990 [2019-01-20 10:28:36,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-01-20 10:28:36,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2019-01-20 10:28:36,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-01-20 10:28:36,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 149 transitions. [2019-01-20 10:28:36,601 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 149 transitions. Word has length 144 [2019-01-20 10:28:36,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:28:36,602 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 149 transitions. [2019-01-20 10:28:36,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-01-20 10:28:36,602 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 149 transitions. [2019-01-20 10:28:36,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-01-20 10:28:36,602 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:28:36,603 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 36, 36, 1, 1] [2019-01-20 10:28:36,603 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:28:36,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:28:36,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1833308054, now seen corresponding path program 36 times [2019-01-20 10:28:36,603 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:28:36,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:28:36,604 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:28:36,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:28:36,604 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:28:36,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:28:42,108 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:28:42,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:28:42,109 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:28:42,109 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:28:42,109 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:28:42,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:28:42,109 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:28:42,127 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:28:42,128 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:28:42,183 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:28:42,184 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:28:42,189 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:28:42,199 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 6 treesize of output 5 [2019-01-20 10:28:42,199 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:28:42,210 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:28:42,210 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:28:43,461 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:28:43,461 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:28:45,227 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:28:45,256 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:28:45,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 111 [2019-01-20 10:28:45,256 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:28:45,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-01-20 10:28:45,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-01-20 10:28:45,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5662, Invalid=6994, Unknown=0, NotChecked=0, Total=12656 [2019-01-20 10:28:45,260 INFO L87 Difference]: Start difference. First operand 149 states and 149 transitions. Second operand 76 states. [2019-01-20 10:28:45,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:28:45,598 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2019-01-20 10:28:45,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-01-20 10:28:45,598 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 148 [2019-01-20 10:28:45,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:28:45,601 INFO L225 Difference]: With dead ends: 155 [2019-01-20 10:28:45,601 INFO L226 Difference]: Without dead ends: 154 [2019-01-20 10:28:45,602 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5402 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=5662, Invalid=6994, Unknown=0, NotChecked=0, Total=12656 [2019-01-20 10:28:45,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-01-20 10:28:45,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 153. [2019-01-20 10:28:45,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-01-20 10:28:45,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2019-01-20 10:28:45,627 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 148 [2019-01-20 10:28:45,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:28:45,628 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 153 transitions. [2019-01-20 10:28:45,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-01-20 10:28:45,628 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 153 transitions. [2019-01-20 10:28:45,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-01-20 10:28:45,630 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:28:45,630 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 37, 37, 1, 1] [2019-01-20 10:28:45,630 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:28:45,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:28:45,631 INFO L82 PathProgramCache]: Analyzing trace with hash -903103581, now seen corresponding path program 37 times [2019-01-20 10:28:45,631 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:28:45,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:28:45,634 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:28:45,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:28:45,635 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:28:45,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:28:46,478 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:28:46,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:28:46,478 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:28:46,479 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:28:46,479 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:28:46,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:28:46,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 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:28:46,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:28:46,487 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:28:46,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:28:46,539 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:28:46,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 6 treesize of output 5 [2019-01-20 10:28:46,559 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:28:46,651 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:28:46,652 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:28:48,004 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:28:48,004 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:28:50,027 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:28:50,046 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:28:50,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 114 [2019-01-20 10:28:50,046 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:28:50,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-01-20 10:28:50,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-01-20 10:28:50,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5967, Invalid=7373, Unknown=0, NotChecked=0, Total=13340 [2019-01-20 10:28:50,049 INFO L87 Difference]: Start difference. First operand 153 states and 153 transitions. Second operand 78 states. [2019-01-20 10:28:50,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:28:50,293 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2019-01-20 10:28:50,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-01-20 10:28:50,294 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 152 [2019-01-20 10:28:50,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:28:50,295 INFO L225 Difference]: With dead ends: 159 [2019-01-20 10:28:50,295 INFO L226 Difference]: Without dead ends: 158 [2019-01-20 10:28:50,297 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5700 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5967, Invalid=7373, Unknown=0, NotChecked=0, Total=13340 [2019-01-20 10:28:50,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-01-20 10:28:50,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 157. [2019-01-20 10:28:50,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-01-20 10:28:50,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2019-01-20 10:28:50,301 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 152 [2019-01-20 10:28:50,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:28:50,302 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2019-01-20 10:28:50,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-01-20 10:28:50,302 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2019-01-20 10:28:50,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-01-20 10:28:50,303 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:28:50,303 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 38, 38, 1, 1] [2019-01-20 10:28:50,303 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:28:50,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:28:50,303 INFO L82 PathProgramCache]: Analyzing trace with hash 283329116, now seen corresponding path program 38 times [2019-01-20 10:28:50,304 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:28:50,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:28:50,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:28:50,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:28:50,304 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:28:50,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:28:51,882 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:28:51,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:28:51,882 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:28:51,883 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:28:51,883 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:28:51,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:28:51,883 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:28:51,892 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:28:51,892 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:28:52,016 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 39 check-sat command(s) [2019-01-20 10:28:52,017 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:28:52,021 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:28:52,027 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 6 treesize of output 5 [2019-01-20 10:28:52,028 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:28:52,038 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:28:52,038 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:28:53,288 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:28:53,289 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:28:55,177 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:28:55,196 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:28:55,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 117 [2019-01-20 10:28:55,196 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:28:55,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-01-20 10:28:55,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-01-20 10:28:55,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6280, Invalid=7762, Unknown=0, NotChecked=0, Total=14042 [2019-01-20 10:28:55,198 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 80 states. [2019-01-20 10:28:55,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:28:55,847 INFO L93 Difference]: Finished difference Result 163 states and 163 transitions. [2019-01-20 10:28:55,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-01-20 10:28:55,848 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 156 [2019-01-20 10:28:55,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:28:55,849 INFO L225 Difference]: With dead ends: 163 [2019-01-20 10:28:55,849 INFO L226 Difference]: Without dead ends: 162 [2019-01-20 10:28:55,850 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6006 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6280, Invalid=7762, Unknown=0, NotChecked=0, Total=14042 [2019-01-20 10:28:55,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-01-20 10:28:55,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 161. [2019-01-20 10:28:55,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-01-20 10:28:55,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2019-01-20 10:28:55,855 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 156 [2019-01-20 10:28:55,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:28:55,856 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2019-01-20 10:28:55,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-01-20 10:28:55,856 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2019-01-20 10:28:55,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-01-20 10:28:55,857 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:28:55,857 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 39, 39, 1, 1] [2019-01-20 10:28:55,857 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:28:55,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:28:55,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1902721899, now seen corresponding path program 39 times [2019-01-20 10:28:55,858 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:28:55,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:28:55,858 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:28:55,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:28:55,858 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:28:55,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:28:56,763 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:28:56,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:28:56,764 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:28:56,764 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:28:56,764 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:28:56,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:28:56,764 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:28:56,773 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:28:56,774 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:28:56,830 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:28:56,830 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:28:56,838 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:28:56,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 6 treesize of output 5 [2019-01-20 10:28:56,853 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:28:56,861 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:28:56,861 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:28:57,884 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:28:57,885 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:29:00,258 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:29:00,278 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:29:00,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 120 [2019-01-20 10:29:00,278 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:29:00,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-01-20 10:29:00,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-01-20 10:29:00,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6601, Invalid=8161, Unknown=0, NotChecked=0, Total=14762 [2019-01-20 10:29:00,279 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 82 states. [2019-01-20 10:29:00,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:29:00,577 INFO L93 Difference]: Finished difference Result 167 states and 167 transitions. [2019-01-20 10:29:00,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-01-20 10:29:00,577 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 160 [2019-01-20 10:29:00,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:29:00,579 INFO L225 Difference]: With dead ends: 167 [2019-01-20 10:29:00,579 INFO L226 Difference]: Without dead ends: 166 [2019-01-20 10:29:00,580 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6320 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=6601, Invalid=8161, Unknown=0, NotChecked=0, Total=14762 [2019-01-20 10:29:00,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-01-20 10:29:00,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 165. [2019-01-20 10:29:00,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-01-20 10:29:00,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 165 transitions. [2019-01-20 10:29:00,585 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 165 transitions. Word has length 160 [2019-01-20 10:29:00,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:29:00,585 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 165 transitions. [2019-01-20 10:29:00,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-01-20 10:29:00,586 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 165 transitions. [2019-01-20 10:29:00,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-01-20 10:29:00,586 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:29:00,587 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 40, 40, 1, 1] [2019-01-20 10:29:00,587 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:29:00,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:29:00,587 INFO L82 PathProgramCache]: Analyzing trace with hash 635208270, now seen corresponding path program 40 times [2019-01-20 10:29:00,587 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:29:00,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:29:00,588 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:29:00,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:29:00,588 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:29:00,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:29:01,548 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:29:01,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:29:01,548 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:29:01,548 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:29:01,548 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:29:01,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:29:01,548 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:29:01,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:29:01,557 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:29:01,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:29:01,605 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:29:01,622 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 6 treesize of output 5 [2019-01-20 10:29:01,623 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:29:01,652 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:29:01,652 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:29:02,735 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:29:02,736 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:29:05,149 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:29:05,167 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:29:05,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 123 [2019-01-20 10:29:05,167 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:29:05,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-01-20 10:29:05,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-01-20 10:29:05,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6930, Invalid=8570, Unknown=0, NotChecked=0, Total=15500 [2019-01-20 10:29:05,170 INFO L87 Difference]: Start difference. First operand 165 states and 165 transitions. Second operand 84 states. [2019-01-20 10:29:05,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:29:05,449 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2019-01-20 10:29:05,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-01-20 10:29:05,449 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 164 [2019-01-20 10:29:05,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:29:05,450 INFO L225 Difference]: With dead ends: 171 [2019-01-20 10:29:05,451 INFO L226 Difference]: Without dead ends: 170 [2019-01-20 10:29:05,452 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6642 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=6930, Invalid=8570, Unknown=0, NotChecked=0, Total=15500 [2019-01-20 10:29:05,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-01-20 10:29:05,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 169. [2019-01-20 10:29:05,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-01-20 10:29:05,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 169 transitions. [2019-01-20 10:29:05,457 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 169 transitions. Word has length 164 [2019-01-20 10:29:05,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:29:05,457 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 169 transitions. [2019-01-20 10:29:05,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-01-20 10:29:05,457 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 169 transitions. [2019-01-20 10:29:05,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-01-20 10:29:05,458 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:29:05,458 INFO L402 BasicCegarLoop]: trace histogram [42, 42, 41, 41, 1, 1] [2019-01-20 10:29:05,458 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:29:05,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:29:05,459 INFO L82 PathProgramCache]: Analyzing trace with hash 69909383, now seen corresponding path program 41 times [2019-01-20 10:29:05,459 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:29:05,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:29:05,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:29:05,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:29:05,460 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:29:05,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:29:06,455 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:29:06,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:29:06,456 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:29:06,456 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:29:06,456 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:29:06,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:29:06,456 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:29:06,464 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:29:06,464 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:29:06,611 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 42 check-sat command(s) [2019-01-20 10:29:06,611 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:29:06,617 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:29:06,633 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 6 treesize of output 5 [2019-01-20 10:29:06,634 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:29:06,728 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:29:06,729 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:29:07,816 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:29:07,816 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:29:10,279 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:29:10,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:29:10,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 126 [2019-01-20 10:29:10,298 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:29:10,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-01-20 10:29:10,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-01-20 10:29:10,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7267, Invalid=8989, Unknown=0, NotChecked=0, Total=16256 [2019-01-20 10:29:10,300 INFO L87 Difference]: Start difference. First operand 169 states and 169 transitions. Second operand 86 states. [2019-01-20 10:29:10,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:29:10,571 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2019-01-20 10:29:10,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-01-20 10:29:10,571 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 168 [2019-01-20 10:29:10,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:29:10,572 INFO L225 Difference]: With dead ends: 175 [2019-01-20 10:29:10,572 INFO L226 Difference]: Without dead ends: 174 [2019-01-20 10:29:10,573 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6972 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=7267, Invalid=8989, Unknown=0, NotChecked=0, Total=16256 [2019-01-20 10:29:10,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-01-20 10:29:10,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 173. [2019-01-20 10:29:10,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-01-20 10:29:10,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2019-01-20 10:29:10,579 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 168 [2019-01-20 10:29:10,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:29:10,579 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 173 transitions. [2019-01-20 10:29:10,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-01-20 10:29:10,579 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 173 transitions. [2019-01-20 10:29:10,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-01-20 10:29:10,580 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:29:10,580 INFO L402 BasicCegarLoop]: trace histogram [43, 43, 42, 42, 1, 1] [2019-01-20 10:29:10,580 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:29:10,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:29:10,581 INFO L82 PathProgramCache]: Analyzing trace with hash 836218944, now seen corresponding path program 42 times [2019-01-20 10:29:10,581 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:29:10,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:29:10,582 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:29:10,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:29:10,582 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:29:10,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:29:12,439 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:29:12,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:29:12,440 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:29:12,440 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:29:12,440 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:29:12,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:29:12,440 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:29:12,448 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:29:12,448 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:29:12,496 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:29:12,496 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:29:12,501 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:29:12,504 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-20 10:29:12,504 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:29:12,513 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:29:12,513 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:29:13,930 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:29:13,930 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:29:16,288 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:29:16,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:29:16,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 129 [2019-01-20 10:29:16,307 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:29:16,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-01-20 10:29:16,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-01-20 10:29:16,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7612, Invalid=9418, Unknown=0, NotChecked=0, Total=17030 [2019-01-20 10:29:16,310 INFO L87 Difference]: Start difference. First operand 173 states and 173 transitions. Second operand 88 states. [2019-01-20 10:29:16,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:29:16,860 INFO L93 Difference]: Finished difference Result 179 states and 179 transitions. [2019-01-20 10:29:16,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-01-20 10:29:16,860 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 172 [2019-01-20 10:29:16,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:29:16,862 INFO L225 Difference]: With dead ends: 179 [2019-01-20 10:29:16,862 INFO L226 Difference]: Without dead ends: 178 [2019-01-20 10:29:16,863 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7310 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=7612, Invalid=9418, Unknown=0, NotChecked=0, Total=17030 [2019-01-20 10:29:16,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-01-20 10:29:16,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 177. [2019-01-20 10:29:16,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-01-20 10:29:16,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 177 transitions. [2019-01-20 10:29:16,869 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 177 transitions. Word has length 172 [2019-01-20 10:29:16,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:29:16,869 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 177 transitions. [2019-01-20 10:29:16,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-01-20 10:29:16,870 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 177 transitions. [2019-01-20 10:29:16,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-01-20 10:29:16,871 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:29:16,871 INFO L402 BasicCegarLoop]: trace histogram [44, 44, 43, 43, 1, 1] [2019-01-20 10:29:16,871 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:29:16,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:29:16,871 INFO L82 PathProgramCache]: Analyzing trace with hash 572104825, now seen corresponding path program 43 times [2019-01-20 10:29:16,871 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:29:16,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:29:16,872 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:29:16,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:29:16,872 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:29:16,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:29:17,928 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:29:17,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:29:17,929 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:29:17,929 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:29:17,929 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:29:17,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:29:17,929 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:29:17,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:29:17,937 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:29:17,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:29:17,990 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:29:18,005 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 6 treesize of output 5 [2019-01-20 10:29:18,006 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:29:18,016 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:29:18,017 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:29:19,227 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:29:19,228 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:29:21,673 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:29:21,691 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:29:21,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 132 [2019-01-20 10:29:21,692 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:29:21,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-01-20 10:29:21,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-01-20 10:29:21,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7965, Invalid=9857, Unknown=0, NotChecked=0, Total=17822 [2019-01-20 10:29:21,695 INFO L87 Difference]: Start difference. First operand 177 states and 177 transitions. Second operand 90 states. [2019-01-20 10:29:21,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:29:21,985 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions. [2019-01-20 10:29:21,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-01-20 10:29:21,985 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 176 [2019-01-20 10:29:21,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:29:21,986 INFO L225 Difference]: With dead ends: 183 [2019-01-20 10:29:21,986 INFO L226 Difference]: Without dead ends: 182 [2019-01-20 10:29:21,988 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7656 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=7965, Invalid=9857, Unknown=0, NotChecked=0, Total=17822 [2019-01-20 10:29:21,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-01-20 10:29:21,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 181. [2019-01-20 10:29:21,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-01-20 10:29:21,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2019-01-20 10:29:21,993 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 176 [2019-01-20 10:29:21,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:29:21,993 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2019-01-20 10:29:21,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-01-20 10:29:21,993 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2019-01-20 10:29:21,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-01-20 10:29:21,994 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:29:21,994 INFO L402 BasicCegarLoop]: trace histogram [45, 45, 44, 44, 1, 1] [2019-01-20 10:29:21,994 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:29:21,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:29:21,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1124518962, now seen corresponding path program 44 times [2019-01-20 10:29:21,995 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:29:21,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:29:21,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:29:21,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:29:21,995 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:29:22,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:29:23,127 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:29:23,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:29:23,128 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:29:23,128 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:29:23,128 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:29:23,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:29:23,128 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:29:23,137 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:29:23,137 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:29:23,292 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 45 check-sat command(s) [2019-01-20 10:29:23,293 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:29:23,298 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:29:23,300 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 6 treesize of output 5 [2019-01-20 10:29:23,300 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:29:23,307 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:29:23,307 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:29:24,809 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:29:24,809 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:29:27,378 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:29:27,397 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:29:27,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 135 [2019-01-20 10:29:27,398 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:29:27,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-01-20 10:29:27,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-01-20 10:29:27,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8326, Invalid=10306, Unknown=0, NotChecked=0, Total=18632 [2019-01-20 10:29:27,399 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 92 states. [2019-01-20 10:29:27,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:29:27,731 INFO L93 Difference]: Finished difference Result 187 states and 187 transitions. [2019-01-20 10:29:27,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-01-20 10:29:27,732 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 180 [2019-01-20 10:29:27,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:29:27,733 INFO L225 Difference]: With dead ends: 187 [2019-01-20 10:29:27,733 INFO L226 Difference]: Without dead ends: 186 [2019-01-20 10:29:27,734 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8010 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=8326, Invalid=10306, Unknown=0, NotChecked=0, Total=18632 [2019-01-20 10:29:27,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-01-20 10:29:27,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 185. [2019-01-20 10:29:27,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-01-20 10:29:27,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 185 transitions. [2019-01-20 10:29:27,740 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 185 transitions. Word has length 180 [2019-01-20 10:29:27,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:29:27,740 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 185 transitions. [2019-01-20 10:29:27,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-01-20 10:29:27,740 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 185 transitions. [2019-01-20 10:29:27,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-01-20 10:29:27,741 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:29:27,742 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 45, 45, 1, 1] [2019-01-20 10:29:27,742 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:29:27,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:29:27,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1919585429, now seen corresponding path program 45 times [2019-01-20 10:29:27,742 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:29:27,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:29:27,743 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:29:27,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:29:27,743 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:29:27,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:29:29,078 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:29:29,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:29:29,079 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:29:29,079 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:29:29,079 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:29:29,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:29:29,079 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:29:29,090 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:29:29,090 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:29:29,141 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:29:29,141 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:29:29,146 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:29:29,149 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 6 treesize of output 5 [2019-01-20 10:29:29,149 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:29:29,161 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:29:29,161 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:29:30,427 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:29:30,427 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:29:33,169 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:29:33,188 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:29:33,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 138 [2019-01-20 10:29:33,188 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:29:33,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-01-20 10:29:33,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-01-20 10:29:33,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8695, Invalid=10765, Unknown=0, NotChecked=0, Total=19460 [2019-01-20 10:29:33,191 INFO L87 Difference]: Start difference. First operand 185 states and 185 transitions. Second operand 94 states. [2019-01-20 10:29:33,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:29:33,524 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2019-01-20 10:29:33,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-01-20 10:29:33,525 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 184 [2019-01-20 10:29:33,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:29:33,526 INFO L225 Difference]: With dead ends: 191 [2019-01-20 10:29:33,526 INFO L226 Difference]: Without dead ends: 190 [2019-01-20 10:29:33,527 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8372 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=8695, Invalid=10765, Unknown=0, NotChecked=0, Total=19460 [2019-01-20 10:29:33,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-01-20 10:29:33,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 189. [2019-01-20 10:29:33,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-01-20 10:29:33,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 189 transitions. [2019-01-20 10:29:33,531 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 189 transitions. Word has length 184 [2019-01-20 10:29:33,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:29:33,532 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 189 transitions. [2019-01-20 10:29:33,532 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-01-20 10:29:33,532 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 189 transitions. [2019-01-20 10:29:33,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-01-20 10:29:33,532 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:29:33,532 INFO L402 BasicCegarLoop]: trace histogram [47, 47, 46, 46, 1, 1] [2019-01-20 10:29:33,533 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:29:33,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:29:33,533 INFO L82 PathProgramCache]: Analyzing trace with hash 362534436, now seen corresponding path program 46 times [2019-01-20 10:29:33,533 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:29:33,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:29:33,534 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:29:33,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:29:33,534 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:29:33,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:29:35,462 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:29:35,462 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:29:35,462 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:29:35,462 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:29:35,462 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:29:35,462 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:29:35,462 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:29:35,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:29:35,472 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:29:35,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:29:35,529 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:29:35,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 6 treesize of output 5 [2019-01-20 10:29:35,532 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:29:35,542 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:29:35,542 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:29:37,765 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:29:37,766 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:29:41,172 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:29:41,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:29:41,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 141 [2019-01-20 10:29:41,192 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:29:41,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-01-20 10:29:41,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-01-20 10:29:41,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9072, Invalid=11234, Unknown=0, NotChecked=0, Total=20306 [2019-01-20 10:29:41,195 INFO L87 Difference]: Start difference. First operand 189 states and 189 transitions. Second operand 96 states. [2019-01-20 10:29:41,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:29:41,525 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2019-01-20 10:29:41,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-01-20 10:29:41,525 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 188 [2019-01-20 10:29:41,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:29:41,527 INFO L225 Difference]: With dead ends: 195 [2019-01-20 10:29:41,527 INFO L226 Difference]: Without dead ends: 194 [2019-01-20 10:29:41,529 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 280 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8742 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=9072, Invalid=11234, Unknown=0, NotChecked=0, Total=20306 [2019-01-20 10:29:41,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-01-20 10:29:41,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 193. [2019-01-20 10:29:41,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-01-20 10:29:41,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 193 transitions. [2019-01-20 10:29:41,534 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 193 transitions. Word has length 188 [2019-01-20 10:29:41,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:29:41,535 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 193 transitions. [2019-01-20 10:29:41,535 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-01-20 10:29:41,535 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 193 transitions. [2019-01-20 10:29:41,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-01-20 10:29:41,536 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:29:41,536 INFO L402 BasicCegarLoop]: trace histogram [48, 48, 47, 47, 1, 1] [2019-01-20 10:29:41,536 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:29:41,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:29:41,536 INFO L82 PathProgramCache]: Analyzing trace with hash -1714408355, now seen corresponding path program 47 times [2019-01-20 10:29:41,536 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:29:41,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:29:41,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:29:41,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:29:41,537 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:29:41,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:29:42,886 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:29:42,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:29:42,887 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:29:42,887 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:29:42,887 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:29:42,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:29:42,887 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:29:42,896 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:29:42,896 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:29:43,070 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 48 check-sat command(s) [2019-01-20 10:29:43,070 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:29:43,077 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:29:43,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 6 treesize of output 5 [2019-01-20 10:29:43,094 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:29:43,189 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:29:43,190 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:29:44,813 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:29:44,814 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:29:47,683 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:29:47,702 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:29:47,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 144 [2019-01-20 10:29:47,702 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:29:47,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-01-20 10:29:47,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-01-20 10:29:47,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9457, Invalid=11713, Unknown=0, NotChecked=0, Total=21170 [2019-01-20 10:29:47,705 INFO L87 Difference]: Start difference. First operand 193 states and 193 transitions. Second operand 98 states. [2019-01-20 10:29:48,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:29:48,066 INFO L93 Difference]: Finished difference Result 199 states and 199 transitions. [2019-01-20 10:29:48,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-01-20 10:29:48,066 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 192 [2019-01-20 10:29:48,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:29:48,067 INFO L225 Difference]: With dead ends: 199 [2019-01-20 10:29:48,067 INFO L226 Difference]: Without dead ends: 198 [2019-01-20 10:29:48,068 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 430 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9120 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=9457, Invalid=11713, Unknown=0, NotChecked=0, Total=21170 [2019-01-20 10:29:48,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-01-20 10:29:48,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 197. [2019-01-20 10:29:48,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-01-20 10:29:48,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 197 transitions. [2019-01-20 10:29:48,073 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 197 transitions. Word has length 192 [2019-01-20 10:29:48,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:29:48,073 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 197 transitions. [2019-01-20 10:29:48,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-01-20 10:29:48,074 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 197 transitions. [2019-01-20 10:29:48,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-01-20 10:29:48,074 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:29:48,074 INFO L402 BasicCegarLoop]: trace histogram [49, 49, 48, 48, 1, 1] [2019-01-20 10:29:48,074 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:29:48,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:29:48,075 INFO L82 PathProgramCache]: Analyzing trace with hash 331927062, now seen corresponding path program 48 times [2019-01-20 10:29:48,075 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:29:48,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:29:48,075 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:29:48,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:29:48,075 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:29:48,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:29:49,664 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:29:49,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:29:49,665 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:29:49,665 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:29:49,665 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:29:49,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:29:49,665 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:29:49,673 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:29:49,673 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:29:49,730 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:29:49,730 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:29:49,736 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:29:49,739 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 6 treesize of output 5 [2019-01-20 10:29:49,739 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:29:49,749 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:29:49,749 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:29:51,211 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:29:51,211 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:29:54,338 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:29:54,357 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:29:54,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 147 [2019-01-20 10:29:54,357 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:29:54,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-01-20 10:29:54,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-01-20 10:29:54,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9850, Invalid=12202, Unknown=0, NotChecked=0, Total=22052 [2019-01-20 10:29:54,359 INFO L87 Difference]: Start difference. First operand 197 states and 197 transitions. Second operand 100 states. [2019-01-20 10:29:54,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:29:54,767 INFO L93 Difference]: Finished difference Result 203 states and 203 transitions. [2019-01-20 10:29:54,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-01-20 10:29:54,767 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 196 [2019-01-20 10:29:54,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:29:54,769 INFO L225 Difference]: With dead ends: 203 [2019-01-20 10:29:54,769 INFO L226 Difference]: Without dead ends: 202 [2019-01-20 10:29:54,770 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9506 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=9850, Invalid=12202, Unknown=0, NotChecked=0, Total=22052 [2019-01-20 10:29:54,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-01-20 10:29:54,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 201. [2019-01-20 10:29:54,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-01-20 10:29:54,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2019-01-20 10:29:54,776 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 196 [2019-01-20 10:29:54,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:29:54,776 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 201 transitions. [2019-01-20 10:29:54,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-01-20 10:29:54,776 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2019-01-20 10:29:54,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-01-20 10:29:54,777 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:29:54,778 INFO L402 BasicCegarLoop]: trace histogram [50, 50, 49, 49, 1, 1] [2019-01-20 10:29:54,778 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:29:54,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:29:54,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1207690063, now seen corresponding path program 49 times [2019-01-20 10:29:54,778 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:29:54,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:29:54,779 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:29:54,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:29:54,779 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:29:54,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:29:56,146 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:29:56,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:29:56,146 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:29:56,146 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:29:56,146 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:29:56,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:29:56,146 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:29:56,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:29:56,157 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:29:56,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:29:56,213 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:29:56,216 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 6 treesize of output 5 [2019-01-20 10:29:56,216 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:29:56,229 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:29:56,229 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:29:57,742 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:29:57,742 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:30:01,237 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:30:01,255 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:30:01,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 150 [2019-01-20 10:30:01,255 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:30:01,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-01-20 10:30:01,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-01-20 10:30:01,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10251, Invalid=12701, Unknown=0, NotChecked=0, Total=22952 [2019-01-20 10:30:01,258 INFO L87 Difference]: Start difference. First operand 201 states and 201 transitions. Second operand 102 states. [2019-01-20 10:30:01,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:30:01,582 INFO L93 Difference]: Finished difference Result 207 states and 207 transitions. [2019-01-20 10:30:01,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-01-20 10:30:01,582 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 200 [2019-01-20 10:30:01,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:30:01,584 INFO L225 Difference]: With dead ends: 207 [2019-01-20 10:30:01,584 INFO L226 Difference]: Without dead ends: 206 [2019-01-20 10:30:01,586 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9900 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=10251, Invalid=12701, Unknown=0, NotChecked=0, Total=22952 [2019-01-20 10:30:01,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-01-20 10:30:01,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 205. [2019-01-20 10:30:01,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-01-20 10:30:01,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 205 transitions. [2019-01-20 10:30:01,591 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 205 transitions. Word has length 200 [2019-01-20 10:30:01,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:30:01,591 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 205 transitions. [2019-01-20 10:30:01,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-01-20 10:30:01,591 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 205 transitions. [2019-01-20 10:30:01,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-01-20 10:30:01,592 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:30:01,592 INFO L402 BasicCegarLoop]: trace histogram [51, 51, 50, 50, 1, 1] [2019-01-20 10:30:01,592 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:30:01,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:30:01,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1438626824, now seen corresponding path program 50 times [2019-01-20 10:30:01,593 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:30:01,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:30:01,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:30:01,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:30:01,593 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:30:01,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:30:02,989 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:30:02,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:30:02,990 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:30:02,990 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:30:02,990 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:30:02,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:30:02,990 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:30:02,999 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:30:02,999 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:30:03,188 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2019-01-20 10:30:03,188 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:30:03,194 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:30:03,197 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 6 treesize of output 5 [2019-01-20 10:30:03,197 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:30:03,206 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:30:03,206 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:30:05,016 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:30:05,017 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:30:08,277 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:30:08,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:30:08,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 151 [2019-01-20 10:30:08,298 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:30:08,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-01-20 10:30:08,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-01-20 10:30:08,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10353, Invalid=12903, Unknown=0, NotChecked=0, Total=23256 [2019-01-20 10:30:08,300 INFO L87 Difference]: Start difference. First operand 205 states and 205 transitions. Second operand 104 states. [2019-01-20 10:30:08,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:30:08,705 INFO L93 Difference]: Finished difference Result 211 states and 211 transitions. [2019-01-20 10:30:08,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-01-20 10:30:08,705 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 204 [2019-01-20 10:30:08,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:30:08,707 INFO L225 Difference]: With dead ends: 211 [2019-01-20 10:30:08,707 INFO L226 Difference]: Without dead ends: 210 [2019-01-20 10:30:08,708 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 457 GetRequests, 304 SyntacticMatches, 2 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10397 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=10353, Invalid=12903, Unknown=0, NotChecked=0, Total=23256 [2019-01-20 10:30:08,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-01-20 10:30:08,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 209. [2019-01-20 10:30:08,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-01-20 10:30:08,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 209 transitions. [2019-01-20 10:30:08,713 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 209 transitions. Word has length 204 [2019-01-20 10:30:08,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:30:08,713 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 209 transitions. [2019-01-20 10:30:08,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-01-20 10:30:08,713 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 209 transitions. [2019-01-20 10:30:08,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-01-20 10:30:08,714 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:30:08,715 INFO L402 BasicCegarLoop]: trace histogram [52, 52, 51, 51, 1, 1] [2019-01-20 10:30:08,715 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:30:08,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:30:08,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1196064833, now seen corresponding path program 51 times [2019-01-20 10:30:08,715 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:30:08,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:30:08,716 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:30:08,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:30:08,716 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:30:08,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:30:10,756 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:30:10,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:30:10,756 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:30:10,756 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:30:10,756 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:30:10,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:30:10,756 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:30:10,765 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:30:10,765 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:30:10,843 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:30:10,843 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:30:10,852 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:30:10,867 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 6 treesize of output 5 [2019-01-20 10:30:10,868 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:30:10,959 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:30:10,959 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:30:12,833 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:30:12,834 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:30:16,472 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:30:16,491 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:30:16,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 152 [2019-01-20 10:30:16,492 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:30:16,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-01-20 10:30:16,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-01-20 10:30:16,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10455, Invalid=13107, Unknown=0, NotChecked=0, Total=23562 [2019-01-20 10:30:16,494 INFO L87 Difference]: Start difference. First operand 209 states and 209 transitions. Second operand 106 states. [2019-01-20 10:30:16,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:30:16,916 INFO L93 Difference]: Finished difference Result 215 states and 215 transitions. [2019-01-20 10:30:16,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-01-20 10:30:16,916 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 208 [2019-01-20 10:30:16,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:30:16,918 INFO L225 Difference]: With dead ends: 215 [2019-01-20 10:30:16,918 INFO L226 Difference]: Without dead ends: 214 [2019-01-20 10:30:16,920 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 466 GetRequests, 310 SyntacticMatches, 4 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10894 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=10455, Invalid=13107, Unknown=0, NotChecked=0, Total=23562 [2019-01-20 10:30:16,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-01-20 10:30:16,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 213. [2019-01-20 10:30:16,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-01-20 10:30:16,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 213 transitions. [2019-01-20 10:30:16,925 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 213 transitions. Word has length 208 [2019-01-20 10:30:16,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:30:16,925 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 213 transitions. [2019-01-20 10:30:16,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-01-20 10:30:16,926 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 213 transitions. [2019-01-20 10:30:16,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-01-20 10:30:16,927 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:30:16,927 INFO L402 BasicCegarLoop]: trace histogram [53, 53, 52, 52, 1, 1] [2019-01-20 10:30:16,927 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:30:16,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:30:16,928 INFO L82 PathProgramCache]: Analyzing trace with hash -1582135302, now seen corresponding path program 52 times [2019-01-20 10:30:16,928 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:30:16,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:30:16,929 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:30:16,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:30:16,929 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:30:16,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:30:18,367 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:30:18,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:30:18,368 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:30:18,368 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:30:18,368 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:30:18,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:30:18,368 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:30:18,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:30:18,377 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:30:18,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:30:18,437 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:30:18,457 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 6 treesize of output 5 [2019-01-20 10:30:18,457 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:30:18,493 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:30:18,494 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:30:20,475 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:30:20,475 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:30:23,881 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:30:23,900 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:30:23,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 153 [2019-01-20 10:30:23,901 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:30:23,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-01-20 10:30:23,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-01-20 10:30:23,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10557, Invalid=13313, Unknown=0, NotChecked=0, Total=23870 [2019-01-20 10:30:23,903 INFO L87 Difference]: Start difference. First operand 213 states and 213 transitions. Second operand 108 states. [2019-01-20 10:30:24,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:30:24,266 INFO L93 Difference]: Finished difference Result 219 states and 219 transitions. [2019-01-20 10:30:24,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-01-20 10:30:24,266 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 212 [2019-01-20 10:30:24,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:30:24,268 INFO L225 Difference]: With dead ends: 219 [2019-01-20 10:30:24,268 INFO L226 Difference]: Without dead ends: 218 [2019-01-20 10:30:24,269 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 475 GetRequests, 316 SyntacticMatches, 6 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11391 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=10557, Invalid=13313, Unknown=0, NotChecked=0, Total=23870 [2019-01-20 10:30:24,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-01-20 10:30:24,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 217. [2019-01-20 10:30:24,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-01-20 10:30:24,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 217 transitions. [2019-01-20 10:30:24,274 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 217 transitions. Word has length 212 [2019-01-20 10:30:24,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:30:24,274 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 217 transitions. [2019-01-20 10:30:24,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-01-20 10:30:24,274 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 217 transitions. [2019-01-20 10:30:24,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-01-20 10:30:24,275 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:30:24,275 INFO L402 BasicCegarLoop]: trace histogram [54, 54, 53, 53, 1, 1] [2019-01-20 10:30:24,275 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:30:24,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:30:24,276 INFO L82 PathProgramCache]: Analyzing trace with hash -185726157, now seen corresponding path program 53 times [2019-01-20 10:30:24,276 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:30:24,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:30:24,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:30:24,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:30:24,276 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:30:24,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:30:26,031 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:30:26,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:30:26,032 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:30:26,032 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:30:26,032 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:30:26,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:30:26,032 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:30:26,043 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:30:26,043 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:30:26,245 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 54 check-sat command(s) [2019-01-20 10:30:26,245 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:30:26,251 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:30:26,256 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 6 treesize of output 5 [2019-01-20 10:30:26,256 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:30:26,268 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:30:26,268 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:30:27,995 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:30:27,996 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:30:31,686 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:30:31,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:30:31,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 154 [2019-01-20 10:30:31,706 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:30:31,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-01-20 10:30:31,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-01-20 10:30:31,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10659, Invalid=13521, Unknown=0, NotChecked=0, Total=24180 [2019-01-20 10:30:31,708 INFO L87 Difference]: Start difference. First operand 217 states and 217 transitions. Second operand 110 states. [2019-01-20 10:30:32,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:30:32,092 INFO L93 Difference]: Finished difference Result 223 states and 223 transitions. [2019-01-20 10:30:32,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-01-20 10:30:32,092 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 216 [2019-01-20 10:30:32,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:30:32,094 INFO L225 Difference]: With dead ends: 223 [2019-01-20 10:30:32,094 INFO L226 Difference]: Without dead ends: 222 [2019-01-20 10:30:32,095 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 484 GetRequests, 322 SyntacticMatches, 8 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11888 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=10659, Invalid=13521, Unknown=0, NotChecked=0, Total=24180 [2019-01-20 10:30:32,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-01-20 10:30:32,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 221. [2019-01-20 10:30:32,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-01-20 10:30:32,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 221 transitions. [2019-01-20 10:30:32,099 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 221 transitions. Word has length 216 [2019-01-20 10:30:32,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:30:32,099 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 221 transitions. [2019-01-20 10:30:32,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2019-01-20 10:30:32,100 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 221 transitions. [2019-01-20 10:30:32,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-01-20 10:30:32,101 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:30:32,101 INFO L402 BasicCegarLoop]: trace histogram [55, 55, 54, 54, 1, 1] [2019-01-20 10:30:32,101 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:30:32,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:30:32,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1809009132, now seen corresponding path program 54 times [2019-01-20 10:30:32,101 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:30:32,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:30:32,102 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:30:32,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:30:32,102 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:30:32,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:30:33,634 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:30:33,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:30:33,634 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:30:33,634 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:30:33,634 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:30:33,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:30:33,634 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:30:33,643 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:30:33,643 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:30:33,709 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:30:33,709 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:30:33,715 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:30:33,718 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-20 10:30:33,719 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:30:33,729 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:30:33,729 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:30:35,795 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:30:35,795 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:30:39,220 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:30:39,238 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:30:39,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 155 [2019-01-20 10:30:39,239 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:30:39,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-01-20 10:30:39,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-01-20 10:30:39,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10761, Invalid=13731, Unknown=0, NotChecked=0, Total=24492 [2019-01-20 10:30:39,241 INFO L87 Difference]: Start difference. First operand 221 states and 221 transitions. Second operand 112 states. [2019-01-20 10:30:39,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:30:39,699 INFO L93 Difference]: Finished difference Result 227 states and 227 transitions. [2019-01-20 10:30:39,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-01-20 10:30:39,699 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 220 [2019-01-20 10:30:39,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:30:39,701 INFO L225 Difference]: With dead ends: 227 [2019-01-20 10:30:39,701 INFO L226 Difference]: Without dead ends: 226 [2019-01-20 10:30:39,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 493 GetRequests, 328 SyntacticMatches, 10 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12385 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=10761, Invalid=13731, Unknown=0, NotChecked=0, Total=24492 [2019-01-20 10:30:39,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-01-20 10:30:39,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 225. [2019-01-20 10:30:39,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-01-20 10:30:39,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 225 transitions. [2019-01-20 10:30:39,707 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 225 transitions. Word has length 220 [2019-01-20 10:30:39,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:30:39,707 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 225 transitions. [2019-01-20 10:30:39,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-01-20 10:30:39,708 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 225 transitions. [2019-01-20 10:30:39,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-01-20 10:30:39,709 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:30:39,709 INFO L402 BasicCegarLoop]: trace histogram [56, 56, 55, 55, 1, 1] [2019-01-20 10:30:39,709 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:30:39,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:30:39,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1545110565, now seen corresponding path program 55 times [2019-01-20 10:30:39,710 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:30:39,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:30:39,710 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:30:39,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:30:39,711 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:30:39,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:30:41,409 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:30:41,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:30:41,409 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:30:41,409 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:30:41,409 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:30:41,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:30:41,409 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:30:41,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:30:41,419 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:30:41,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:30:41,484 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:30:41,491 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-20 10:30:41,491 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:30:41,506 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:30:41,506 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:30:43,416 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:30:43,416 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:30:47,080 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:30:47,100 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:30:47,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 156 [2019-01-20 10:30:47,100 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:30:47,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2019-01-20 10:30:47,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2019-01-20 10:30:47,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10863, Invalid=13943, Unknown=0, NotChecked=0, Total=24806 [2019-01-20 10:30:47,102 INFO L87 Difference]: Start difference. First operand 225 states and 225 transitions. Second operand 114 states. [2019-01-20 10:30:47,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:30:47,549 INFO L93 Difference]: Finished difference Result 231 states and 231 transitions. [2019-01-20 10:30:47,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-01-20 10:30:47,550 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 224 [2019-01-20 10:30:47,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:30:47,551 INFO L225 Difference]: With dead ends: 231 [2019-01-20 10:30:47,551 INFO L226 Difference]: Without dead ends: 230 [2019-01-20 10:30:47,553 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 502 GetRequests, 334 SyntacticMatches, 12 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12882 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=10863, Invalid=13943, Unknown=0, NotChecked=0, Total=24806 [2019-01-20 10:30:47,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-01-20 10:30:47,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 229. [2019-01-20 10:30:47,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-01-20 10:30:47,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 229 transitions. [2019-01-20 10:30:47,558 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 229 transitions. Word has length 224 [2019-01-20 10:30:47,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:30:47,558 INFO L480 AbstractCegarLoop]: Abstraction has 229 states and 229 transitions. [2019-01-20 10:30:47,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2019-01-20 10:30:47,558 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 229 transitions. [2019-01-20 10:30:47,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-01-20 10:30:47,560 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:30:47,560 INFO L402 BasicCegarLoop]: trace histogram [57, 57, 56, 56, 1, 1] [2019-01-20 10:30:47,560 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:30:47,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:30:47,560 INFO L82 PathProgramCache]: Analyzing trace with hash -699139618, now seen corresponding path program 56 times [2019-01-20 10:30:47,561 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:30:47,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:30:47,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:30:47,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:30:47,561 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:30:47,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:30:49,229 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:30:49,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:30:49,230 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:30:49,230 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:30:49,230 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:30:49,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:30:49,230 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:30:49,239 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:30:49,239 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:30:49,473 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 57 check-sat command(s) [2019-01-20 10:30:49,473 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:30:49,479 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:30:49,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 6 treesize of output 5 [2019-01-20 10:30:49,482 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:30:49,494 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:30:49,494 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:30:51,660 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:30:51,660 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:30:55,198 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:30:55,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:30:55,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 157 [2019-01-20 10:30:55,217 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:30:55,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2019-01-20 10:30:55,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2019-01-20 10:30:55,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10965, Invalid=14157, Unknown=0, NotChecked=0, Total=25122 [2019-01-20 10:30:55,220 INFO L87 Difference]: Start difference. First operand 229 states and 229 transitions. Second operand 116 states. [2019-01-20 10:30:55,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:30:55,744 INFO L93 Difference]: Finished difference Result 235 states and 235 transitions. [2019-01-20 10:30:55,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-01-20 10:30:55,745 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 228 [2019-01-20 10:30:55,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:30:55,746 INFO L225 Difference]: With dead ends: 235 [2019-01-20 10:30:55,746 INFO L226 Difference]: Without dead ends: 234 [2019-01-20 10:30:55,748 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 511 GetRequests, 340 SyntacticMatches, 14 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13379 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=10965, Invalid=14157, Unknown=0, NotChecked=0, Total=25122 [2019-01-20 10:30:55,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-01-20 10:30:55,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 233. [2019-01-20 10:30:55,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-01-20 10:30:55,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 233 transitions. [2019-01-20 10:30:55,752 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 233 transitions. Word has length 228 [2019-01-20 10:30:55,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:30:55,752 INFO L480 AbstractCegarLoop]: Abstraction has 233 states and 233 transitions. [2019-01-20 10:30:55,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2019-01-20 10:30:55,753 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 233 transitions. [2019-01-20 10:30:55,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-01-20 10:30:55,754 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:30:55,754 INFO L402 BasicCegarLoop]: trace histogram [58, 58, 57, 57, 1, 1] [2019-01-20 10:30:55,754 INFO L423 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:30:55,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:30:55,754 INFO L82 PathProgramCache]: Analyzing trace with hash 905702167, now seen corresponding path program 57 times [2019-01-20 10:30:55,754 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:30:55,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:30:55,755 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:30:55,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:30:55,755 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:30:55,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:30:57,501 INFO L134 CoverageAnalysis]: Checked inductivity of 6555 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:30:57,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:30:57,501 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:30:57,501 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:30:57,501 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:30:57,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:30:57,501 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:30:57,509 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:30:57,509 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:30:57,577 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:30:57,577 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:30:57,583 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:30:57,590 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 6 treesize of output 5 [2019-01-20 10:30:57,590 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:30:57,602 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:30:57,603 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:30:59,690 INFO L134 CoverageAnalysis]: Checked inductivity of 6555 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:30:59,690 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:31:03,577 INFO L134 CoverageAnalysis]: Checked inductivity of 6555 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:31:03,597 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:31:03,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 158 [2019-01-20 10:31:03,597 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:31:03,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2019-01-20 10:31:03,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2019-01-20 10:31:03,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11067, Invalid=14373, Unknown=0, NotChecked=0, Total=25440 [2019-01-20 10:31:03,600 INFO L87 Difference]: Start difference. First operand 233 states and 233 transitions. Second operand 118 states. [2019-01-20 10:31:04,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:31:04,056 INFO L93 Difference]: Finished difference Result 239 states and 239 transitions. [2019-01-20 10:31:04,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-01-20 10:31:04,057 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 232 [2019-01-20 10:31:04,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:31:04,058 INFO L225 Difference]: With dead ends: 239 [2019-01-20 10:31:04,058 INFO L226 Difference]: Without dead ends: 238 [2019-01-20 10:31:04,059 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 520 GetRequests, 346 SyntacticMatches, 16 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13876 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=11067, Invalid=14373, Unknown=0, NotChecked=0, Total=25440 [2019-01-20 10:31:04,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2019-01-20 10:31:04,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 237. [2019-01-20 10:31:04,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-01-20 10:31:04,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 237 transitions. [2019-01-20 10:31:04,063 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 237 transitions. Word has length 232 [2019-01-20 10:31:04,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:31:04,063 INFO L480 AbstractCegarLoop]: Abstraction has 237 states and 237 transitions. [2019-01-20 10:31:04,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2019-01-20 10:31:04,063 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 237 transitions. [2019-01-20 10:31:04,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-01-20 10:31:04,064 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:31:04,064 INFO L402 BasicCegarLoop]: trace histogram [59, 59, 58, 58, 1, 1] [2019-01-20 10:31:04,065 INFO L423 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:31:04,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:31:04,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1318676528, now seen corresponding path program 58 times [2019-01-20 10:31:04,065 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:31:04,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:31:04,065 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:31:04,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:31:04,066 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:31:04,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:31:05,885 INFO L134 CoverageAnalysis]: Checked inductivity of 6786 backedges. 0 proven. 6786 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:31:05,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:31:05,886 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:31:05,886 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:31:05,886 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:31:05,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:31:05,886 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:31:05,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:31:05,897 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:31:05,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:31:05,966 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:31:05,969 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-20 10:31:05,969 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:31:05,982 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:31:05,982 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:31:08,190 INFO L134 CoverageAnalysis]: Checked inductivity of 6786 backedges. 0 proven. 6786 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:31:08,190 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:31:11,992 INFO L134 CoverageAnalysis]: Checked inductivity of 6786 backedges. 0 proven. 6786 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:31:12,012 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:31:12,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 159 [2019-01-20 10:31:12,013 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:31:12,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 120 states [2019-01-20 10:31:12,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2019-01-20 10:31:12,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11169, Invalid=14591, Unknown=0, NotChecked=0, Total=25760 [2019-01-20 10:31:12,015 INFO L87 Difference]: Start difference. First operand 237 states and 237 transitions. Second operand 120 states. [2019-01-20 10:31:12,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:31:12,480 INFO L93 Difference]: Finished difference Result 243 states and 243 transitions. [2019-01-20 10:31:12,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-01-20 10:31:12,481 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 236 [2019-01-20 10:31:12,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:31:12,482 INFO L225 Difference]: With dead ends: 243 [2019-01-20 10:31:12,482 INFO L226 Difference]: Without dead ends: 242 [2019-01-20 10:31:12,483 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 529 GetRequests, 352 SyntacticMatches, 18 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14373 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=11169, Invalid=14591, Unknown=0, NotChecked=0, Total=25760 [2019-01-20 10:31:12,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-01-20 10:31:12,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 241. [2019-01-20 10:31:12,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-01-20 10:31:12,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 241 transitions. [2019-01-20 10:31:12,487 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 241 transitions. Word has length 236 [2019-01-20 10:31:12,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:31:12,488 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 241 transitions. [2019-01-20 10:31:12,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has 120 states. [2019-01-20 10:31:12,488 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 241 transitions. [2019-01-20 10:31:12,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-01-20 10:31:12,488 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:31:12,489 INFO L402 BasicCegarLoop]: trace histogram [60, 60, 59, 59, 1, 1] [2019-01-20 10:31:12,489 INFO L423 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:31:12,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:31:12,489 INFO L82 PathProgramCache]: Analyzing trace with hash -372621303, now seen corresponding path program 59 times [2019-01-20 10:31:12,489 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:31:12,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:31:12,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:31:12,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:31:12,490 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:31:12,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:31:14,258 INFO L134 CoverageAnalysis]: Checked inductivity of 7021 backedges. 0 proven. 7021 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:31:14,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:31:14,258 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:31:14,259 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:31:14,259 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:31:14,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:31:14,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 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:31:14,286 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:31:14,286 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:31:14,546 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 60 check-sat command(s) [2019-01-20 10:31:14,546 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:31:14,552 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:31:14,557 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 6 treesize of output 5 [2019-01-20 10:31:14,558 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:31:14,570 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:31:14,570 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:31:16,914 INFO L134 CoverageAnalysis]: Checked inductivity of 7021 backedges. 0 proven. 7021 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:31:16,915 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:31:20,617 INFO L134 CoverageAnalysis]: Checked inductivity of 7021 backedges. 0 proven. 7021 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:31:20,637 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:31:20,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 160 [2019-01-20 10:31:20,637 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:31:20,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 122 states [2019-01-20 10:31:20,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2019-01-20 10:31:20,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11271, Invalid=14811, Unknown=0, NotChecked=0, Total=26082 [2019-01-20 10:31:20,639 INFO L87 Difference]: Start difference. First operand 241 states and 241 transitions. Second operand 122 states. [2019-01-20 10:31:21,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:31:21,103 INFO L93 Difference]: Finished difference Result 247 states and 247 transitions. [2019-01-20 10:31:21,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-01-20 10:31:21,103 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 240 [2019-01-20 10:31:21,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:31:21,105 INFO L225 Difference]: With dead ends: 247 [2019-01-20 10:31:21,105 INFO L226 Difference]: Without dead ends: 246 [2019-01-20 10:31:21,106 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 538 GetRequests, 358 SyntacticMatches, 20 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14870 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=11271, Invalid=14811, Unknown=0, NotChecked=0, Total=26082 [2019-01-20 10:31:21,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2019-01-20 10:31:21,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 245. [2019-01-20 10:31:21,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-01-20 10:31:21,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 245 transitions. [2019-01-20 10:31:21,113 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 245 transitions. Word has length 240 [2019-01-20 10:31:21,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:31:21,113 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 245 transitions. [2019-01-20 10:31:21,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 122 states. [2019-01-20 10:31:21,113 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 245 transitions. [2019-01-20 10:31:21,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-01-20 10:31:21,114 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:31:21,114 INFO L402 BasicCegarLoop]: trace histogram [61, 61, 60, 60, 1, 1] [2019-01-20 10:31:21,115 INFO L423 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:31:21,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:31:21,115 INFO L82 PathProgramCache]: Analyzing trace with hash 2067604418, now seen corresponding path program 60 times [2019-01-20 10:31:21,115 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:31:21,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:31:21,116 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:31:21,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:31:21,116 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:31:21,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:31:23,261 INFO L134 CoverageAnalysis]: Checked inductivity of 7260 backedges. 0 proven. 7260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:31:23,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:31:23,261 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:31:23,261 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:31:23,261 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:31:23,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:31:23,261 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:31:23,270 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:31:23,270 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:31:23,344 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:31:23,345 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:31:23,351 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:31:23,357 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 6 treesize of output 5 [2019-01-20 10:31:23,357 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:31:23,365 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:31:23,365 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:31:25,757 INFO L134 CoverageAnalysis]: Checked inductivity of 7260 backedges. 0 proven. 7260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:31:25,757 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:31:29,672 INFO L134 CoverageAnalysis]: Checked inductivity of 7260 backedges. 0 proven. 7260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:31:29,691 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:31:29,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 161 [2019-01-20 10:31:29,692 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:31:29,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 124 states [2019-01-20 10:31:29,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2019-01-20 10:31:29,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11373, Invalid=15033, Unknown=0, NotChecked=0, Total=26406 [2019-01-20 10:31:29,694 INFO L87 Difference]: Start difference. First operand 245 states and 245 transitions. Second operand 124 states. [2019-01-20 10:31:30,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:31:30,158 INFO L93 Difference]: Finished difference Result 251 states and 251 transitions. [2019-01-20 10:31:30,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-01-20 10:31:30,159 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 244 [2019-01-20 10:31:30,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:31:30,160 INFO L225 Difference]: With dead ends: 251 [2019-01-20 10:31:30,161 INFO L226 Difference]: Without dead ends: 250 [2019-01-20 10:31:30,162 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 547 GetRequests, 364 SyntacticMatches, 22 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15367 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=11373, Invalid=15033, Unknown=0, NotChecked=0, Total=26406 [2019-01-20 10:31:30,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-01-20 10:31:30,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 249. [2019-01-20 10:31:30,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2019-01-20 10:31:30,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 249 transitions. [2019-01-20 10:31:30,168 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 249 transitions. Word has length 244 [2019-01-20 10:31:30,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:31:30,168 INFO L480 AbstractCegarLoop]: Abstraction has 249 states and 249 transitions. [2019-01-20 10:31:30,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 124 states. [2019-01-20 10:31:30,168 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 249 transitions. [2019-01-20 10:31:30,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-01-20 10:31:30,169 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:31:30,170 INFO L402 BasicCegarLoop]: trace histogram [62, 62, 61, 61, 1, 1] [2019-01-20 10:31:30,170 INFO L423 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:31:30,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:31:30,170 INFO L82 PathProgramCache]: Analyzing trace with hash -1934261509, now seen corresponding path program 61 times [2019-01-20 10:31:30,170 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:31:30,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:31:30,171 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:31:30,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:31:30,171 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:31:30,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:31:32,466 INFO L134 CoverageAnalysis]: Checked inductivity of 7503 backedges. 0 proven. 7503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:31:32,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:31:32,467 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:31:32,467 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:31:32,467 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:31:32,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:31:32,467 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:31:32,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:31:32,477 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:31:32,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:31:32,547 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:31:32,550 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 6 treesize of output 5 [2019-01-20 10:31:32,550 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:31:32,563 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:31:32,563 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:31:34,847 INFO L134 CoverageAnalysis]: Checked inductivity of 7503 backedges. 0 proven. 7503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:31:34,847 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:31:38,815 INFO L134 CoverageAnalysis]: Checked inductivity of 7503 backedges. 0 proven. 7503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:31:38,833 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:31:38,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 162 [2019-01-20 10:31:38,833 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:31:38,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 126 states [2019-01-20 10:31:38,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2019-01-20 10:31:38,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11475, Invalid=15257, Unknown=0, NotChecked=0, Total=26732 [2019-01-20 10:31:38,835 INFO L87 Difference]: Start difference. First operand 249 states and 249 transitions. Second operand 126 states. [2019-01-20 10:31:39,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:31:39,276 INFO L93 Difference]: Finished difference Result 255 states and 255 transitions. [2019-01-20 10:31:39,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-01-20 10:31:39,276 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 248 [2019-01-20 10:31:39,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:31:39,278 INFO L225 Difference]: With dead ends: 255 [2019-01-20 10:31:39,278 INFO L226 Difference]: Without dead ends: 254 [2019-01-20 10:31:39,279 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 556 GetRequests, 370 SyntacticMatches, 24 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15864 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=11475, Invalid=15257, Unknown=0, NotChecked=0, Total=26732 [2019-01-20 10:31:39,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-01-20 10:31:39,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 253. [2019-01-20 10:31:39,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-01-20 10:31:39,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 253 transitions. [2019-01-20 10:31:39,283 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 253 transitions. Word has length 248 [2019-01-20 10:31:39,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:31:39,284 INFO L480 AbstractCegarLoop]: Abstraction has 253 states and 253 transitions. [2019-01-20 10:31:39,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 126 states. [2019-01-20 10:31:39,284 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 253 transitions. [2019-01-20 10:31:39,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-01-20 10:31:39,284 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:31:39,285 INFO L402 BasicCegarLoop]: trace histogram [63, 63, 62, 62, 1, 1] [2019-01-20 10:31:39,285 INFO L423 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:31:39,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:31:39,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1611242932, now seen corresponding path program 62 times [2019-01-20 10:31:39,285 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:31:39,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:31:39,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:31:39,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:31:39,286 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:31:39,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:31:41,225 INFO L134 CoverageAnalysis]: Checked inductivity of 7750 backedges. 0 proven. 7750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:31:41,225 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:31:41,225 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:31:41,226 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:31:41,226 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:31:41,226 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:31:41,226 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:31:41,234 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:31:41,235 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:31:41,512 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 63 check-sat command(s) [2019-01-20 10:31:41,512 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:31:41,520 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:31:41,527 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 6 treesize of output 5 [2019-01-20 10:31:41,527 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:31:41,533 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:31:41,534 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:31:44,125 INFO L134 CoverageAnalysis]: Checked inductivity of 7750 backedges. 0 proven. 7750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:31:44,125 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:31:48,066 INFO L134 CoverageAnalysis]: Checked inductivity of 7750 backedges. 0 proven. 7750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:31:48,084 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:31:48,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 163 [2019-01-20 10:31:48,085 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:31:48,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 128 states [2019-01-20 10:31:48,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2019-01-20 10:31:48,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11577, Invalid=15483, Unknown=0, NotChecked=0, Total=27060 [2019-01-20 10:31:48,088 INFO L87 Difference]: Start difference. First operand 253 states and 253 transitions. Second operand 128 states. [2019-01-20 10:31:48,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:31:48,536 INFO L93 Difference]: Finished difference Result 259 states and 259 transitions. [2019-01-20 10:31:48,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-01-20 10:31:48,537 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 252 [2019-01-20 10:31:48,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:31:48,538 INFO L225 Difference]: With dead ends: 259 [2019-01-20 10:31:48,538 INFO L226 Difference]: Without dead ends: 258 [2019-01-20 10:31:48,538 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 565 GetRequests, 376 SyntacticMatches, 26 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16361 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=11577, Invalid=15483, Unknown=0, NotChecked=0, Total=27060 [2019-01-20 10:31:48,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-01-20 10:31:48,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 257. [2019-01-20 10:31:48,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-01-20 10:31:48,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 257 transitions. [2019-01-20 10:31:48,543 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 257 transitions. Word has length 252 [2019-01-20 10:31:48,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:31:48,543 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 257 transitions. [2019-01-20 10:31:48,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 128 states. [2019-01-20 10:31:48,544 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 257 transitions. [2019-01-20 10:31:48,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-01-20 10:31:48,544 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:31:48,545 INFO L402 BasicCegarLoop]: trace histogram [64, 64, 63, 63, 1, 1] [2019-01-20 10:31:48,545 INFO L423 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:31:48,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:31:48,545 INFO L82 PathProgramCache]: Analyzing trace with hash -504384531, now seen corresponding path program 63 times [2019-01-20 10:31:48,545 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:31:48,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:31:48,546 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:31:48,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:31:48,546 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:31:48,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:31:50,546 INFO L134 CoverageAnalysis]: Checked inductivity of 8001 backedges. 0 proven. 8001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:31:50,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:31:50,547 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:31:50,547 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:31:50,547 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:31:50,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:31:50,547 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:31:50,556 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:31:50,557 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:31:50,630 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:31:50,630 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:31:50,637 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:31:50,639 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 6 treesize of output 5 [2019-01-20 10:31:50,640 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:31:50,649 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:31:50,649 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:31:53,212 INFO L134 CoverageAnalysis]: Checked inductivity of 8001 backedges. 0 proven. 8001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:31:53,212 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:31:57,001 INFO L134 CoverageAnalysis]: Checked inductivity of 8001 backedges. 0 proven. 8001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:31:57,022 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:31:57,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 164 [2019-01-20 10:31:57,023 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:31:57,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 130 states [2019-01-20 10:31:57,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2019-01-20 10:31:57,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11679, Invalid=15711, Unknown=0, NotChecked=0, Total=27390 [2019-01-20 10:31:57,025 INFO L87 Difference]: Start difference. First operand 257 states and 257 transitions. Second operand 130 states. [2019-01-20 10:31:57,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:31:57,566 INFO L93 Difference]: Finished difference Result 263 states and 263 transitions. [2019-01-20 10:31:57,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-01-20 10:31:57,567 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 256 [2019-01-20 10:31:57,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:31:57,568 INFO L225 Difference]: With dead ends: 263 [2019-01-20 10:31:57,569 INFO L226 Difference]: Without dead ends: 262 [2019-01-20 10:31:57,570 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 574 GetRequests, 382 SyntacticMatches, 28 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16858 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=11679, Invalid=15711, Unknown=0, NotChecked=0, Total=27390 [2019-01-20 10:31:57,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-01-20 10:31:57,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 261. [2019-01-20 10:31:57,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-01-20 10:31:57,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 261 transitions. [2019-01-20 10:31:57,576 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 261 transitions. Word has length 256 [2019-01-20 10:31:57,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:31:57,576 INFO L480 AbstractCegarLoop]: Abstraction has 261 states and 261 transitions. [2019-01-20 10:31:57,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 130 states. [2019-01-20 10:31:57,577 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 261 transitions. [2019-01-20 10:31:57,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-01-20 10:31:57,578 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:31:57,578 INFO L402 BasicCegarLoop]: trace histogram [65, 65, 64, 64, 1, 1] [2019-01-20 10:31:57,578 INFO L423 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:31:57,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:31:57,579 INFO L82 PathProgramCache]: Analyzing trace with hash 972948902, now seen corresponding path program 64 times [2019-01-20 10:31:57,579 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:31:57,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:31:57,580 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:31:57,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:31:57,580 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:31:57,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:31:59,633 INFO L134 CoverageAnalysis]: Checked inductivity of 8256 backedges. 0 proven. 8256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:31:59,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:31:59,633 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:31:59,633 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:31:59,634 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:31:59,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:31:59,634 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:31:59,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:31:59,644 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:31:59,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:31:59,715 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:31:59,721 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 6 treesize of output 5 [2019-01-20 10:31:59,722 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:31:59,738 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:31:59,739 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:32:02,252 INFO L134 CoverageAnalysis]: Checked inductivity of 8256 backedges. 0 proven. 8256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:32:02,252 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:32:06,235 INFO L134 CoverageAnalysis]: Checked inductivity of 8256 backedges. 0 proven. 8256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:32:06,254 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:32:06,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 165 [2019-01-20 10:32:06,255 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:32:06,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 132 states [2019-01-20 10:32:06,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2019-01-20 10:32:06,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=15941, Unknown=0, NotChecked=0, Total=27722 [2019-01-20 10:32:06,257 INFO L87 Difference]: Start difference. First operand 261 states and 261 transitions. Second operand 132 states. [2019-01-20 10:32:06,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:32:06,735 INFO L93 Difference]: Finished difference Result 267 states and 267 transitions. [2019-01-20 10:32:06,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-01-20 10:32:06,735 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 260 [2019-01-20 10:32:06,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:32:06,737 INFO L225 Difference]: With dead ends: 267 [2019-01-20 10:32:06,737 INFO L226 Difference]: Without dead ends: 266 [2019-01-20 10:32:06,737 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 583 GetRequests, 388 SyntacticMatches, 30 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17355 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=11781, Invalid=15941, Unknown=0, NotChecked=0, Total=27722 [2019-01-20 10:32:06,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-01-20 10:32:06,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 265. [2019-01-20 10:32:06,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-01-20 10:32:06,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 265 transitions. [2019-01-20 10:32:06,744 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 265 transitions. Word has length 260 [2019-01-20 10:32:06,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:32:06,744 INFO L480 AbstractCegarLoop]: Abstraction has 265 states and 265 transitions. [2019-01-20 10:32:06,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 132 states. [2019-01-20 10:32:06,745 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 265 transitions. [2019-01-20 10:32:06,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2019-01-20 10:32:06,746 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:32:06,746 INFO L402 BasicCegarLoop]: trace histogram [66, 66, 65, 65, 1, 1] [2019-01-20 10:32:06,746 INFO L423 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:32:06,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:32:06,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1521144543, now seen corresponding path program 65 times [2019-01-20 10:32:06,747 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:32:06,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:32:06,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:32:06,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:32:06,748 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:32:06,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:32:09,191 INFO L134 CoverageAnalysis]: Checked inductivity of 8515 backedges. 0 proven. 8515 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:32:09,191 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:32:09,191 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:32:09,191 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:32:09,192 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:32:09,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:32:09,192 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:32:09,200 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:32:09,200 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:32:09,502 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 66 check-sat command(s) [2019-01-20 10:32:09,503 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:32:09,510 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:32:09,513 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-20 10:32:09,513 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:32:09,524 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:32:09,524 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:32:12,050 INFO L134 CoverageAnalysis]: Checked inductivity of 8515 backedges. 0 proven. 8515 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:32:12,050 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:32:16,156 INFO L134 CoverageAnalysis]: Checked inductivity of 8515 backedges. 0 proven. 8515 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:32:16,176 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:32:16,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 166 [2019-01-20 10:32:16,176 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:32:16,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 134 states [2019-01-20 10:32:16,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2019-01-20 10:32:16,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11883, Invalid=16173, Unknown=0, NotChecked=0, Total=28056 [2019-01-20 10:32:16,178 INFO L87 Difference]: Start difference. First operand 265 states and 265 transitions. Second operand 134 states. [2019-01-20 10:32:16,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:32:16,734 INFO L93 Difference]: Finished difference Result 271 states and 271 transitions. [2019-01-20 10:32:16,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-01-20 10:32:16,735 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 264 [2019-01-20 10:32:16,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:32:16,737 INFO L225 Difference]: With dead ends: 271 [2019-01-20 10:32:16,737 INFO L226 Difference]: Without dead ends: 270 [2019-01-20 10:32:16,738 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 592 GetRequests, 394 SyntacticMatches, 32 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17852 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=11883, Invalid=16173, Unknown=0, NotChecked=0, Total=28056 [2019-01-20 10:32:16,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-01-20 10:32:16,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 269. [2019-01-20 10:32:16,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-01-20 10:32:16,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 269 transitions. [2019-01-20 10:32:16,744 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 269 transitions. Word has length 264 [2019-01-20 10:32:16,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:32:16,744 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 269 transitions. [2019-01-20 10:32:16,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 134 states. [2019-01-20 10:32:16,744 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 269 transitions. [2019-01-20 10:32:16,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-01-20 10:32:16,746 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:32:16,746 INFO L402 BasicCegarLoop]: trace histogram [67, 67, 66, 66, 1, 1] [2019-01-20 10:32:16,746 INFO L423 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:32:16,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:32:16,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1857266792, now seen corresponding path program 66 times [2019-01-20 10:32:16,746 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:32:16,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:32:16,747 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:32:16,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:32:16,747 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:32:16,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:32:19,105 INFO L134 CoverageAnalysis]: Checked inductivity of 8778 backedges. 0 proven. 8778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:32:19,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:32:19,106 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:32:19,106 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:32:19,106 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:32:19,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:32:19,106 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:32:19,115 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:32:19,116 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:32:19,196 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:32:19,197 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:32:19,203 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:32:19,206 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 6 treesize of output 5 [2019-01-20 10:32:19,206 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:32:19,216 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:32:19,216 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:32:21,839 INFO L134 CoverageAnalysis]: Checked inductivity of 8778 backedges. 0 proven. 8778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:32:21,840 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:32:26,029 INFO L134 CoverageAnalysis]: Checked inductivity of 8778 backedges. 0 proven. 8778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:32:26,049 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:32:26,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 167 [2019-01-20 10:32:26,049 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:32:26,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 136 states [2019-01-20 10:32:26,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2019-01-20 10:32:26,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11985, Invalid=16407, Unknown=0, NotChecked=0, Total=28392 [2019-01-20 10:32:26,052 INFO L87 Difference]: Start difference. First operand 269 states and 269 transitions. Second operand 136 states. [2019-01-20 10:32:26,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:32:26,553 INFO L93 Difference]: Finished difference Result 275 states and 275 transitions. [2019-01-20 10:32:26,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-01-20 10:32:26,553 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 268 [2019-01-20 10:32:26,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:32:26,554 INFO L225 Difference]: With dead ends: 275 [2019-01-20 10:32:26,554 INFO L226 Difference]: Without dead ends: 274 [2019-01-20 10:32:26,555 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 601 GetRequests, 400 SyntacticMatches, 34 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18349 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=11985, Invalid=16407, Unknown=0, NotChecked=0, Total=28392 [2019-01-20 10:32:26,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-01-20 10:32:26,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 273. [2019-01-20 10:32:26,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2019-01-20 10:32:26,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 273 transitions. [2019-01-20 10:32:26,559 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 273 transitions. Word has length 268 [2019-01-20 10:32:26,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:32:26,560 INFO L480 AbstractCegarLoop]: Abstraction has 273 states and 273 transitions. [2019-01-20 10:32:26,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 136 states. [2019-01-20 10:32:26,560 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 273 transitions. [2019-01-20 10:32:26,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2019-01-20 10:32:26,561 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:32:26,561 INFO L402 BasicCegarLoop]: trace histogram [68, 68, 67, 67, 1, 1] [2019-01-20 10:32:26,561 INFO L423 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:32:26,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:32:26,561 INFO L82 PathProgramCache]: Analyzing trace with hash 370728913, now seen corresponding path program 67 times [2019-01-20 10:32:26,561 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:32:26,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:32:26,562 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:32:26,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:32:26,562 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:32:26,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:32:29,027 INFO L134 CoverageAnalysis]: Checked inductivity of 9045 backedges. 0 proven. 9045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:32:29,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:32:29,027 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:32:29,027 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:32:29,027 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:32:29,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:32:29,027 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:32:29,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:32:29,035 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:32:29,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:32:29,113 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:32:29,119 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-20 10:32:29,119 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:32:29,131 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:32:29,131 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:32:31,909 INFO L134 CoverageAnalysis]: Checked inductivity of 9045 backedges. 0 proven. 9045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:32:31,909 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:32:36,031 INFO L134 CoverageAnalysis]: Checked inductivity of 9045 backedges. 0 proven. 9045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:32:36,050 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:32:36,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 168 [2019-01-20 10:32:36,051 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:32:36,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 138 states [2019-01-20 10:32:36,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2019-01-20 10:32:36,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12087, Invalid=16643, Unknown=0, NotChecked=0, Total=28730 [2019-01-20 10:32:36,054 INFO L87 Difference]: Start difference. First operand 273 states and 273 transitions. Second operand 138 states. [2019-01-20 10:32:36,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:32:36,646 INFO L93 Difference]: Finished difference Result 279 states and 279 transitions. [2019-01-20 10:32:36,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-01-20 10:32:36,646 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 272 [2019-01-20 10:32:36,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:32:36,648 INFO L225 Difference]: With dead ends: 279 [2019-01-20 10:32:36,648 INFO L226 Difference]: Without dead ends: 278 [2019-01-20 10:32:36,649 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 610 GetRequests, 406 SyntacticMatches, 36 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18846 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=12087, Invalid=16643, Unknown=0, NotChecked=0, Total=28730 [2019-01-20 10:32:36,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-01-20 10:32:36,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 277. [2019-01-20 10:32:36,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-01-20 10:32:36,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 277 transitions. [2019-01-20 10:32:36,655 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 277 transitions. Word has length 272 [2019-01-20 10:32:36,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:32:36,656 INFO L480 AbstractCegarLoop]: Abstraction has 277 states and 277 transitions. [2019-01-20 10:32:36,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has 138 states. [2019-01-20 10:32:36,656 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 277 transitions. [2019-01-20 10:32:36,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2019-01-20 10:32:36,657 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:32:36,657 INFO L402 BasicCegarLoop]: trace histogram [69, 69, 68, 68, 1, 1] [2019-01-20 10:32:36,657 INFO L423 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:32:36,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:32:36,658 INFO L82 PathProgramCache]: Analyzing trace with hash -1675190390, now seen corresponding path program 68 times [2019-01-20 10:32:36,658 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:32:36,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:32:36,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:32:36,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:32:36,659 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:32:36,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:32:39,289 INFO L134 CoverageAnalysis]: Checked inductivity of 9316 backedges. 0 proven. 9316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:32:39,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:32:39,289 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:32:39,289 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:32:39,289 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:32:39,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:32:39,289 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:32:39,297 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:32:39,297 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:32:39,635 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 69 check-sat command(s) [2019-01-20 10:32:39,636 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:32:39,642 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:32:39,645 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-20 10:32:39,646 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:32:39,659 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:32:39,659 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:32:42,433 INFO L134 CoverageAnalysis]: Checked inductivity of 9316 backedges. 0 proven. 9316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:32:42,433 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:32:46,600 INFO L134 CoverageAnalysis]: Checked inductivity of 9316 backedges. 0 proven. 9316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:32:46,619 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:32:46,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 169 [2019-01-20 10:32:46,619 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:32:46,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 140 states [2019-01-20 10:32:46,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2019-01-20 10:32:46,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12189, Invalid=16881, Unknown=0, NotChecked=0, Total=29070 [2019-01-20 10:32:46,622 INFO L87 Difference]: Start difference. First operand 277 states and 277 transitions. Second operand 140 states. [2019-01-20 10:32:47,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:32:47,142 INFO L93 Difference]: Finished difference Result 283 states and 283 transitions. [2019-01-20 10:32:47,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-01-20 10:32:47,143 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 276 [2019-01-20 10:32:47,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:32:47,144 INFO L225 Difference]: With dead ends: 283 [2019-01-20 10:32:47,145 INFO L226 Difference]: Without dead ends: 282 [2019-01-20 10:32:47,146 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 619 GetRequests, 412 SyntacticMatches, 38 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19343 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=12189, Invalid=16881, Unknown=0, NotChecked=0, Total=29070 [2019-01-20 10:32:47,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-01-20 10:32:47,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 281. [2019-01-20 10:32:47,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2019-01-20 10:32:47,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 281 transitions. [2019-01-20 10:32:47,152 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 281 transitions. Word has length 276 [2019-01-20 10:32:47,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:32:47,152 INFO L480 AbstractCegarLoop]: Abstraction has 281 states and 281 transitions. [2019-01-20 10:32:47,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has 140 states. [2019-01-20 10:32:47,153 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 281 transitions. [2019-01-20 10:32:47,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2019-01-20 10:32:47,154 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:32:47,154 INFO L402 BasicCegarLoop]: trace histogram [70, 70, 69, 69, 1, 1] [2019-01-20 10:32:47,154 INFO L423 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:32:47,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:32:47,155 INFO L82 PathProgramCache]: Analyzing trace with hash -513025341, now seen corresponding path program 69 times [2019-01-20 10:32:47,155 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:32:47,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:32:47,155 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:32:47,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:32:47,156 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:32:47,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:32:49,880 INFO L134 CoverageAnalysis]: Checked inductivity of 9591 backedges. 0 proven. 9591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:32:49,880 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:32:49,880 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:32:49,880 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:32:49,880 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:32:49,880 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:32:49,880 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:32:49,889 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:32:49,889 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:32:49,971 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:32:49,971 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:32:49,979 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:32:49,982 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-20 10:32:49,983 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:32:49,991 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:32:49,991 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:32:52,807 INFO L134 CoverageAnalysis]: Checked inductivity of 9591 backedges. 0 proven. 9591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:32:52,807 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:32:57,142 INFO L134 CoverageAnalysis]: Checked inductivity of 9591 backedges. 0 proven. 9591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:32:57,160 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:32:57,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 170 [2019-01-20 10:32:57,161 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:32:57,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 142 states [2019-01-20 10:32:57,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2019-01-20 10:32:57,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12291, Invalid=17121, Unknown=0, NotChecked=0, Total=29412 [2019-01-20 10:32:57,163 INFO L87 Difference]: Start difference. First operand 281 states and 281 transitions. Second operand 142 states. [2019-01-20 10:32:57,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:32:57,683 INFO L93 Difference]: Finished difference Result 287 states and 287 transitions. [2019-01-20 10:32:57,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-01-20 10:32:57,684 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 280 [2019-01-20 10:32:57,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:32:57,685 INFO L225 Difference]: With dead ends: 287 [2019-01-20 10:32:57,685 INFO L226 Difference]: Without dead ends: 286 [2019-01-20 10:32:57,687 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 628 GetRequests, 418 SyntacticMatches, 40 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19840 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=12291, Invalid=17121, Unknown=0, NotChecked=0, Total=29412 [2019-01-20 10:32:57,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-01-20 10:32:57,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 285. [2019-01-20 10:32:57,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2019-01-20 10:32:57,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 285 transitions. [2019-01-20 10:32:57,693 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 285 transitions. Word has length 280 [2019-01-20 10:32:57,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:32:57,694 INFO L480 AbstractCegarLoop]: Abstraction has 285 states and 285 transitions. [2019-01-20 10:32:57,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has 142 states. [2019-01-20 10:32:57,694 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 285 transitions. [2019-01-20 10:32:57,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2019-01-20 10:32:57,695 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:32:57,696 INFO L402 BasicCegarLoop]: trace histogram [71, 71, 70, 70, 1, 1] [2019-01-20 10:32:57,696 INFO L423 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:32:57,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:32:57,696 INFO L82 PathProgramCache]: Analyzing trace with hash 1052692860, now seen corresponding path program 70 times [2019-01-20 10:32:57,696 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:32:57,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:32:57,697 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:32:57,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:32:57,697 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:32:57,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:33:00,364 INFO L134 CoverageAnalysis]: Checked inductivity of 9870 backedges. 0 proven. 9870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:33:00,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:33:00,365 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:33:00,365 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:33:00,365 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:33:00,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:33:00,365 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:33:00,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:33:00,373 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:33:00,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:33:00,451 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:33:00,456 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 6 treesize of output 5 [2019-01-20 10:33:00,456 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:33:00,467 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:33:00,467 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:33:03,318 INFO L134 CoverageAnalysis]: Checked inductivity of 9870 backedges. 0 proven. 9870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:33:03,318 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:33:07,732 INFO L134 CoverageAnalysis]: Checked inductivity of 9870 backedges. 0 proven. 9870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:33:07,751 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:33:07,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 171 [2019-01-20 10:33:07,751 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:33:07,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 144 states [2019-01-20 10:33:07,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2019-01-20 10:33:07,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12393, Invalid=17363, Unknown=0, NotChecked=0, Total=29756 [2019-01-20 10:33:07,753 INFO L87 Difference]: Start difference. First operand 285 states and 285 transitions. Second operand 144 states. [2019-01-20 10:33:08,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:33:08,318 INFO L93 Difference]: Finished difference Result 291 states and 291 transitions. [2019-01-20 10:33:08,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-01-20 10:33:08,318 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 284 [2019-01-20 10:33:08,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:33:08,320 INFO L225 Difference]: With dead ends: 291 [2019-01-20 10:33:08,320 INFO L226 Difference]: Without dead ends: 290 [2019-01-20 10:33:08,321 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 637 GetRequests, 424 SyntacticMatches, 42 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20337 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=12393, Invalid=17363, Unknown=0, NotChecked=0, Total=29756 [2019-01-20 10:33:08,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2019-01-20 10:33:08,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 289. [2019-01-20 10:33:08,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-01-20 10:33:08,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 289 transitions. [2019-01-20 10:33:08,326 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 289 transitions. Word has length 284 [2019-01-20 10:33:08,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:33:08,327 INFO L480 AbstractCegarLoop]: Abstraction has 289 states and 289 transitions. [2019-01-20 10:33:08,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 144 states. [2019-01-20 10:33:08,327 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 289 transitions. [2019-01-20 10:33:08,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2019-01-20 10:33:08,328 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:33:08,328 INFO L402 BasicCegarLoop]: trace histogram [72, 72, 71, 71, 1, 1] [2019-01-20 10:33:08,328 INFO L423 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:33:08,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:33:08,328 INFO L82 PathProgramCache]: Analyzing trace with hash 936756149, now seen corresponding path program 71 times [2019-01-20 10:33:08,328 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:33:08,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:33:08,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:33:08,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:33:08,329 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:33:08,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:33:11,131 INFO L134 CoverageAnalysis]: Checked inductivity of 10153 backedges. 0 proven. 10153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:33:11,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:33:11,131 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:33:11,132 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:33:11,132 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:33:11,132 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:33:11,132 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:33:11,139 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:33:11,140 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:33:11,513 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 72 check-sat command(s) [2019-01-20 10:33:11,513 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:33:11,521 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:33:11,527 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 6 treesize of output 5 [2019-01-20 10:33:11,527 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:33:11,536 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:33:11,536 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:33:14,800 INFO L134 CoverageAnalysis]: Checked inductivity of 10153 backedges. 0 proven. 10153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:33:14,801 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:33:18,769 INFO L134 CoverageAnalysis]: Checked inductivity of 10153 backedges. 0 proven. 10153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:33:18,789 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:33:18,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 172 [2019-01-20 10:33:18,789 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:33:18,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 146 states [2019-01-20 10:33:18,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2019-01-20 10:33:18,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12495, Invalid=17607, Unknown=0, NotChecked=0, Total=30102 [2019-01-20 10:33:18,793 INFO L87 Difference]: Start difference. First operand 289 states and 289 transitions. Second operand 146 states. [2019-01-20 10:33:19,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:33:19,475 INFO L93 Difference]: Finished difference Result 295 states and 295 transitions. [2019-01-20 10:33:19,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-01-20 10:33:19,476 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 288 [2019-01-20 10:33:19,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:33:19,477 INFO L225 Difference]: With dead ends: 295 [2019-01-20 10:33:19,477 INFO L226 Difference]: Without dead ends: 294 [2019-01-20 10:33:19,478 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 646 GetRequests, 430 SyntacticMatches, 44 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20834 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=12495, Invalid=17607, Unknown=0, NotChecked=0, Total=30102 [2019-01-20 10:33:19,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-01-20 10:33:19,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 293. [2019-01-20 10:33:19,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2019-01-20 10:33:19,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 293 transitions. [2019-01-20 10:33:19,483 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 293 transitions. Word has length 288 [2019-01-20 10:33:19,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:33:19,483 INFO L480 AbstractCegarLoop]: Abstraction has 293 states and 293 transitions. [2019-01-20 10:33:19,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 146 states. [2019-01-20 10:33:19,484 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 293 transitions. [2019-01-20 10:33:19,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-01-20 10:33:19,485 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:33:19,485 INFO L402 BasicCegarLoop]: trace histogram [73, 73, 72, 72, 1, 1] [2019-01-20 10:33:19,485 INFO L423 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:33:19,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:33:19,486 INFO L82 PathProgramCache]: Analyzing trace with hash 189198702, now seen corresponding path program 72 times [2019-01-20 10:33:19,486 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:33:19,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:33:19,486 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:33:19,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:33:19,487 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:33:19,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:33:22,113 INFO L134 CoverageAnalysis]: Checked inductivity of 10440 backedges. 0 proven. 10440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:33:22,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:33:22,114 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:33:22,114 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:33:22,114 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:33:22,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:33:22,114 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:33:22,123 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:33:22,124 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:33:22,216 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:33:22,216 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:33:22,226 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:33:22,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 6 treesize of output 5 [2019-01-20 10:33:22,243 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:33:22,256 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:33:22,256 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:33:25,546 INFO L134 CoverageAnalysis]: Checked inductivity of 10440 backedges. 0 proven. 10440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:33:25,546 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:33:29,724 INFO L134 CoverageAnalysis]: Checked inductivity of 10440 backedges. 0 proven. 10440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:33:29,744 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:33:29,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 173 [2019-01-20 10:33:29,744 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:33:29,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 148 states [2019-01-20 10:33:29,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2019-01-20 10:33:29,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12597, Invalid=17853, Unknown=0, NotChecked=0, Total=30450 [2019-01-20 10:33:29,747 INFO L87 Difference]: Start difference. First operand 293 states and 293 transitions. Second operand 148 states. [2019-01-20 10:33:30,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:33:30,371 INFO L93 Difference]: Finished difference Result 299 states and 299 transitions. [2019-01-20 10:33:30,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-01-20 10:33:30,372 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 292 [2019-01-20 10:33:30,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:33:30,374 INFO L225 Difference]: With dead ends: 299 [2019-01-20 10:33:30,374 INFO L226 Difference]: Without dead ends: 298 [2019-01-20 10:33:30,375 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 655 GetRequests, 436 SyntacticMatches, 46 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21331 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=12597, Invalid=17853, Unknown=0, NotChecked=0, Total=30450 [2019-01-20 10:33:30,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-01-20 10:33:30,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 297. [2019-01-20 10:33:30,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-01-20 10:33:30,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 297 transitions. [2019-01-20 10:33:30,380 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 297 transitions. Word has length 292 [2019-01-20 10:33:30,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:33:30,380 INFO L480 AbstractCegarLoop]: Abstraction has 297 states and 297 transitions. [2019-01-20 10:33:30,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 148 states. [2019-01-20 10:33:30,380 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 297 transitions. [2019-01-20 10:33:30,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2019-01-20 10:33:30,381 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:33:30,381 INFO L402 BasicCegarLoop]: trace histogram [74, 74, 73, 73, 1, 1] [2019-01-20 10:33:30,382 INFO L423 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:33:30,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:33:30,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1116248743, now seen corresponding path program 73 times [2019-01-20 10:33:30,382 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:33:30,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:33:30,383 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:33:30,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:33:30,383 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:33:30,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:33:33,092 INFO L134 CoverageAnalysis]: Checked inductivity of 10731 backedges. 0 proven. 10731 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:33:33,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:33:33,093 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:33:33,093 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:33:33,093 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:33:33,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:33:33,093 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:33:33,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:33:33,101 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:33:33,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:33:33,194 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:33:33,197 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 6 treesize of output 5 [2019-01-20 10:33:33,197 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:33:33,210 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:33:33,210 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:33:36,704 INFO L134 CoverageAnalysis]: Checked inductivity of 10731 backedges. 0 proven. 10731 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:33:36,704 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:33:41,035 INFO L134 CoverageAnalysis]: Checked inductivity of 10731 backedges. 0 proven. 10731 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:33:41,054 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:33:41,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 174 [2019-01-20 10:33:41,054 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:33:41,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 150 states [2019-01-20 10:33:41,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2019-01-20 10:33:41,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12699, Invalid=18101, Unknown=0, NotChecked=0, Total=30800 [2019-01-20 10:33:41,057 INFO L87 Difference]: Start difference. First operand 297 states and 297 transitions. Second operand 150 states. [2019-01-20 10:33:41,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:33:41,580 INFO L93 Difference]: Finished difference Result 303 states and 303 transitions. [2019-01-20 10:33:41,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-01-20 10:33:41,581 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 296 [2019-01-20 10:33:41,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:33:41,583 INFO L225 Difference]: With dead ends: 303 [2019-01-20 10:33:41,583 INFO L226 Difference]: Without dead ends: 302 [2019-01-20 10:33:41,584 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 664 GetRequests, 442 SyntacticMatches, 48 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21828 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=12699, Invalid=18101, Unknown=0, NotChecked=0, Total=30800 [2019-01-20 10:33:41,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-01-20 10:33:41,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 301. [2019-01-20 10:33:41,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2019-01-20 10:33:41,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 301 transitions. [2019-01-20 10:33:41,588 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 301 transitions. Word has length 296 [2019-01-20 10:33:41,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:33:41,589 INFO L480 AbstractCegarLoop]: Abstraction has 301 states and 301 transitions. [2019-01-20 10:33:41,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 150 states. [2019-01-20 10:33:41,589 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 301 transitions. [2019-01-20 10:33:41,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-01-20 10:33:41,590 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:33:41,590 INFO L402 BasicCegarLoop]: trace histogram [75, 75, 74, 74, 1, 1] [2019-01-20 10:33:41,590 INFO L423 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:33:41,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:33:41,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1106313056, now seen corresponding path program 74 times [2019-01-20 10:33:41,590 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:33:41,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:33:41,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:33:41,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:33:41,591 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:33:41,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:33:44,277 INFO L134 CoverageAnalysis]: Checked inductivity of 11026 backedges. 0 proven. 11026 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:33:44,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:33:44,278 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:33:44,278 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:33:44,278 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:33:44,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:33:44,278 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:33:44,286 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:33:44,286 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:33:44,680 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 75 check-sat command(s) [2019-01-20 10:33:44,680 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:33:44,690 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:33:44,693 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 6 treesize of output 5 [2019-01-20 10:33:44,693 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:33:44,702 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:33:44,702 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:33:48,170 INFO L134 CoverageAnalysis]: Checked inductivity of 11026 backedges. 0 proven. 11026 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:33:48,170 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:33:52,518 INFO L134 CoverageAnalysis]: Checked inductivity of 11026 backedges. 0 proven. 11026 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:33:52,537 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:33:52,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 175 [2019-01-20 10:33:52,537 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:33:52,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 152 states [2019-01-20 10:33:52,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2019-01-20 10:33:52,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12801, Invalid=18351, Unknown=0, NotChecked=0, Total=31152 [2019-01-20 10:33:52,540 INFO L87 Difference]: Start difference. First operand 301 states and 301 transitions. Second operand 152 states. [2019-01-20 10:33:53,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:33:53,183 INFO L93 Difference]: Finished difference Result 307 states and 307 transitions. [2019-01-20 10:33:53,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-01-20 10:33:53,184 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 300 [2019-01-20 10:33:53,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:33:53,185 INFO L225 Difference]: With dead ends: 307 [2019-01-20 10:33:53,186 INFO L226 Difference]: Without dead ends: 306 [2019-01-20 10:33:53,187 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 673 GetRequests, 448 SyntacticMatches, 50 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22325 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=12801, Invalid=18351, Unknown=0, NotChecked=0, Total=31152 [2019-01-20 10:33:53,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-01-20 10:33:53,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 305. [2019-01-20 10:33:53,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2019-01-20 10:33:53,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 305 transitions. [2019-01-20 10:33:53,192 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 305 transitions. Word has length 300 [2019-01-20 10:33:53,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:33:53,192 INFO L480 AbstractCegarLoop]: Abstraction has 305 states and 305 transitions. [2019-01-20 10:33:53,192 INFO L481 AbstractCegarLoop]: Interpolant automaton has 152 states. [2019-01-20 10:33:53,193 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 305 transitions. [2019-01-20 10:33:53,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2019-01-20 10:33:53,194 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:33:53,194 INFO L402 BasicCegarLoop]: trace histogram [76, 76, 75, 75, 1, 1] [2019-01-20 10:33:53,194 INFO L423 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:33:53,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:33:53,194 INFO L82 PathProgramCache]: Analyzing trace with hash -659136615, now seen corresponding path program 75 times [2019-01-20 10:33:53,194 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:33:53,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:33:53,195 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:33:53,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:33:53,195 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:33:53,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:33:56,200 INFO L134 CoverageAnalysis]: Checked inductivity of 11325 backedges. 0 proven. 11325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:33:56,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:33:56,200 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:33:56,200 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:33:56,200 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:33:56,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:33:56,200 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:33:56,210 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:33:56,210 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:33:56,299 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:33:56,299 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:33:56,307 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:33:56,310 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-20 10:33:56,310 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:33:56,318 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:33:56,319 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:33:59,559 INFO L134 CoverageAnalysis]: Checked inductivity of 11325 backedges. 0 proven. 11325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:33:59,560 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:34:04,066 INFO L134 CoverageAnalysis]: Checked inductivity of 11325 backedges. 0 proven. 11325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:34:04,085 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:34:04,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 176 [2019-01-20 10:34:04,086 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:34:04,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 154 states [2019-01-20 10:34:04,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2019-01-20 10:34:04,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12903, Invalid=18603, Unknown=0, NotChecked=0, Total=31506 [2019-01-20 10:34:04,088 INFO L87 Difference]: Start difference. First operand 305 states and 305 transitions. Second operand 154 states. [2019-01-20 10:34:04,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:34:04,695 INFO L93 Difference]: Finished difference Result 311 states and 311 transitions. [2019-01-20 10:34:04,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-01-20 10:34:04,695 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 304 [2019-01-20 10:34:04,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:34:04,697 INFO L225 Difference]: With dead ends: 311 [2019-01-20 10:34:04,697 INFO L226 Difference]: Without dead ends: 310 [2019-01-20 10:34:04,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 682 GetRequests, 454 SyntacticMatches, 52 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22822 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=12903, Invalid=18603, Unknown=0, NotChecked=0, Total=31506 [2019-01-20 10:34:04,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2019-01-20 10:34:04,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 309. [2019-01-20 10:34:04,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2019-01-20 10:34:04,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 309 transitions. [2019-01-20 10:34:04,703 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 309 transitions. Word has length 304 [2019-01-20 10:34:04,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:34:04,703 INFO L480 AbstractCegarLoop]: Abstraction has 309 states and 309 transitions. [2019-01-20 10:34:04,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has 154 states. [2019-01-20 10:34:04,703 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 309 transitions. [2019-01-20 10:34:04,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-01-20 10:34:04,704 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:34:04,704 INFO L402 BasicCegarLoop]: trace histogram [77, 77, 76, 76, 1, 1] [2019-01-20 10:34:04,704 INFO L423 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:34:04,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:34:04,705 INFO L82 PathProgramCache]: Analyzing trace with hash -789644462, now seen corresponding path program 76 times [2019-01-20 10:34:04,705 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:34:04,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:34:04,705 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:34:04,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:34:04,706 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:34:04,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:34:07,789 INFO L134 CoverageAnalysis]: Checked inductivity of 11628 backedges. 0 proven. 11628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:34:07,790 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:34:07,790 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:34:07,790 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:34:07,790 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:34:07,790 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:34:07,790 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:34:07,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:34:07,798 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:34:07,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:34:07,886 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:34:07,892 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-20 10:34:07,892 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:34:07,901 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:34:07,901 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:34:11,661 INFO L134 CoverageAnalysis]: Checked inductivity of 11628 backedges. 0 proven. 11628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:34:11,662 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:34:16,074 INFO L134 CoverageAnalysis]: Checked inductivity of 11628 backedges. 0 proven. 11628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:34:16,093 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:34:16,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 177 [2019-01-20 10:34:16,093 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:34:16,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 156 states [2019-01-20 10:34:16,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2019-01-20 10:34:16,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13005, Invalid=18857, Unknown=0, NotChecked=0, Total=31862 [2019-01-20 10:34:16,097 INFO L87 Difference]: Start difference. First operand 309 states and 309 transitions. Second operand 156 states. [2019-01-20 10:34:16,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:34:16,729 INFO L93 Difference]: Finished difference Result 315 states and 315 transitions. [2019-01-20 10:34:16,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-01-20 10:34:16,730 INFO L78 Accepts]: Start accepts. Automaton has 156 states. Word has length 308 [2019-01-20 10:34:16,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:34:16,731 INFO L225 Difference]: With dead ends: 315 [2019-01-20 10:34:16,731 INFO L226 Difference]: Without dead ends: 314 [2019-01-20 10:34:16,732 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 691 GetRequests, 460 SyntacticMatches, 54 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23319 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=13005, Invalid=18857, Unknown=0, NotChecked=0, Total=31862 [2019-01-20 10:34:16,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-01-20 10:34:16,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 313. [2019-01-20 10:34:16,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2019-01-20 10:34:16,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 313 transitions. [2019-01-20 10:34:16,737 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 313 transitions. Word has length 308 [2019-01-20 10:34:16,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:34:16,738 INFO L480 AbstractCegarLoop]: Abstraction has 313 states and 313 transitions. [2019-01-20 10:34:16,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has 156 states. [2019-01-20 10:34:16,738 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 313 transitions. [2019-01-20 10:34:16,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-01-20 10:34:16,739 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:34:16,739 INFO L402 BasicCegarLoop]: trace histogram [78, 78, 77, 77, 1, 1] [2019-01-20 10:34:16,739 INFO L423 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:34:16,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:34:16,739 INFO L82 PathProgramCache]: Analyzing trace with hash 2140213899, now seen corresponding path program 77 times [2019-01-20 10:34:16,739 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:34:16,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:34:16,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:34:16,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:34:16,740 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:34:16,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:34:19,738 INFO L134 CoverageAnalysis]: Checked inductivity of 11935 backedges. 0 proven. 11935 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:34:19,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:34:19,738 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:34:19,738 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:34:19,738 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:34:19,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:34:19,739 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:34:19,747 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:34:19,747 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:34:20,180 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 78 check-sat command(s) [2019-01-20 10:34:20,180 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:34:20,189 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:34:20,194 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 6 treesize of output 5 [2019-01-20 10:34:20,195 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:34:20,217 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:34:20,217 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:34:23,895 INFO L134 CoverageAnalysis]: Checked inductivity of 11935 backedges. 0 proven. 11935 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:34:23,895 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:34:28,329 INFO L134 CoverageAnalysis]: Checked inductivity of 11935 backedges. 0 proven. 11935 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:34:28,348 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:34:28,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 178 [2019-01-20 10:34:28,348 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:34:28,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 158 states [2019-01-20 10:34:28,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 158 interpolants. [2019-01-20 10:34:28,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13107, Invalid=19113, Unknown=0, NotChecked=0, Total=32220 [2019-01-20 10:34:28,351 INFO L87 Difference]: Start difference. First operand 313 states and 313 transitions. Second operand 158 states. [2019-01-20 10:34:28,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:34:28,992 INFO L93 Difference]: Finished difference Result 319 states and 319 transitions. [2019-01-20 10:34:28,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-01-20 10:34:28,993 INFO L78 Accepts]: Start accepts. Automaton has 158 states. Word has length 312 [2019-01-20 10:34:28,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:34:28,995 INFO L225 Difference]: With dead ends: 319 [2019-01-20 10:34:28,995 INFO L226 Difference]: Without dead ends: 318 [2019-01-20 10:34:28,996 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 700 GetRequests, 466 SyntacticMatches, 56 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23816 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=13107, Invalid=19113, Unknown=0, NotChecked=0, Total=32220 [2019-01-20 10:34:28,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-01-20 10:34:29,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 317. [2019-01-20 10:34:29,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2019-01-20 10:34:29,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 317 transitions. [2019-01-20 10:34:29,001 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 317 transitions. Word has length 312 [2019-01-20 10:34:29,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:34:29,001 INFO L480 AbstractCegarLoop]: Abstraction has 317 states and 317 transitions. [2019-01-20 10:34:29,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has 158 states. [2019-01-20 10:34:29,001 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 317 transitions. [2019-01-20 10:34:29,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-01-20 10:34:29,002 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:34:29,003 INFO L402 BasicCegarLoop]: trace histogram [79, 79, 78, 78, 1, 1] [2019-01-20 10:34:29,003 INFO L423 AbstractCegarLoop]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:34:29,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:34:29,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1416815940, now seen corresponding path program 78 times [2019-01-20 10:34:29,003 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:34:29,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:34:29,004 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:34:29,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:34:29,004 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:34:29,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:34:32,305 INFO L134 CoverageAnalysis]: Checked inductivity of 12246 backedges. 0 proven. 12246 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:34:32,306 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:34:32,306 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:34:32,306 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:34:32,306 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:34:32,306 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:34:32,306 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:34:32,314 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:34:32,314 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:34:32,411 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:34:32,411 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:34:32,420 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:34:32,424 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 6 treesize of output 5 [2019-01-20 10:34:32,424 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:34:32,437 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:34:32,437 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:34:36,169 INFO L134 CoverageAnalysis]: Checked inductivity of 12246 backedges. 0 proven. 12246 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:34:36,170 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:34:40,368 INFO L134 CoverageAnalysis]: Checked inductivity of 12246 backedges. 0 proven. 12246 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:34:40,386 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:34:40,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 179 [2019-01-20 10:34:40,387 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:34:40,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 160 states [2019-01-20 10:34:40,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 160 interpolants. [2019-01-20 10:34:40,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13209, Invalid=19371, Unknown=0, NotChecked=0, Total=32580 [2019-01-20 10:34:40,390 INFO L87 Difference]: Start difference. First operand 317 states and 317 transitions. Second operand 160 states. [2019-01-20 10:34:41,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:34:41,159 INFO L93 Difference]: Finished difference Result 323 states and 323 transitions. [2019-01-20 10:34:41,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-01-20 10:34:41,160 INFO L78 Accepts]: Start accepts. Automaton has 160 states. Word has length 316 [2019-01-20 10:34:41,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:34:41,161 INFO L225 Difference]: With dead ends: 323 [2019-01-20 10:34:41,161 INFO L226 Difference]: Without dead ends: 322 [2019-01-20 10:34:41,162 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 709 GetRequests, 472 SyntacticMatches, 58 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24313 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=13209, Invalid=19371, Unknown=0, NotChecked=0, Total=32580 [2019-01-20 10:34:41,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-01-20 10:34:41,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 321. [2019-01-20 10:34:41,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2019-01-20 10:34:41,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 321 transitions. [2019-01-20 10:34:41,166 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 321 transitions. Word has length 316 [2019-01-20 10:34:41,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:34:41,167 INFO L480 AbstractCegarLoop]: Abstraction has 321 states and 321 transitions. [2019-01-20 10:34:41,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 160 states. [2019-01-20 10:34:41,167 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 321 transitions. [2019-01-20 10:34:41,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-01-20 10:34:41,168 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:34:41,168 INFO L402 BasicCegarLoop]: trace histogram [80, 80, 79, 79, 1, 1] [2019-01-20 10:34:41,168 INFO L423 AbstractCegarLoop]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:34:41,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:34:41,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1783280509, now seen corresponding path program 79 times [2019-01-20 10:34:41,168 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:34:41,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:34:41,169 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:34:41,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:34:41,169 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:34:41,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:34:44,267 INFO L134 CoverageAnalysis]: Checked inductivity of 12561 backedges. 0 proven. 12561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:34:44,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:34:44,267 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:34:44,267 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:34:44,268 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:34:44,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:34:44,268 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:34:44,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:34:44,275 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:34:44,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:34:44,369 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:34:44,371 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 6 treesize of output 5 [2019-01-20 10:34:44,371 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:34:44,382 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:34:44,382 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:34:48,218 INFO L134 CoverageAnalysis]: Checked inductivity of 12561 backedges. 0 proven. 12561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:34:48,219 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:34:52,709 INFO L134 CoverageAnalysis]: Checked inductivity of 12561 backedges. 0 proven. 12561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:34:52,727 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:34:52,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 180 [2019-01-20 10:34:52,728 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:34:52,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 162 states [2019-01-20 10:34:52,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 162 interpolants. [2019-01-20 10:34:52,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13311, Invalid=19631, Unknown=0, NotChecked=0, Total=32942 [2019-01-20 10:34:52,730 INFO L87 Difference]: Start difference. First operand 321 states and 321 transitions. Second operand 162 states. [2019-01-20 10:34:53,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:34:53,401 INFO L93 Difference]: Finished difference Result 327 states and 327 transitions. [2019-01-20 10:34:53,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-01-20 10:34:53,401 INFO L78 Accepts]: Start accepts. Automaton has 162 states. Word has length 320 [2019-01-20 10:34:53,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:34:53,403 INFO L225 Difference]: With dead ends: 327 [2019-01-20 10:34:53,403 INFO L226 Difference]: Without dead ends: 326 [2019-01-20 10:34:53,404 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 718 GetRequests, 478 SyntacticMatches, 60 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24810 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=13311, Invalid=19631, Unknown=0, NotChecked=0, Total=32942 [2019-01-20 10:34:53,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2019-01-20 10:34:53,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 325. [2019-01-20 10:34:53,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2019-01-20 10:34:53,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 325 transitions. [2019-01-20 10:34:53,409 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 325 transitions. Word has length 320 [2019-01-20 10:34:53,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:34:53,409 INFO L480 AbstractCegarLoop]: Abstraction has 325 states and 325 transitions. [2019-01-20 10:34:53,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 162 states. [2019-01-20 10:34:53,410 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 325 transitions. [2019-01-20 10:34:53,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-01-20 10:34:53,411 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:34:53,411 INFO L402 BasicCegarLoop]: trace histogram [81, 81, 80, 80, 1, 1] [2019-01-20 10:34:53,411 INFO L423 AbstractCegarLoop]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:34:53,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:34:53,411 INFO L82 PathProgramCache]: Analyzing trace with hash 380550454, now seen corresponding path program 80 times [2019-01-20 10:34:53,411 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:34:53,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:34:53,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:34:53,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:34:53,412 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:34:53,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:34:57,026 INFO L134 CoverageAnalysis]: Checked inductivity of 12880 backedges. 0 proven. 12880 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:34:57,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:34:57,026 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:34:57,026 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:34:57,026 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:34:57,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:34:57,026 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:34:57,035 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:34:57,035 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:34:57,508 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 81 check-sat command(s) [2019-01-20 10:34:57,508 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:34:57,517 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:34:57,519 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 6 treesize of output 5 [2019-01-20 10:34:57,519 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:34:57,525 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:34:57,525 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:35:01,320 INFO L134 CoverageAnalysis]: Checked inductivity of 12880 backedges. 0 proven. 12880 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:35:01,320 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:35:05,717 INFO L134 CoverageAnalysis]: Checked inductivity of 12880 backedges. 0 proven. 12880 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:35:05,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:35:05,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 181 [2019-01-20 10:35:05,737 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:35:05,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 164 states [2019-01-20 10:35:05,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 164 interpolants. [2019-01-20 10:35:05,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13413, Invalid=19893, Unknown=0, NotChecked=0, Total=33306 [2019-01-20 10:35:05,739 INFO L87 Difference]: Start difference. First operand 325 states and 325 transitions. Second operand 164 states. [2019-01-20 10:35:06,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:35:06,451 INFO L93 Difference]: Finished difference Result 331 states and 331 transitions. [2019-01-20 10:35:06,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-01-20 10:35:06,451 INFO L78 Accepts]: Start accepts. Automaton has 164 states. Word has length 324 [2019-01-20 10:35:06,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:35:06,453 INFO L225 Difference]: With dead ends: 331 [2019-01-20 10:35:06,453 INFO L226 Difference]: Without dead ends: 330 [2019-01-20 10:35:06,455 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 727 GetRequests, 484 SyntacticMatches, 62 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25307 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=13413, Invalid=19893, Unknown=0, NotChecked=0, Total=33306 [2019-01-20 10:35:06,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2019-01-20 10:35:06,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 329. [2019-01-20 10:35:06,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-01-20 10:35:06,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 329 transitions. [2019-01-20 10:35:06,460 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 329 transitions. Word has length 324 [2019-01-20 10:35:06,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:35:06,460 INFO L480 AbstractCegarLoop]: Abstraction has 329 states and 329 transitions. [2019-01-20 10:35:06,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 164 states. [2019-01-20 10:35:06,461 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 329 transitions. [2019-01-20 10:35:06,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-01-20 10:35:06,462 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:35:06,462 INFO L402 BasicCegarLoop]: trace histogram [82, 82, 81, 81, 1, 1] [2019-01-20 10:35:06,462 INFO L423 AbstractCegarLoop]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:35:06,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:35:06,462 INFO L82 PathProgramCache]: Analyzing trace with hash 2048213615, now seen corresponding path program 81 times [2019-01-20 10:35:06,462 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:35:06,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:35:06,463 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:35:06,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:35:06,463 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:35:06,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:35:09,957 INFO L134 CoverageAnalysis]: Checked inductivity of 13203 backedges. 0 proven. 13203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:35:09,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:35:09,957 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:35:09,957 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:35:09,957 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:35:09,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:35:09,958 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:35:09,966 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:35:09,966 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:35:10,070 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:35:10,070 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:35:10,079 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:35:10,081 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-20 10:35:10,081 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:35:10,089 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:35:10,090 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:35:14,112 INFO L134 CoverageAnalysis]: Checked inductivity of 13203 backedges. 0 proven. 13203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:35:14,113 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:35:18,606 INFO L134 CoverageAnalysis]: Checked inductivity of 13203 backedges. 0 proven. 13203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:35:18,624 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:35:18,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 182 [2019-01-20 10:35:18,625 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:35:18,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 166 states [2019-01-20 10:35:18,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 166 interpolants. [2019-01-20 10:35:18,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13515, Invalid=20157, Unknown=0, NotChecked=0, Total=33672 [2019-01-20 10:35:18,627 INFO L87 Difference]: Start difference. First operand 329 states and 329 transitions. Second operand 166 states. [2019-01-20 10:35:19,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:35:19,309 INFO L93 Difference]: Finished difference Result 335 states and 335 transitions. [2019-01-20 10:35:19,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-01-20 10:35:19,309 INFO L78 Accepts]: Start accepts. Automaton has 166 states. Word has length 328 [2019-01-20 10:35:19,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:35:19,312 INFO L225 Difference]: With dead ends: 335 [2019-01-20 10:35:19,312 INFO L226 Difference]: Without dead ends: 334 [2019-01-20 10:35:19,313 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 736 GetRequests, 490 SyntacticMatches, 64 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25804 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=13515, Invalid=20157, Unknown=0, NotChecked=0, Total=33672 [2019-01-20 10:35:19,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2019-01-20 10:35:19,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 333. [2019-01-20 10:35:19,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2019-01-20 10:35:19,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 333 transitions. [2019-01-20 10:35:19,318 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 333 transitions. Word has length 328 [2019-01-20 10:35:19,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:35:19,318 INFO L480 AbstractCegarLoop]: Abstraction has 333 states and 333 transitions. [2019-01-20 10:35:19,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 166 states. [2019-01-20 10:35:19,319 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 333 transitions. [2019-01-20 10:35:19,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-01-20 10:35:19,320 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:35:19,320 INFO L402 BasicCegarLoop]: trace histogram [83, 83, 82, 82, 1, 1] [2019-01-20 10:35:19,320 INFO L423 AbstractCegarLoop]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:35:19,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:35:19,320 INFO L82 PathProgramCache]: Analyzing trace with hash 265585448, now seen corresponding path program 82 times [2019-01-20 10:35:19,320 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:35:19,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:35:19,321 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:35:19,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:35:19,321 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:35:19,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:35:22,895 INFO L134 CoverageAnalysis]: Checked inductivity of 13530 backedges. 0 proven. 13530 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:35:22,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:35:22,895 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:35:22,896 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:35:22,896 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:35:22,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:35:22,896 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:35:22,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:35:22,905 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:35:22,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:35:23,001 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:35:23,004 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 6 treesize of output 5 [2019-01-20 10:35:23,004 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:35:23,016 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:35:23,016 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:35:27,024 INFO L134 CoverageAnalysis]: Checked inductivity of 13530 backedges. 0 proven. 13530 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:35:27,024 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:35:31,427 INFO L134 CoverageAnalysis]: Checked inductivity of 13530 backedges. 0 proven. 13530 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:35:31,447 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:35:31,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 183 [2019-01-20 10:35:31,447 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:35:31,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 168 states [2019-01-20 10:35:31,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 168 interpolants. [2019-01-20 10:35:31,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13617, Invalid=20423, Unknown=0, NotChecked=0, Total=34040 [2019-01-20 10:35:31,450 INFO L87 Difference]: Start difference. First operand 333 states and 333 transitions. Second operand 168 states. [2019-01-20 10:35:32,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:35:32,117 INFO L93 Difference]: Finished difference Result 339 states and 339 transitions. [2019-01-20 10:35:32,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-01-20 10:35:32,117 INFO L78 Accepts]: Start accepts. Automaton has 168 states. Word has length 332 [2019-01-20 10:35:32,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:35:32,119 INFO L225 Difference]: With dead ends: 339 [2019-01-20 10:35:32,119 INFO L226 Difference]: Without dead ends: 338 [2019-01-20 10:35:32,120 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 745 GetRequests, 496 SyntacticMatches, 66 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26301 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=13617, Invalid=20423, Unknown=0, NotChecked=0, Total=34040 [2019-01-20 10:35:32,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-01-20 10:35:32,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 337. [2019-01-20 10:35:32,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2019-01-20 10:35:32,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 337 transitions. [2019-01-20 10:35:32,125 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 337 transitions. Word has length 332 [2019-01-20 10:35:32,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:35:32,126 INFO L480 AbstractCegarLoop]: Abstraction has 337 states and 337 transitions. [2019-01-20 10:35:32,126 INFO L481 AbstractCegarLoop]: Interpolant automaton has 168 states. [2019-01-20 10:35:32,126 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 337 transitions. [2019-01-20 10:35:32,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-01-20 10:35:32,127 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:35:32,127 INFO L402 BasicCegarLoop]: trace histogram [84, 84, 83, 83, 1, 1] [2019-01-20 10:35:32,127 INFO L423 AbstractCegarLoop]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:35:32,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:35:32,128 INFO L82 PathProgramCache]: Analyzing trace with hash 1042464609, now seen corresponding path program 83 times [2019-01-20 10:35:32,128 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:35:32,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:35:32,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:35:32,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:35:32,129 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:35:32,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:35:35,484 INFO L134 CoverageAnalysis]: Checked inductivity of 13861 backedges. 0 proven. 13861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:35:35,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:35:35,484 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:35:35,485 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:35:35,485 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:35:35,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:35:35,485 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:35:35,492 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:35:35,492 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:35:35,993 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 84 check-sat command(s) [2019-01-20 10:35:35,993 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:35:36,002 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:35:36,005 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 6 treesize of output 5 [2019-01-20 10:35:36,005 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:35:36,020 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:35:36,020 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:35:40,207 INFO L134 CoverageAnalysis]: Checked inductivity of 13861 backedges. 0 proven. 13861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:35:40,208 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:35:44,740 INFO L134 CoverageAnalysis]: Checked inductivity of 13861 backedges. 0 proven. 13861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:35:44,760 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:35:44,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 184 [2019-01-20 10:35:44,761 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:35:44,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 170 states [2019-01-20 10:35:44,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 170 interpolants. [2019-01-20 10:35:44,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13719, Invalid=20691, Unknown=0, NotChecked=0, Total=34410 [2019-01-20 10:35:44,765 INFO L87 Difference]: Start difference. First operand 337 states and 337 transitions. Second operand 170 states. [2019-01-20 10:35:45,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:35:45,547 INFO L93 Difference]: Finished difference Result 343 states and 343 transitions. [2019-01-20 10:35:45,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-01-20 10:35:45,547 INFO L78 Accepts]: Start accepts. Automaton has 170 states. Word has length 336 [2019-01-20 10:35:45,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:35:45,549 INFO L225 Difference]: With dead ends: 343 [2019-01-20 10:35:45,549 INFO L226 Difference]: Without dead ends: 342 [2019-01-20 10:35:45,551 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 754 GetRequests, 502 SyntacticMatches, 68 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26798 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=13719, Invalid=20691, Unknown=0, NotChecked=0, Total=34410 [2019-01-20 10:35:45,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-01-20 10:35:45,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 341. [2019-01-20 10:35:45,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-01-20 10:35:45,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 341 transitions. [2019-01-20 10:35:45,558 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 341 transitions. Word has length 336 [2019-01-20 10:35:45,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:35:45,558 INFO L480 AbstractCegarLoop]: Abstraction has 341 states and 341 transitions. [2019-01-20 10:35:45,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 170 states. [2019-01-20 10:35:45,558 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 341 transitions. [2019-01-20 10:35:45,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2019-01-20 10:35:45,560 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:35:45,560 INFO L402 BasicCegarLoop]: trace histogram [85, 85, 84, 84, 1, 1] [2019-01-20 10:35:45,560 INFO L423 AbstractCegarLoop]: === Iteration 85 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:35:45,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:35:45,561 INFO L82 PathProgramCache]: Analyzing trace with hash -434751718, now seen corresponding path program 84 times [2019-01-20 10:35:45,561 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:35:45,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:35:45,562 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:35:45,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:35:45,562 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:35:45,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:35:49,270 INFO L134 CoverageAnalysis]: Checked inductivity of 14196 backedges. 0 proven. 14196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:35:49,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:35:49,271 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:35:49,271 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:35:49,271 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:35:49,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:35:49,271 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:35:49,279 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:35:49,279 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:35:49,383 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:35:49,383 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:35:49,392 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:35:49,395 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-20 10:35:49,395 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:35:49,403 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:35:49,403 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:35:53,686 INFO L134 CoverageAnalysis]: Checked inductivity of 14196 backedges. 0 proven. 14196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:35:53,686 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:35:58,206 INFO L134 CoverageAnalysis]: Checked inductivity of 14196 backedges. 0 proven. 14196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:35:58,225 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:35:58,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 185 [2019-01-20 10:35:58,226 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:35:58,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 172 states [2019-01-20 10:35:58,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 172 interpolants. [2019-01-20 10:35:58,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13821, Invalid=20961, Unknown=0, NotChecked=0, Total=34782 [2019-01-20 10:35:58,229 INFO L87 Difference]: Start difference. First operand 341 states and 341 transitions. Second operand 172 states. [2019-01-20 10:35:59,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:35:59,017 INFO L93 Difference]: Finished difference Result 347 states and 347 transitions. [2019-01-20 10:35:59,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-01-20 10:35:59,017 INFO L78 Accepts]: Start accepts. Automaton has 172 states. Word has length 340 [2019-01-20 10:35:59,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:35:59,019 INFO L225 Difference]: With dead ends: 347 [2019-01-20 10:35:59,019 INFO L226 Difference]: Without dead ends: 346 [2019-01-20 10:35:59,021 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 763 GetRequests, 508 SyntacticMatches, 70 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27295 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=13821, Invalid=20961, Unknown=0, NotChecked=0, Total=34782 [2019-01-20 10:35:59,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2019-01-20 10:35:59,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 345. [2019-01-20 10:35:59,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2019-01-20 10:35:59,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 345 transitions. [2019-01-20 10:35:59,027 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 345 transitions. Word has length 340 [2019-01-20 10:35:59,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:35:59,027 INFO L480 AbstractCegarLoop]: Abstraction has 345 states and 345 transitions. [2019-01-20 10:35:59,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 172 states. [2019-01-20 10:35:59,027 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 345 transitions. [2019-01-20 10:35:59,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2019-01-20 10:35:59,029 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:35:59,029 INFO L402 BasicCegarLoop]: trace histogram [86, 86, 85, 85, 1, 1] [2019-01-20 10:35:59,029 INFO L423 AbstractCegarLoop]: === Iteration 86 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:35:59,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:35:59,029 INFO L82 PathProgramCache]: Analyzing trace with hash -207279533, now seen corresponding path program 85 times [2019-01-20 10:35:59,029 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:35:59,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:35:59,030 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:35:59,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:35:59,030 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:35:59,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:36:02,586 INFO L134 CoverageAnalysis]: Checked inductivity of 14535 backedges. 0 proven. 14535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:36:02,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:36:02,586 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:36:02,586 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:36:02,587 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:36:02,587 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:36:02,587 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:36:02,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:36:02,597 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:36:02,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:36:02,692 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:36:02,694 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 6 treesize of output 5 [2019-01-20 10:36:02,694 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:36:02,704 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:36:02,705 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:36:07,200 INFO L134 CoverageAnalysis]: Checked inductivity of 14535 backedges. 0 proven. 14535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:36:07,200 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:36:11,692 INFO L134 CoverageAnalysis]: Checked inductivity of 14535 backedges. 0 proven. 14535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:36:11,711 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:36:11,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 186 [2019-01-20 10:36:11,711 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:36:11,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 174 states [2019-01-20 10:36:11,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 174 interpolants. [2019-01-20 10:36:11,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13923, Invalid=21233, Unknown=0, NotChecked=0, Total=35156 [2019-01-20 10:36:11,716 INFO L87 Difference]: Start difference. First operand 345 states and 345 transitions. Second operand 174 states. [2019-01-20 10:36:12,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:36:12,507 INFO L93 Difference]: Finished difference Result 351 states and 351 transitions. [2019-01-20 10:36:12,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-01-20 10:36:12,507 INFO L78 Accepts]: Start accepts. Automaton has 174 states. Word has length 344 [2019-01-20 10:36:12,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:36:12,510 INFO L225 Difference]: With dead ends: 351 [2019-01-20 10:36:12,510 INFO L226 Difference]: Without dead ends: 350 [2019-01-20 10:36:12,512 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 772 GetRequests, 514 SyntacticMatches, 72 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27792 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=13923, Invalid=21233, Unknown=0, NotChecked=0, Total=35156 [2019-01-20 10:36:12,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2019-01-20 10:36:12,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 349. [2019-01-20 10:36:12,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2019-01-20 10:36:12,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 349 transitions. [2019-01-20 10:36:12,518 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 349 transitions. Word has length 344 [2019-01-20 10:36:12,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:36:12,518 INFO L480 AbstractCegarLoop]: Abstraction has 349 states and 349 transitions. [2019-01-20 10:36:12,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 174 states. [2019-01-20 10:36:12,519 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 349 transitions. [2019-01-20 10:36:12,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2019-01-20 10:36:12,520 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:36:12,521 INFO L402 BasicCegarLoop]: trace histogram [87, 87, 86, 86, 1, 1] [2019-01-20 10:36:12,521 INFO L423 AbstractCegarLoop]: === Iteration 87 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:36:12,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:36:12,521 INFO L82 PathProgramCache]: Analyzing trace with hash -307898100, now seen corresponding path program 86 times [2019-01-20 10:36:12,521 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:36:12,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:36:12,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:36:12,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:36:12,522 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:36:12,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:36:16,405 INFO L134 CoverageAnalysis]: Checked inductivity of 14878 backedges. 0 proven. 14878 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:36:16,405 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:36:16,405 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:36:16,406 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:36:16,406 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:36:16,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:36:16,406 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:36:16,414 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:36:16,414 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:36:16,936 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 87 check-sat command(s) [2019-01-20 10:36:16,936 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:36:16,946 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:36:16,949 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 6 treesize of output 5 [2019-01-20 10:36:16,950 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:36:16,962 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:36:16,962 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:36:21,412 INFO L134 CoverageAnalysis]: Checked inductivity of 14878 backedges. 0 proven. 14878 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:36:21,412 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:36:25,969 INFO L134 CoverageAnalysis]: Checked inductivity of 14878 backedges. 0 proven. 14878 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:36:25,987 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:36:25,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 187 [2019-01-20 10:36:25,988 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:36:25,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 176 states [2019-01-20 10:36:25,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 176 interpolants. [2019-01-20 10:36:25,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14025, Invalid=21507, Unknown=0, NotChecked=0, Total=35532 [2019-01-20 10:36:25,990 INFO L87 Difference]: Start difference. First operand 349 states and 349 transitions. Second operand 176 states. [2019-01-20 10:36:26,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:36:26,732 INFO L93 Difference]: Finished difference Result 355 states and 355 transitions. [2019-01-20 10:36:26,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-01-20 10:36:26,733 INFO L78 Accepts]: Start accepts. Automaton has 176 states. Word has length 348 [2019-01-20 10:36:26,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:36:26,735 INFO L225 Difference]: With dead ends: 355 [2019-01-20 10:36:26,735 INFO L226 Difference]: Without dead ends: 354 [2019-01-20 10:36:26,736 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 781 GetRequests, 520 SyntacticMatches, 74 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28289 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=14025, Invalid=21507, Unknown=0, NotChecked=0, Total=35532 [2019-01-20 10:36:26,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-01-20 10:36:26,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 353. [2019-01-20 10:36:26,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2019-01-20 10:36:26,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 353 transitions. [2019-01-20 10:36:26,741 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 353 transitions. Word has length 348 [2019-01-20 10:36:26,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:36:26,741 INFO L480 AbstractCegarLoop]: Abstraction has 353 states and 353 transitions. [2019-01-20 10:36:26,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 176 states. [2019-01-20 10:36:26,741 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 353 transitions. [2019-01-20 10:36:26,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2019-01-20 10:36:26,742 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:36:26,743 INFO L402 BasicCegarLoop]: trace histogram [88, 88, 87, 87, 1, 1] [2019-01-20 10:36:26,743 INFO L423 AbstractCegarLoop]: === Iteration 88 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:36:26,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:36:26,743 INFO L82 PathProgramCache]: Analyzing trace with hash -2050063547, now seen corresponding path program 87 times [2019-01-20 10:36:26,743 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:36:26,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:36:26,744 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:36:26,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:36:26,744 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:36:26,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:36:30,697 INFO L134 CoverageAnalysis]: Checked inductivity of 15225 backedges. 0 proven. 15225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:36:30,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:36:30,697 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:36:30,697 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:36:30,697 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:36:30,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:36:30,697 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:36:30,706 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:36:30,707 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:36:30,817 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:36:30,817 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:36:30,827 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:36:30,830 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 6 treesize of output 5 [2019-01-20 10:36:30,830 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:36:30,839 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:36:30,839 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:36:35,506 INFO L134 CoverageAnalysis]: Checked inductivity of 15225 backedges. 0 proven. 15225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:36:35,506 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:36:40,042 INFO L134 CoverageAnalysis]: Checked inductivity of 15225 backedges. 0 proven. 15225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:36:40,061 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:36:40,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 188 [2019-01-20 10:36:40,062 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:36:40,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 178 states [2019-01-20 10:36:40,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 178 interpolants. [2019-01-20 10:36:40,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14127, Invalid=21783, Unknown=0, NotChecked=0, Total=35910 [2019-01-20 10:36:40,065 INFO L87 Difference]: Start difference. First operand 353 states and 353 transitions. Second operand 178 states. [2019-01-20 10:36:40,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:36:40,787 INFO L93 Difference]: Finished difference Result 359 states and 359 transitions. [2019-01-20 10:36:40,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-01-20 10:36:40,788 INFO L78 Accepts]: Start accepts. Automaton has 178 states. Word has length 352 [2019-01-20 10:36:40,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:36:40,789 INFO L225 Difference]: With dead ends: 359 [2019-01-20 10:36:40,789 INFO L226 Difference]: Without dead ends: 358 [2019-01-20 10:36:40,790 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 790 GetRequests, 526 SyntacticMatches, 76 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28786 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=14127, Invalid=21783, Unknown=0, NotChecked=0, Total=35910 [2019-01-20 10:36:40,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2019-01-20 10:36:40,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 357. [2019-01-20 10:36:40,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2019-01-20 10:36:40,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 357 transitions. [2019-01-20 10:36:40,796 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 357 transitions. Word has length 352 [2019-01-20 10:36:40,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:36:40,796 INFO L480 AbstractCegarLoop]: Abstraction has 357 states and 357 transitions. [2019-01-20 10:36:40,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 178 states. [2019-01-20 10:36:40,796 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 357 transitions. [2019-01-20 10:36:40,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2019-01-20 10:36:40,797 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:36:40,797 INFO L402 BasicCegarLoop]: trace histogram [89, 89, 88, 88, 1, 1] [2019-01-20 10:36:40,798 INFO L423 AbstractCegarLoop]: === Iteration 89 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:36:40,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:36:40,798 INFO L82 PathProgramCache]: Analyzing trace with hash 682977534, now seen corresponding path program 88 times [2019-01-20 10:36:40,798 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:36:40,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:36:40,799 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:36:40,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:36:40,799 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:36:40,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:36:44,733 INFO L134 CoverageAnalysis]: Checked inductivity of 15576 backedges. 0 proven. 15576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:36:44,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:36:44,734 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:36:44,734 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:36:44,734 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:36:44,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:36:44,734 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:36:44,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:36:44,743 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:36:44,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:36:44,844 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:36:44,847 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-20 10:36:44,847 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:36:44,860 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:36:44,860 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:36:49,356 INFO L134 CoverageAnalysis]: Checked inductivity of 15576 backedges. 0 proven. 15576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:36:49,357 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:36:53,706 INFO L134 CoverageAnalysis]: Checked inductivity of 15576 backedges. 0 proven. 15576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:36:53,726 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:36:53,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 189 [2019-01-20 10:36:53,726 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:36:53,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 180 states [2019-01-20 10:36:53,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 180 interpolants. [2019-01-20 10:36:53,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14229, Invalid=22061, Unknown=0, NotChecked=0, Total=36290 [2019-01-20 10:36:53,729 INFO L87 Difference]: Start difference. First operand 357 states and 357 transitions. Second operand 180 states. [2019-01-20 10:36:54,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:36:54,706 INFO L93 Difference]: Finished difference Result 363 states and 363 transitions. [2019-01-20 10:36:54,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-01-20 10:36:54,706 INFO L78 Accepts]: Start accepts. Automaton has 180 states. Word has length 356 [2019-01-20 10:36:54,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:36:54,708 INFO L225 Difference]: With dead ends: 363 [2019-01-20 10:36:54,708 INFO L226 Difference]: Without dead ends: 362 [2019-01-20 10:36:54,709 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 799 GetRequests, 532 SyntacticMatches, 78 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29283 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=14229, Invalid=22061, Unknown=0, NotChecked=0, Total=36290 [2019-01-20 10:36:54,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2019-01-20 10:36:54,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 361. [2019-01-20 10:36:54,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-01-20 10:36:54,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 361 transitions. [2019-01-20 10:36:54,715 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 361 transitions. Word has length 356 [2019-01-20 10:36:54,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:36:54,715 INFO L480 AbstractCegarLoop]: Abstraction has 361 states and 361 transitions. [2019-01-20 10:36:54,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 180 states. [2019-01-20 10:36:54,715 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 361 transitions. [2019-01-20 10:36:54,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2019-01-20 10:36:54,716 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:36:54,717 INFO L402 BasicCegarLoop]: trace histogram [90, 90, 89, 89, 1, 1] [2019-01-20 10:36:54,717 INFO L423 AbstractCegarLoop]: === Iteration 90 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:36:54,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:36:54,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1915696585, now seen corresponding path program 89 times [2019-01-20 10:36:54,717 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:36:54,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:36:54,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:36:54,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:36:54,718 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:36:54,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:36:58,649 INFO L134 CoverageAnalysis]: Checked inductivity of 15931 backedges. 0 proven. 15931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:36:58,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:36:58,649 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:36:58,649 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:36:58,649 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:36:58,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:36:58,650 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:36:58,658 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:36:58,658 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:36:59,293 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 90 check-sat command(s) [2019-01-20 10:36:59,294 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:36:59,304 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:36:59,307 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 6 treesize of output 5 [2019-01-20 10:36:59,307 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:36:59,317 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:36:59,317 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:37:04,085 INFO L134 CoverageAnalysis]: Checked inductivity of 15931 backedges. 0 proven. 15931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:37:04,086 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:37:08,645 INFO L134 CoverageAnalysis]: Checked inductivity of 15931 backedges. 0 proven. 15931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:37:08,665 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:37:08,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90, 90] total 190 [2019-01-20 10:37:08,666 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:37:08,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 182 states [2019-01-20 10:37:08,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 182 interpolants. [2019-01-20 10:37:08,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14331, Invalid=22341, Unknown=0, NotChecked=0, Total=36672 [2019-01-20 10:37:08,669 INFO L87 Difference]: Start difference. First operand 361 states and 361 transitions. Second operand 182 states. [2019-01-20 10:37:09,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:37:09,475 INFO L93 Difference]: Finished difference Result 367 states and 367 transitions. [2019-01-20 10:37:09,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-01-20 10:37:09,475 INFO L78 Accepts]: Start accepts. Automaton has 182 states. Word has length 360 [2019-01-20 10:37:09,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:37:09,476 INFO L225 Difference]: With dead ends: 367 [2019-01-20 10:37:09,477 INFO L226 Difference]: Without dead ends: 366 [2019-01-20 10:37:09,478 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 808 GetRequests, 538 SyntacticMatches, 80 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29780 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=14331, Invalid=22341, Unknown=0, NotChecked=0, Total=36672 [2019-01-20 10:37:09,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-01-20 10:37:09,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 365. [2019-01-20 10:37:09,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2019-01-20 10:37:09,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 365 transitions. [2019-01-20 10:37:09,483 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 365 transitions. Word has length 360 [2019-01-20 10:37:09,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:37:09,483 INFO L480 AbstractCegarLoop]: Abstraction has 365 states and 365 transitions. [2019-01-20 10:37:09,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 182 states. [2019-01-20 10:37:09,483 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 365 transitions. [2019-01-20 10:37:09,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2019-01-20 10:37:09,484 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:37:09,485 INFO L402 BasicCegarLoop]: trace histogram [91, 91, 90, 90, 1, 1] [2019-01-20 10:37:09,485 INFO L423 AbstractCegarLoop]: === Iteration 91 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:37:09,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:37:09,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1198974704, now seen corresponding path program 90 times [2019-01-20 10:37:09,485 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:37:09,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:37:09,486 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:37:09,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:37:09,486 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:37:09,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:37:13,406 INFO L134 CoverageAnalysis]: Checked inductivity of 16290 backedges. 0 proven. 16290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:37:13,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:37:13,406 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:37:13,406 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:37:13,406 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:37:13,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:37:13,406 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:37:13,434 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:37:13,434 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:37:13,552 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:37:13,552 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:37:13,563 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:37:13,565 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 6 treesize of output 5 [2019-01-20 10:37:13,565 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:37:13,574 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:37:13,574 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:37:18,435 INFO L134 CoverageAnalysis]: Checked inductivity of 16290 backedges. 0 proven. 16290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:37:18,436 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:37:23,215 INFO L134 CoverageAnalysis]: Checked inductivity of 16290 backedges. 0 proven. 16290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:37:23,234 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:37:23,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 191 [2019-01-20 10:37:23,234 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:37:23,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 184 states [2019-01-20 10:37:23,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 184 interpolants. [2019-01-20 10:37:23,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14433, Invalid=22623, Unknown=0, NotChecked=0, Total=37056 [2019-01-20 10:37:23,239 INFO L87 Difference]: Start difference. First operand 365 states and 365 transitions. Second operand 184 states. [2019-01-20 10:37:24,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:37:24,018 INFO L93 Difference]: Finished difference Result 371 states and 371 transitions. [2019-01-20 10:37:24,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-01-20 10:37:24,018 INFO L78 Accepts]: Start accepts. Automaton has 184 states. Word has length 364 [2019-01-20 10:37:24,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:37:24,020 INFO L225 Difference]: With dead ends: 371 [2019-01-20 10:37:24,020 INFO L226 Difference]: Without dead ends: 370 [2019-01-20 10:37:24,022 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 817 GetRequests, 544 SyntacticMatches, 82 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30277 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=14433, Invalid=22623, Unknown=0, NotChecked=0, Total=37056 [2019-01-20 10:37:24,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2019-01-20 10:37:24,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 369. [2019-01-20 10:37:24,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2019-01-20 10:37:24,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 369 transitions. [2019-01-20 10:37:24,028 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 369 transitions. Word has length 364 [2019-01-20 10:37:24,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:37:24,028 INFO L480 AbstractCegarLoop]: Abstraction has 369 states and 369 transitions. [2019-01-20 10:37:24,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 184 states. [2019-01-20 10:37:24,029 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 369 transitions. [2019-01-20 10:37:24,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2019-01-20 10:37:24,030 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:37:24,030 INFO L402 BasicCegarLoop]: trace histogram [92, 92, 91, 91, 1, 1] [2019-01-20 10:37:24,030 INFO L423 AbstractCegarLoop]: === Iteration 92 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:37:24,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:37:24,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1390280489, now seen corresponding path program 91 times [2019-01-20 10:37:24,031 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:37:24,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:37:24,031 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:37:24,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:37:24,031 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:37:24,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:37:28,340 INFO L134 CoverageAnalysis]: Checked inductivity of 16653 backedges. 0 proven. 16653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:37:28,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:37:28,341 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:37:28,341 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:37:28,341 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:37:28,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:37:28,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 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:37:28,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:37:28,351 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:37:28,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:37:28,461 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:37:28,467 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-20 10:37:28,468 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:37:28,479 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:37:28,480 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:37:33,492 INFO L134 CoverageAnalysis]: Checked inductivity of 16653 backedges. 0 proven. 16653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:37:33,493 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:37:38,213 INFO L134 CoverageAnalysis]: Checked inductivity of 16653 backedges. 0 proven. 16653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:37:38,233 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:37:38,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92, 92] total 192 [2019-01-20 10:37:38,233 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:37:38,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 186 states [2019-01-20 10:37:38,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 186 interpolants. [2019-01-20 10:37:38,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14535, Invalid=22907, Unknown=0, NotChecked=0, Total=37442 [2019-01-20 10:37:38,236 INFO L87 Difference]: Start difference. First operand 369 states and 369 transitions. Second operand 186 states. [2019-01-20 10:37:39,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:37:39,071 INFO L93 Difference]: Finished difference Result 375 states and 375 transitions. [2019-01-20 10:37:39,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-01-20 10:37:39,071 INFO L78 Accepts]: Start accepts. Automaton has 186 states. Word has length 368 [2019-01-20 10:37:39,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:37:39,073 INFO L225 Difference]: With dead ends: 375 [2019-01-20 10:37:39,073 INFO L226 Difference]: Without dead ends: 374 [2019-01-20 10:37:39,075 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 826 GetRequests, 550 SyntacticMatches, 84 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30774 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=14535, Invalid=22907, Unknown=0, NotChecked=0, Total=37442 [2019-01-20 10:37:39,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2019-01-20 10:37:39,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 373. [2019-01-20 10:37:39,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2019-01-20 10:37:39,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 373 transitions. [2019-01-20 10:37:39,081 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 373 transitions. Word has length 368 [2019-01-20 10:37:39,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:37:39,081 INFO L480 AbstractCegarLoop]: Abstraction has 373 states and 373 transitions. [2019-01-20 10:37:39,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 186 states. [2019-01-20 10:37:39,081 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 373 transitions. [2019-01-20 10:37:39,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2019-01-20 10:37:39,082 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:37:39,083 INFO L402 BasicCegarLoop]: trace histogram [93, 93, 92, 92, 1, 1] [2019-01-20 10:37:39,083 INFO L423 AbstractCegarLoop]: === Iteration 93 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:37:39,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:37:39,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1474538782, now seen corresponding path program 92 times [2019-01-20 10:37:39,083 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:37:39,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:37:39,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:37:39,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:37:39,084 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:37:39,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:37:43,504 INFO L134 CoverageAnalysis]: Checked inductivity of 17020 backedges. 0 proven. 17020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:37:43,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:37:43,504 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:37:43,504 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:37:43,505 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:37:43,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:37:43,505 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:37:43,513 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:37:43,513 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:37:44,177 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 93 check-sat command(s) [2019-01-20 10:37:44,177 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:37:44,188 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:37:44,191 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 6 treesize of output 5 [2019-01-20 10:37:44,191 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:37:44,199 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:37:44,200 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:37:49,444 INFO L134 CoverageAnalysis]: Checked inductivity of 17020 backedges. 0 proven. 17020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:37:49,444 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:37:54,138 INFO L134 CoverageAnalysis]: Checked inductivity of 17020 backedges. 0 proven. 17020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:37:54,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:37:54,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 193 [2019-01-20 10:37:54,160 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:37:54,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 188 states [2019-01-20 10:37:54,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 188 interpolants. [2019-01-20 10:37:54,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14637, Invalid=23193, Unknown=0, NotChecked=0, Total=37830 [2019-01-20 10:37:54,165 INFO L87 Difference]: Start difference. First operand 373 states and 373 transitions. Second operand 188 states. [2019-01-20 10:37:54,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:37:54,985 INFO L93 Difference]: Finished difference Result 379 states and 379 transitions. [2019-01-20 10:37:54,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-01-20 10:37:54,986 INFO L78 Accepts]: Start accepts. Automaton has 188 states. Word has length 372 [2019-01-20 10:37:54,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:37:54,988 INFO L225 Difference]: With dead ends: 379 [2019-01-20 10:37:54,988 INFO L226 Difference]: Without dead ends: 378 [2019-01-20 10:37:54,990 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 835 GetRequests, 556 SyntacticMatches, 86 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31271 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=14637, Invalid=23193, Unknown=0, NotChecked=0, Total=37830 [2019-01-20 10:37:54,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2019-01-20 10:37:54,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 377. [2019-01-20 10:37:54,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-01-20 10:37:54,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 377 transitions. [2019-01-20 10:37:54,995 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 377 transitions. Word has length 372 [2019-01-20 10:37:54,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:37:54,996 INFO L480 AbstractCegarLoop]: Abstraction has 377 states and 377 transitions. [2019-01-20 10:37:54,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 188 states. [2019-01-20 10:37:54,996 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 377 transitions. [2019-01-20 10:37:54,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2019-01-20 10:37:54,997 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:37:54,997 INFO L402 BasicCegarLoop]: trace histogram [94, 94, 93, 93, 1, 1] [2019-01-20 10:37:54,998 INFO L423 AbstractCegarLoop]: === Iteration 94 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:37:54,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:37:54,998 INFO L82 PathProgramCache]: Analyzing trace with hash -903339493, now seen corresponding path program 93 times [2019-01-20 10:37:54,998 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:37:54,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:37:54,998 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:37:54,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:37:54,999 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:37:55,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:37:59,307 INFO L134 CoverageAnalysis]: Checked inductivity of 17391 backedges. 0 proven. 17391 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:37:59,307 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:37:59,308 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:37:59,308 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:37:59,308 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:37:59,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:37:59,308 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:37:59,316 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:37:59,316 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:37:59,438 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:37:59,438 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:37:59,449 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:37:59,452 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-20 10:37:59,452 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:37:59,464 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:37:59,465 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:38:04,839 INFO L134 CoverageAnalysis]: Checked inductivity of 17391 backedges. 0 proven. 17391 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:38:04,839 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:38:09,594 INFO L134 CoverageAnalysis]: Checked inductivity of 17391 backedges. 0 proven. 17391 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:38:09,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:38:09,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94, 94] total 194 [2019-01-20 10:38:09,613 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:38:09,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 190 states [2019-01-20 10:38:09,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 190 interpolants. [2019-01-20 10:38:09,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14739, Invalid=23481, Unknown=0, NotChecked=0, Total=38220 [2019-01-20 10:38:09,616 INFO L87 Difference]: Start difference. First operand 377 states and 377 transitions. Second operand 190 states. [2019-01-20 10:38:10,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:38:10,398 INFO L93 Difference]: Finished difference Result 383 states and 383 transitions. [2019-01-20 10:38:10,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-01-20 10:38:10,399 INFO L78 Accepts]: Start accepts. Automaton has 190 states. Word has length 376 [2019-01-20 10:38:10,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:38:10,400 INFO L225 Difference]: With dead ends: 383 [2019-01-20 10:38:10,400 INFO L226 Difference]: Without dead ends: 382 [2019-01-20 10:38:10,402 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 844 GetRequests, 562 SyntacticMatches, 88 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31768 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=14739, Invalid=23481, Unknown=0, NotChecked=0, Total=38220 [2019-01-20 10:38:10,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2019-01-20 10:38:10,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 381. [2019-01-20 10:38:10,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2019-01-20 10:38:10,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 381 transitions. [2019-01-20 10:38:10,407 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 381 transitions. Word has length 376 [2019-01-20 10:38:10,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:38:10,407 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 381 transitions. [2019-01-20 10:38:10,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 190 states. [2019-01-20 10:38:10,407 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 381 transitions. [2019-01-20 10:38:10,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2019-01-20 10:38:10,409 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:38:10,409 INFO L402 BasicCegarLoop]: trace histogram [95, 95, 94, 94, 1, 1] [2019-01-20 10:38:10,409 INFO L423 AbstractCegarLoop]: === Iteration 95 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:38:10,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:10,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1456975060, now seen corresponding path program 94 times [2019-01-20 10:38:10,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:38:10,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:10,410 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:38:10,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:10,410 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:38:10,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:38:14,953 INFO L134 CoverageAnalysis]: Checked inductivity of 17766 backedges. 0 proven. 17766 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:38:14,953 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:38:14,953 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:38:14,954 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:38:14,954 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:38:14,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:38:14,954 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:38:14,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:38:14,963 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:38:15,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:38:15,076 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:38:15,078 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 6 treesize of output 5 [2019-01-20 10:38:15,079 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:15,107 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:15,107 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:38:20,416 INFO L134 CoverageAnalysis]: Checked inductivity of 17766 backedges. 0 proven. 17766 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:38:20,416 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:38:25,134 INFO L134 CoverageAnalysis]: Checked inductivity of 17766 backedges. 0 proven. 17766 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:38:25,153 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:38:25,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 195 [2019-01-20 10:38:25,153 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:38:25,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 192 states [2019-01-20 10:38:25,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2019-01-20 10:38:25,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14841, Invalid=23771, Unknown=0, NotChecked=0, Total=38612 [2019-01-20 10:38:25,156 INFO L87 Difference]: Start difference. First operand 381 states and 381 transitions. Second operand 192 states. [2019-01-20 10:38:26,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:38:26,026 INFO L93 Difference]: Finished difference Result 387 states and 387 transitions. [2019-01-20 10:38:26,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-01-20 10:38:26,026 INFO L78 Accepts]: Start accepts. Automaton has 192 states. Word has length 380 [2019-01-20 10:38:26,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:38:26,029 INFO L225 Difference]: With dead ends: 387 [2019-01-20 10:38:26,029 INFO L226 Difference]: Without dead ends: 386 [2019-01-20 10:38:26,030 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 853 GetRequests, 568 SyntacticMatches, 90 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32265 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=14841, Invalid=23771, Unknown=0, NotChecked=0, Total=38612 [2019-01-20 10:38:26,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2019-01-20 10:38:26,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 385. [2019-01-20 10:38:26,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2019-01-20 10:38:26,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 385 transitions. [2019-01-20 10:38:26,036 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 385 transitions. Word has length 380 [2019-01-20 10:38:26,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:38:26,036 INFO L480 AbstractCegarLoop]: Abstraction has 385 states and 385 transitions. [2019-01-20 10:38:26,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 192 states. [2019-01-20 10:38:26,036 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 385 transitions. [2019-01-20 10:38:26,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2019-01-20 10:38:26,037 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:38:26,038 INFO L402 BasicCegarLoop]: trace histogram [96, 96, 95, 95, 1, 1] [2019-01-20 10:38:26,038 INFO L423 AbstractCegarLoop]: === Iteration 96 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:38:26,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:26,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1763626227, now seen corresponding path program 95 times [2019-01-20 10:38:26,038 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:38:26,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:26,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:38:26,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:26,039 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:38:26,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:38:30,564 INFO L134 CoverageAnalysis]: Checked inductivity of 18145 backedges. 0 proven. 18145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:38:30,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:38:30,564 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:38:30,564 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:38:30,564 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:38:30,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:38:30,565 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:38:30,573 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:38:30,573 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:38:31,255 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 96 check-sat command(s) [2019-01-20 10:38:31,255 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:38:31,266 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:38:31,268 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-20 10:38:31,268 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:31,277 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:31,277 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:38:36,751 INFO L134 CoverageAnalysis]: Checked inductivity of 18145 backedges. 0 proven. 18145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:38:36,752 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:38:41,112 INFO L134 CoverageAnalysis]: Checked inductivity of 18145 backedges. 0 proven. 18145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:38:41,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:38:41,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 196 [2019-01-20 10:38:41,133 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:38:41,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 194 states [2019-01-20 10:38:41,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 194 interpolants. [2019-01-20 10:38:41,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14943, Invalid=24063, Unknown=0, NotChecked=0, Total=39006 [2019-01-20 10:38:41,136 INFO L87 Difference]: Start difference. First operand 385 states and 385 transitions. Second operand 194 states. [2019-01-20 10:38:42,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:38:42,133 INFO L93 Difference]: Finished difference Result 391 states and 391 transitions. [2019-01-20 10:38:42,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-01-20 10:38:42,133 INFO L78 Accepts]: Start accepts. Automaton has 194 states. Word has length 384 [2019-01-20 10:38:42,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:38:42,135 INFO L225 Difference]: With dead ends: 391 [2019-01-20 10:38:42,135 INFO L226 Difference]: Without dead ends: 390 [2019-01-20 10:38:42,136 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 862 GetRequests, 574 SyntacticMatches, 92 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32762 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=14943, Invalid=24063, Unknown=0, NotChecked=0, Total=39006 [2019-01-20 10:38:42,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2019-01-20 10:38:42,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 389. [2019-01-20 10:38:42,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2019-01-20 10:38:42,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 389 transitions. [2019-01-20 10:38:42,143 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 389 transitions. Word has length 384 [2019-01-20 10:38:42,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:38:42,143 INFO L480 AbstractCegarLoop]: Abstraction has 389 states and 389 transitions. [2019-01-20 10:38:42,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 194 states. [2019-01-20 10:38:42,143 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 389 transitions. [2019-01-20 10:38:42,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2019-01-20 10:38:42,145 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:38:42,145 INFO L402 BasicCegarLoop]: trace histogram [97, 97, 96, 96, 1, 1] [2019-01-20 10:38:42,145 INFO L423 AbstractCegarLoop]: === Iteration 97 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:38:42,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:42,146 INFO L82 PathProgramCache]: Analyzing trace with hash 232453318, now seen corresponding path program 96 times [2019-01-20 10:38:42,146 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:38:42,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:42,146 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:38:42,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:42,146 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:38:42,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:38:46,590 INFO L134 CoverageAnalysis]: Checked inductivity of 18528 backedges. 0 proven. 18528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:38:46,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:38:46,590 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:38:46,590 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:38:46,590 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:38:46,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:38:46,591 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:38:46,599 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:38:46,600 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:38:46,727 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:38:46,727 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:38:46,738 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:38:46,741 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 6 treesize of output 5 [2019-01-20 10:38:46,741 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:38:46,755 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:38:46,756 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:38:52,456 INFO L134 CoverageAnalysis]: Checked inductivity of 18528 backedges. 0 proven. 18528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:38:52,456 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:38:56,956 INFO L134 CoverageAnalysis]: Checked inductivity of 18528 backedges. 0 proven. 18528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:38:56,975 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:38:56,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 197 [2019-01-20 10:38:56,975 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:38:56,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 196 states [2019-01-20 10:38:56,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 196 interpolants. [2019-01-20 10:38:56,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15045, Invalid=24357, Unknown=0, NotChecked=0, Total=39402 [2019-01-20 10:38:56,978 INFO L87 Difference]: Start difference. First operand 389 states and 389 transitions. Second operand 196 states. [2019-01-20 10:38:57,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:38:57,942 INFO L93 Difference]: Finished difference Result 395 states and 395 transitions. [2019-01-20 10:38:57,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-01-20 10:38:57,942 INFO L78 Accepts]: Start accepts. Automaton has 196 states. Word has length 388 [2019-01-20 10:38:57,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:38:57,944 INFO L225 Difference]: With dead ends: 395 [2019-01-20 10:38:57,944 INFO L226 Difference]: Without dead ends: 394 [2019-01-20 10:38:57,945 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 871 GetRequests, 580 SyntacticMatches, 94 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33259 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=15045, Invalid=24357, Unknown=0, NotChecked=0, Total=39402 [2019-01-20 10:38:57,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2019-01-20 10:38:57,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 393. [2019-01-20 10:38:57,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2019-01-20 10:38:57,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 393 transitions. [2019-01-20 10:38:57,950 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 393 transitions. Word has length 388 [2019-01-20 10:38:57,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:38:57,950 INFO L480 AbstractCegarLoop]: Abstraction has 393 states and 393 transitions. [2019-01-20 10:38:57,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has 196 states. [2019-01-20 10:38:57,951 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 393 transitions. [2019-01-20 10:38:57,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2019-01-20 10:38:57,952 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:38:57,952 INFO L402 BasicCegarLoop]: trace histogram [98, 98, 97, 97, 1, 1] [2019-01-20 10:38:57,952 INFO L423 AbstractCegarLoop]: === Iteration 98 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:38:57,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:38:57,953 INFO L82 PathProgramCache]: Analyzing trace with hash 171651583, now seen corresponding path program 97 times [2019-01-20 10:38:57,953 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:38:57,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:57,954 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:38:57,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:38:57,954 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:38:58,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:02,643 INFO L134 CoverageAnalysis]: Checked inductivity of 18915 backedges. 0 proven. 18915 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:02,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:02,644 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:39:02,644 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:39:02,644 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:39:02,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:02,644 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:39:02,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:02,652 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:39:02,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:02,765 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:39:02,768 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-20 10:39:02,768 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:02,777 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:02,778 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:39:08,509 INFO L134 CoverageAnalysis]: Checked inductivity of 18915 backedges. 0 proven. 18915 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:08,509 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:39:13,233 INFO L134 CoverageAnalysis]: Checked inductivity of 18915 backedges. 0 proven. 18915 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:13,252 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:39:13,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 198 [2019-01-20 10:39:13,253 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:39:13,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 198 states [2019-01-20 10:39:13,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 198 interpolants. [2019-01-20 10:39:13,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15147, Invalid=24653, Unknown=0, NotChecked=0, Total=39800 [2019-01-20 10:39:13,257 INFO L87 Difference]: Start difference. First operand 393 states and 393 transitions. Second operand 198 states. [2019-01-20 10:39:14,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:39:14,085 INFO L93 Difference]: Finished difference Result 399 states and 399 transitions. [2019-01-20 10:39:14,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-01-20 10:39:14,086 INFO L78 Accepts]: Start accepts. Automaton has 198 states. Word has length 392 [2019-01-20 10:39:14,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:39:14,087 INFO L225 Difference]: With dead ends: 399 [2019-01-20 10:39:14,087 INFO L226 Difference]: Without dead ends: 398 [2019-01-20 10:39:14,089 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 880 GetRequests, 586 SyntacticMatches, 96 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33756 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=15147, Invalid=24653, Unknown=0, NotChecked=0, Total=39800 [2019-01-20 10:39:14,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2019-01-20 10:39:14,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 397. [2019-01-20 10:39:14,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-01-20 10:39:14,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 397 transitions. [2019-01-20 10:39:14,095 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 397 transitions. Word has length 392 [2019-01-20 10:39:14,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:39:14,095 INFO L480 AbstractCegarLoop]: Abstraction has 397 states and 397 transitions. [2019-01-20 10:39:14,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 198 states. [2019-01-20 10:39:14,095 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 397 transitions. [2019-01-20 10:39:14,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2019-01-20 10:39:14,096 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:39:14,097 INFO L402 BasicCegarLoop]: trace histogram [99, 99, 98, 98, 1, 1] [2019-01-20 10:39:14,097 INFO L423 AbstractCegarLoop]: === Iteration 99 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:39:14,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:14,097 INFO L82 PathProgramCache]: Analyzing trace with hash 894970552, now seen corresponding path program 98 times [2019-01-20 10:39:14,097 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:39:14,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:14,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:39:14,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:14,098 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:39:14,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:18,881 INFO L134 CoverageAnalysis]: Checked inductivity of 19306 backedges. 0 proven. 19306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:18,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:18,882 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:39:18,882 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:39:18,882 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:39:18,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:18,882 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:39:18,891 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:39:18,891 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:39:19,620 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 99 check-sat command(s) [2019-01-20 10:39:19,620 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:39:19,631 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:39:19,637 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 6 treesize of output 5 [2019-01-20 10:39:19,637 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:19,652 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:19,653 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:39:25,457 INFO L134 CoverageAnalysis]: Checked inductivity of 19306 backedges. 0 proven. 19306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:25,458 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:39:30,129 INFO L134 CoverageAnalysis]: Checked inductivity of 19306 backedges. 0 proven. 19306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:30,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:39:30,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 199 [2019-01-20 10:39:30,149 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:39:30,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 200 states [2019-01-20 10:39:30,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 200 interpolants. [2019-01-20 10:39:30,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15249, Invalid=24951, Unknown=0, NotChecked=0, Total=40200 [2019-01-20 10:39:30,152 INFO L87 Difference]: Start difference. First operand 397 states and 397 transitions. Second operand 200 states. [2019-01-20 10:39:31,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:39:31,031 INFO L93 Difference]: Finished difference Result 403 states and 403 transitions. [2019-01-20 10:39:31,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-01-20 10:39:31,031 INFO L78 Accepts]: Start accepts. Automaton has 200 states. Word has length 396 [2019-01-20 10:39:31,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:39:31,033 INFO L225 Difference]: With dead ends: 403 [2019-01-20 10:39:31,033 INFO L226 Difference]: Without dead ends: 402 [2019-01-20 10:39:31,034 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 889 GetRequests, 592 SyntacticMatches, 98 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34253 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=15249, Invalid=24951, Unknown=0, NotChecked=0, Total=40200 [2019-01-20 10:39:31,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2019-01-20 10:39:31,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 401. [2019-01-20 10:39:31,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2019-01-20 10:39:31,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 401 transitions. [2019-01-20 10:39:31,042 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 401 transitions. Word has length 396 [2019-01-20 10:39:31,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:39:31,042 INFO L480 AbstractCegarLoop]: Abstraction has 401 states and 401 transitions. [2019-01-20 10:39:31,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 200 states. [2019-01-20 10:39:31,042 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 401 transitions. [2019-01-20 10:39:31,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2019-01-20 10:39:31,044 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:39:31,045 INFO L402 BasicCegarLoop]: trace histogram [100, 100, 99, 99, 1, 1] [2019-01-20 10:39:31,045 INFO L423 AbstractCegarLoop]: === Iteration 100 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:39:31,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:39:31,045 INFO L82 PathProgramCache]: Analyzing trace with hash 594026225, now seen corresponding path program 99 times [2019-01-20 10:39:31,045 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:39:31,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:31,046 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:39:31,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:39:31,046 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:39:31,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:39:36,244 INFO L134 CoverageAnalysis]: Checked inductivity of 19701 backedges. 0 proven. 19701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:36,244 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:36,244 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:39:36,244 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:39:36,244 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:39:36,244 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:39:36,244 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:39:36,252 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:39:36,252 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:39:36,418 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:39:36,419 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:39:36,430 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:39:36,432 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-20 10:39:36,432 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:39:36,442 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:39:36,442 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:39:42,259 INFO L134 CoverageAnalysis]: Checked inductivity of 19701 backedges. 0 proven. 19701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:39:42,259 INFO L316 TraceCheckSpWp]: Computing backward predicates...