java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/array3.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1de736e-m [2019-02-15 10:44:47,540 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-15 10:44:47,542 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-15 10:44:47,555 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-15 10:44:47,555 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-15 10:44:47,556 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-15 10:44:47,558 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-15 10:44:47,560 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-15 10:44:47,561 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-15 10:44:47,562 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-15 10:44:47,563 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-15 10:44:47,564 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-15 10:44:47,565 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-15 10:44:47,566 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-15 10:44:47,567 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-15 10:44:47,568 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-15 10:44:47,569 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-15 10:44:47,570 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-15 10:44:47,573 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-15 10:44:47,575 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-15 10:44:47,576 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-15 10:44:47,577 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-15 10:44:47,580 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-15 10:44:47,580 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-15 10:44:47,580 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-15 10:44:47,581 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-15 10:44:47,582 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-15 10:44:47,583 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-15 10:44:47,584 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-15 10:44:47,585 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-15 10:44:47,585 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-15 10:44:47,586 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-15 10:44:47,586 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-15 10:44:47,587 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-15 10:44:47,588 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-15 10:44:47,588 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-15 10:44:47,589 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-02-15 10:44:47,602 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-15 10:44:47,602 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-15 10:44:47,603 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-15 10:44:47,603 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-15 10:44:47,603 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-15 10:44:47,604 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-15 10:44:47,604 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-15 10:44:47,604 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-15 10:44:47,604 INFO L133 SettingsManager]: * Explicit value domain=true [2019-02-15 10:44:47,604 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-15 10:44:47,605 INFO L133 SettingsManager]: * Octagon Domain=false [2019-02-15 10:44:47,605 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-02-15 10:44:47,605 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-15 10:44:47,605 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-15 10:44:47,606 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-15 10:44:47,606 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-15 10:44:47,606 INFO L133 SettingsManager]: * Use SBE=true [2019-02-15 10:44:47,606 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-15 10:44:47,607 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-15 10:44:47,607 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-15 10:44:47,607 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-15 10:44:47,607 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-15 10:44:47,607 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-15 10:44:47,608 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-15 10:44:47,608 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-15 10:44:47,608 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-15 10:44:47,608 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-15 10:44:47,608 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-15 10:44:47,609 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-15 10:44:47,609 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-15 10:44:47,609 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-15 10:44:47,609 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-15 10:44:47,610 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-15 10:44:47,610 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-15 10:44:47,610 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-15 10:44:47,610 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-15 10:44:47,610 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-15 10:44:47,610 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-02-15 10:44:47,611 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-15 10:44:47,611 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-15 10:44:47,640 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-15 10:44:47,655 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-15 10:44:47,660 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-15 10:44:47,661 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-15 10:44:47,662 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-15 10:44:47,663 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array3.i_4.bpl [2019-02-15 10:44:47,663 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array3.i_4.bpl' [2019-02-15 10:44:47,702 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-15 10:44:47,704 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-15 10:44:47,705 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-15 10:44:47,705 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-15 10:44:47,705 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-15 10:44:47,724 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:44:47" (1/1) ... [2019-02-15 10:44:47,735 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:44:47" (1/1) ... [2019-02-15 10:44:47,745 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-15 10:44:47,746 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-15 10:44:47,747 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-15 10:44:47,747 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-15 10:44:47,759 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:44:47" (1/1) ... [2019-02-15 10:44:47,759 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:44:47" (1/1) ... [2019-02-15 10:44:47,760 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:44:47" (1/1) ... [2019-02-15 10:44:47,761 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:44:47" (1/1) ... [2019-02-15 10:44:47,766 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:44:47" (1/1) ... [2019-02-15 10:44:47,769 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:44:47" (1/1) ... [2019-02-15 10:44:47,770 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:44:47" (1/1) ... [2019-02-15 10:44:47,772 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-15 10:44:47,772 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-15 10:44:47,772 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-15 10:44:47,773 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-15 10:44:47,774 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:44:47" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-15 10:44:47,833 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-15 10:44:47,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-15 10:44:48,074 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-15 10:44:48,074 INFO L286 CfgBuilder]: Removed 2 assue(true) statements. [2019-02-15 10:44:48,075 INFO L202 PluginConnector]: Adding new model array3.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:44:48 BoogieIcfgContainer [2019-02-15 10:44:48,076 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-15 10:44:48,077 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-15 10:44:48,077 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-15 10:44:48,081 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-15 10:44:48,081 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:44:47" (1/2) ... [2019-02-15 10:44:48,083 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69b584f6 and model type array3.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:44:48, skipping insertion in model container [2019-02-15 10:44:48,083 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:44:48" (2/2) ... [2019-02-15 10:44:48,085 INFO L112 eAbstractionObserver]: Analyzing ICFG array3.i_4.bpl [2019-02-15 10:44:48,096 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-15 10:44:48,107 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-02-15 10:44:48,126 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-02-15 10:44:48,167 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-15 10:44:48,167 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-15 10:44:48,167 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-15 10:44:48,167 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-15 10:44:48,168 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-15 10:44:48,168 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-15 10:44:48,168 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-15 10:44:48,168 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-15 10:44:48,185 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2019-02-15 10:44:48,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 10:44:48,191 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:44:48,192 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 10:44:48,195 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:44:48,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:44:48,201 INFO L82 PathProgramCache]: Analyzing trace with hash 928714, now seen corresponding path program 1 times [2019-02-15 10:44:48,203 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:44:48,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:44:48,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:44:48,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:44:48,252 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:44:48,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:44:48,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:44:48,339 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-15 10:44:48,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-15 10:44:48,339 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 10:44:48,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-15 10:44:48,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-15 10:44:48,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-15 10:44:48,359 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2019-02-15 10:44:48,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:44:48,426 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2019-02-15 10:44:48,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-15 10:44:48,429 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-02-15 10:44:48,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:44:48,441 INFO L225 Difference]: With dead ends: 12 [2019-02-15 10:44:48,442 INFO L226 Difference]: Without dead ends: 7 [2019-02-15 10:44:48,445 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-15 10:44:48,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-02-15 10:44:48,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-02-15 10:44:48,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-02-15 10:44:48,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-02-15 10:44:48,482 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 4 [2019-02-15 10:44:48,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:44:48,482 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-02-15 10:44:48,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-15 10:44:48,483 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2019-02-15 10:44:48,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 10:44:48,483 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:44:48,483 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 10:44:48,484 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:44:48,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:44:48,484 INFO L82 PathProgramCache]: Analyzing trace with hash 894131125, now seen corresponding path program 1 times [2019-02-15 10:44:48,484 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:44:48,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:44:48,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:44:48,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:44:48,486 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:44:48,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:44:48,602 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:44:48,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:44:48,603 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:44:48,604 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 10:44:48,615 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [12], [14], [16] [2019-02-15 10:44:48,701 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:44:48,701 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:44:48,858 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:44:48,860 INFO L272 AbstractInterpreter]: Visited 6 different actions 18 times. Merged at 4 different actions 9 times. Never widened. Performed 198 root evaluator evaluations with a maximum evaluation depth of 6. Performed 198 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 10:44:48,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:44:48,867 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:44:48,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:44:48,868 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:44:48,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:44:48,890 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:44:48,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:44:48,921 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:44:48,950 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:44:48,950 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:44:49,017 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:44:49,037 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:44:49,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2019-02-15 10:44:49,039 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:44:49,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-15 10:44:49,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-15 10:44:49,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-02-15 10:44:49,040 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 4 states. [2019-02-15 10:44:49,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:44:49,105 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2019-02-15 10:44:49,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-15 10:44:49,107 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-02-15 10:44:49,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:44:49,107 INFO L225 Difference]: With dead ends: 13 [2019-02-15 10:44:49,107 INFO L226 Difference]: Without dead ends: 9 [2019-02-15 10:44:49,109 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-02-15 10:44:49,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-02-15 10:44:49,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-02-15 10:44:49,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-02-15 10:44:49,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-02-15 10:44:49,111 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2019-02-15 10:44:49,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:44:49,112 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-02-15 10:44:49,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-15 10:44:49,112 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2019-02-15 10:44:49,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-15 10:44:49,113 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:44:49,113 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2019-02-15 10:44:49,113 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:44:49,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:44:49,113 INFO L82 PathProgramCache]: Analyzing trace with hash 315556586, now seen corresponding path program 2 times [2019-02-15 10:44:49,113 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:44:49,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:44:49,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:44:49,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:44:49,115 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:44:49,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:44:49,182 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-15 10:44:49,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:44:49,183 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:44:49,183 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:44:49,184 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:44:49,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:44:49,184 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:44:49,194 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:44:49,195 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:44:49,232 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-02-15 10:44:49,232 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:44:49,234 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:44:49,240 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-15 10:44:49,240 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:44:49,409 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-15 10:44:49,438 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:44:49,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2019-02-15 10:44:49,439 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:44:49,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-02-15 10:44:49,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-02-15 10:44:49,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-02-15 10:44:49,440 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 5 states. [2019-02-15 10:44:49,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:44:49,630 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2019-02-15 10:44:49,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-15 10:44:49,631 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-02-15 10:44:49,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:44:49,631 INFO L225 Difference]: With dead ends: 16 [2019-02-15 10:44:49,631 INFO L226 Difference]: Without dead ends: 11 [2019-02-15 10:44:49,632 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-02-15 10:44:49,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-02-15 10:44:49,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-02-15 10:44:49,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-02-15 10:44:49,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2019-02-15 10:44:49,635 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 8 [2019-02-15 10:44:49,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:44:49,635 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-02-15 10:44:49,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-02-15 10:44:49,636 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2019-02-15 10:44:49,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-02-15 10:44:49,636 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:44:49,636 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1] [2019-02-15 10:44:49,637 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:44:49,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:44:49,637 INFO L82 PathProgramCache]: Analyzing trace with hash -175395819, now seen corresponding path program 3 times [2019-02-15 10:44:49,637 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:44:49,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:44:49,638 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:44:49,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:44:49,639 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:44:49,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:44:49,767 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-02-15 10:44:49,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:44:49,768 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:44:49,768 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:44:49,768 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:44:49,768 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:44:49,768 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:44:49,779 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:44:49,780 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:44:49,803 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:44:49,803 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:44:49,805 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:44:49,811 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-02-15 10:44:49,811 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:44:49,940 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-02-15 10:44:49,972 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:44:49,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2019-02-15 10:44:49,972 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:44:49,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-15 10:44:49,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-15 10:44:49,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-02-15 10:44:49,974 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 6 states. [2019-02-15 10:44:50,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:44:50,035 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2019-02-15 10:44:50,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 10:44:50,036 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-02-15 10:44:50,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:44:50,037 INFO L225 Difference]: With dead ends: 19 [2019-02-15 10:44:50,037 INFO L226 Difference]: Without dead ends: 13 [2019-02-15 10:44:50,038 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-02-15 10:44:50,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-02-15 10:44:50,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-02-15 10:44:50,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-02-15 10:44:50,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-02-15 10:44:50,041 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2019-02-15 10:44:50,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:44:50,042 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-02-15 10:44:50,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-15 10:44:50,042 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-02-15 10:44:50,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-02-15 10:44:50,042 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:44:50,042 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1] [2019-02-15 10:44:50,043 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:44:50,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:44:50,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1258544630, now seen corresponding path program 4 times [2019-02-15 10:44:50,043 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:44:50,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:44:50,044 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:44:50,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:44:50,044 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:44:50,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:44:50,118 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-02-15 10:44:50,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:44:50,118 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:44:50,119 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:44:50,119 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:44:50,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:44:50,119 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:44:50,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:44:50,128 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:44:50,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:44:50,154 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:44:50,159 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-02-15 10:44:50,160 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:44:50,284 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-02-15 10:44:50,304 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:44:50,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2019-02-15 10:44:50,304 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:44:50,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-02-15 10:44:50,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-02-15 10:44:50,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-02-15 10:44:50,305 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 7 states. [2019-02-15 10:44:50,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:44:50,446 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2019-02-15 10:44:50,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 10:44:50,446 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2019-02-15 10:44:50,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:44:50,447 INFO L225 Difference]: With dead ends: 22 [2019-02-15 10:44:50,447 INFO L226 Difference]: Without dead ends: 15 [2019-02-15 10:44:50,448 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-02-15 10:44:50,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-02-15 10:44:50,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-02-15 10:44:50,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-02-15 10:44:50,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-02-15 10:44:50,452 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2019-02-15 10:44:50,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:44:50,452 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-02-15 10:44:50,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-02-15 10:44:50,452 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2019-02-15 10:44:50,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-02-15 10:44:50,453 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:44:50,453 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1] [2019-02-15 10:44:50,453 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:44:50,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:44:50,454 INFO L82 PathProgramCache]: Analyzing trace with hash -400886667, now seen corresponding path program 5 times [2019-02-15 10:44:50,454 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:44:50,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:44:50,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:44:50,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:44:50,456 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:44:50,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:44:50,788 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-02-15 10:44:50,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:44:50,789 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:44:50,790 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:44:50,790 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:44:50,790 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:44:50,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 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:44:50,802 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:44:50,802 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:44:50,836 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-02-15 10:44:50,837 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:44:50,839 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:44:50,846 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-02-15 10:44:50,847 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:44:51,008 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-02-15 10:44:51,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:44:51,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2019-02-15 10:44:51,030 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:44:51,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:44:51,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:44:51,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-02-15 10:44:51,031 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 8 states. [2019-02-15 10:44:51,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:44:51,074 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2019-02-15 10:44:51,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 10:44:51,074 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-02-15 10:44:51,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:44:51,076 INFO L225 Difference]: With dead ends: 25 [2019-02-15 10:44:51,076 INFO L226 Difference]: Without dead ends: 17 [2019-02-15 10:44:51,077 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-02-15 10:44:51,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-02-15 10:44:51,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-02-15 10:44:51,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-02-15 10:44:51,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-02-15 10:44:51,090 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 14 [2019-02-15 10:44:51,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:44:51,090 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-02-15 10:44:51,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:44:51,090 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-02-15 10:44:51,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-02-15 10:44:51,090 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:44:51,091 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1] [2019-02-15 10:44:51,092 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:44:51,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:44:51,092 INFO L82 PathProgramCache]: Analyzing trace with hash -10778326, now seen corresponding path program 6 times [2019-02-15 10:44:51,093 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:44:51,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:44:51,094 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:44:51,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:44:51,094 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:44:51,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:44:51,196 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-02-15 10:44:51,197 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:44:51,197 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:44:51,197 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:44:51,197 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:44:51,197 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:44:51,197 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:44:51,208 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:44:51,208 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:44:51,246 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:44:51,246 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:44:51,248 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:44:51,258 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-02-15 10:44:51,259 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:44:51,650 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-02-15 10:44:51,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:44:51,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2019-02-15 10:44:51,670 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:44:51,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-15 10:44:51,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-15 10:44:51,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-02-15 10:44:51,671 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 9 states. [2019-02-15 10:44:51,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:44:51,756 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2019-02-15 10:44:51,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 10:44:51,756 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2019-02-15 10:44:51,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:44:51,757 INFO L225 Difference]: With dead ends: 28 [2019-02-15 10:44:51,757 INFO L226 Difference]: Without dead ends: 19 [2019-02-15 10:44:51,757 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-02-15 10:44:51,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-02-15 10:44:51,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-02-15 10:44:51,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-02-15 10:44:51,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2019-02-15 10:44:51,761 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 16 [2019-02-15 10:44:51,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:44:51,762 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-02-15 10:44:51,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-15 10:44:51,762 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2019-02-15 10:44:51,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-02-15 10:44:51,763 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:44:51,763 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1] [2019-02-15 10:44:51,763 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:44:51,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:44:51,763 INFO L82 PathProgramCache]: Analyzing trace with hash 701707477, now seen corresponding path program 7 times [2019-02-15 10:44:51,764 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:44:51,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:44:51,765 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:44:51,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:44:51,765 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:44:51,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:44:51,929 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-02-15 10:44:51,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:44:51,930 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:44:51,930 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:44:51,930 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:44:51,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:44:51,931 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:44:51,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:44:51,940 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:44:51,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:44:51,970 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:44:51,980 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-02-15 10:44:51,980 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:44:52,203 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-02-15 10:44:52,223 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:44:52,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2019-02-15 10:44:52,223 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:44:52,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 10:44:52,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 10:44:52,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-02-15 10:44:52,224 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 10 states. [2019-02-15 10:44:52,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:44:52,270 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2019-02-15 10:44:52,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-15 10:44:52,273 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2019-02-15 10:44:52,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:44:52,273 INFO L225 Difference]: With dead ends: 31 [2019-02-15 10:44:52,274 INFO L226 Difference]: Without dead ends: 21 [2019-02-15 10:44:52,274 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-02-15 10:44:52,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-02-15 10:44:52,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-02-15 10:44:52,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-02-15 10:44:52,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-02-15 10:44:52,278 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 18 [2019-02-15 10:44:52,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:44:52,278 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-02-15 10:44:52,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 10:44:52,279 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2019-02-15 10:44:52,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-02-15 10:44:52,279 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:44:52,279 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1] [2019-02-15 10:44:52,280 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:44:52,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:44:52,280 INFO L82 PathProgramCache]: Analyzing trace with hash -718063542, now seen corresponding path program 8 times [2019-02-15 10:44:52,280 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:44:52,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:44:52,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:44:52,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:44:52,281 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:44:52,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:44:52,441 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-02-15 10:44:52,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:44:52,442 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:44:52,442 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:44:52,443 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:44:52,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:44:52,443 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:44:52,460 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:44:52,460 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:44:52,482 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-02-15 10:44:52,482 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:44:52,484 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:44:52,492 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-02-15 10:44:52,492 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:44:52,719 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-02-15 10:44:52,740 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:44:52,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2019-02-15 10:44:52,740 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:44:52,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-15 10:44:52,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-15 10:44:52,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-02-15 10:44:52,742 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 11 states. [2019-02-15 10:44:52,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:44:52,964 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2019-02-15 10:44:52,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-15 10:44:52,965 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2019-02-15 10:44:52,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:44:52,966 INFO L225 Difference]: With dead ends: 34 [2019-02-15 10:44:52,966 INFO L226 Difference]: Without dead ends: 23 [2019-02-15 10:44:52,968 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-02-15 10:44:52,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-02-15 10:44:52,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-02-15 10:44:52,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-02-15 10:44:52,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-02-15 10:44:52,974 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 20 [2019-02-15 10:44:52,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:44:52,975 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-02-15 10:44:52,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-15 10:44:52,975 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-02-15 10:44:52,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-02-15 10:44:52,976 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:44:52,976 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1] [2019-02-15 10:44:52,976 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:44:52,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:44:52,977 INFO L82 PathProgramCache]: Analyzing trace with hash -317821643, now seen corresponding path program 9 times [2019-02-15 10:44:52,978 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:44:52,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:44:52,979 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:44:52,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:44:52,979 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:44:53,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:44:53,154 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-02-15 10:44:53,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:44:53,233 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:44:53,233 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:44:53,233 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:44:53,233 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:44:53,233 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:44:53,242 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:44:53,242 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:44:53,290 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:44:53,290 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:44:53,293 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:44:53,312 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-02-15 10:44:53,312 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:44:53,712 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-02-15 10:44:53,731 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:44:53,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2019-02-15 10:44:53,732 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:44:53,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-15 10:44:53,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-15 10:44:53,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-02-15 10:44:53,733 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 12 states. [2019-02-15 10:44:53,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:44:53,802 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2019-02-15 10:44:53,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-02-15 10:44:53,809 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2019-02-15 10:44:53,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:44:53,810 INFO L225 Difference]: With dead ends: 37 [2019-02-15 10:44:53,810 INFO L226 Difference]: Without dead ends: 25 [2019-02-15 10:44:53,811 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-02-15 10:44:53,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-02-15 10:44:53,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-02-15 10:44:53,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-02-15 10:44:53,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2019-02-15 10:44:53,816 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 22 [2019-02-15 10:44:53,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:44:53,816 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-02-15 10:44:53,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-15 10:44:53,816 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2019-02-15 10:44:53,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-02-15 10:44:53,821 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:44:53,821 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1] [2019-02-15 10:44:53,821 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:44:53,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:44:53,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1145646954, now seen corresponding path program 10 times [2019-02-15 10:44:53,822 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:44:53,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:44:53,823 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:44:53,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:44:53,823 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:44:53,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:44:54,139 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-02-15 10:44:54,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:44:54,140 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:44:54,140 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:44:54,140 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:44:54,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:44:54,140 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:44:54,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:44:54,157 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:44:54,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:44:54,176 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:44:54,181 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-02-15 10:44:54,182 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:44:54,630 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-02-15 10:44:54,649 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:44:54,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2019-02-15 10:44:54,650 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:44:54,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-02-15 10:44:54,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-02-15 10:44:54,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-02-15 10:44:54,651 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 13 states. [2019-02-15 10:44:54,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:44:54,701 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2019-02-15 10:44:54,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-02-15 10:44:54,702 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2019-02-15 10:44:54,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:44:54,703 INFO L225 Difference]: With dead ends: 40 [2019-02-15 10:44:54,703 INFO L226 Difference]: Without dead ends: 27 [2019-02-15 10:44:54,704 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-02-15 10:44:54,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-02-15 10:44:54,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-02-15 10:44:54,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-02-15 10:44:54,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-02-15 10:44:54,707 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 24 [2019-02-15 10:44:54,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:44:54,708 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-02-15 10:44:54,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-02-15 10:44:54,708 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-02-15 10:44:54,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-02-15 10:44:54,709 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:44:54,709 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1] [2019-02-15 10:44:54,709 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:44:54,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:44:54,709 INFO L82 PathProgramCache]: Analyzing trace with hash 430349717, now seen corresponding path program 11 times [2019-02-15 10:44:54,709 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:44:54,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:44:54,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:44:54,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:44:54,710 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:44:54,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:44:54,881 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-02-15 10:44:54,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:44:54,882 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:44:54,882 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:44:54,882 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:44:54,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:44:54,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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:44:54,891 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:44:54,891 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:44:54,931 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-02-15 10:44:54,931 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:44:54,934 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:44:54,946 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-02-15 10:44:54,946 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:44:55,153 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-02-15 10:44:55,173 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:44:55,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2019-02-15 10:44:55,173 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:44:55,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-02-15 10:44:55,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-02-15 10:44:55,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-02-15 10:44:55,175 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 14 states. [2019-02-15 10:44:55,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:44:55,254 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2019-02-15 10:44:55,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-02-15 10:44:55,255 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2019-02-15 10:44:55,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:44:55,256 INFO L225 Difference]: With dead ends: 43 [2019-02-15 10:44:55,256 INFO L226 Difference]: Without dead ends: 29 [2019-02-15 10:44:55,257 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-02-15 10:44:55,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-02-15 10:44:55,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-02-15 10:44:55,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-02-15 10:44:55,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-02-15 10:44:55,262 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 26 [2019-02-15 10:44:55,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:44:55,262 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-02-15 10:44:55,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-02-15 10:44:55,262 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-02-15 10:44:55,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-02-15 10:44:55,263 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:44:55,263 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1] [2019-02-15 10:44:55,264 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:44:55,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:44:55,264 INFO L82 PathProgramCache]: Analyzing trace with hash -454857078, now seen corresponding path program 12 times [2019-02-15 10:44:55,264 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:44:55,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:44:55,265 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:44:55,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:44:55,265 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:44:55,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:44:55,468 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-02-15 10:44:55,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:44:55,469 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:44:55,469 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:44:55,469 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:44:55,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:44:55,469 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:44:55,480 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:44:55,480 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:44:55,504 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:44:55,504 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:44:55,506 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:44:55,514 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-02-15 10:44:55,514 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:44:55,798 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-02-15 10:44:55,818 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:44:55,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2019-02-15 10:44:55,818 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:44:55,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-02-15 10:44:55,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-02-15 10:44:55,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-02-15 10:44:55,820 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 15 states. [2019-02-15 10:44:55,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:44:55,974 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2019-02-15 10:44:55,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-02-15 10:44:55,975 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2019-02-15 10:44:55,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:44:55,976 INFO L225 Difference]: With dead ends: 46 [2019-02-15 10:44:55,976 INFO L226 Difference]: Without dead ends: 31 [2019-02-15 10:44:55,977 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-02-15 10:44:55,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-02-15 10:44:55,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-02-15 10:44:55,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-02-15 10:44:55,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2019-02-15 10:44:55,981 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 28 [2019-02-15 10:44:55,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:44:55,982 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2019-02-15 10:44:55,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-02-15 10:44:55,982 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2019-02-15 10:44:55,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-02-15 10:44:55,982 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:44:55,983 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1] [2019-02-15 10:44:55,983 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:44:55,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:44:55,983 INFO L82 PathProgramCache]: Analyzing trace with hash -319437323, now seen corresponding path program 13 times [2019-02-15 10:44:55,983 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:44:55,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:44:55,984 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:44:55,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:44:55,984 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:44:55,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:44:56,198 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-02-15 10:44:56,198 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:44:56,198 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:44:56,199 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:44:56,199 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:44:56,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:44:56,199 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:44:56,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:44:56,208 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:44:56,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:44:56,250 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:44:56,259 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-02-15 10:44:56,260 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:44:57,003 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-02-15 10:44:57,023 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:44:57,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2019-02-15 10:44:57,024 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:44:57,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-02-15 10:44:57,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-02-15 10:44:57,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-02-15 10:44:57,025 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 16 states. [2019-02-15 10:44:57,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:44:57,212 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2019-02-15 10:44:57,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-02-15 10:44:57,212 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2019-02-15 10:44:57,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:44:57,213 INFO L225 Difference]: With dead ends: 49 [2019-02-15 10:44:57,214 INFO L226 Difference]: Without dead ends: 33 [2019-02-15 10:44:57,215 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-02-15 10:44:57,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-02-15 10:44:57,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-02-15 10:44:57,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-02-15 10:44:57,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2019-02-15 10:44:57,221 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 30 [2019-02-15 10:44:57,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:44:57,221 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2019-02-15 10:44:57,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-02-15 10:44:57,222 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2019-02-15 10:44:57,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-02-15 10:44:57,223 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:44:57,223 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1] [2019-02-15 10:44:57,223 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:44:57,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:44:57,223 INFO L82 PathProgramCache]: Analyzing trace with hash 969405866, now seen corresponding path program 14 times [2019-02-15 10:44:57,224 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:44:57,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:44:57,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:44:57,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:44:57,225 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:44:57,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:44:57,510 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-02-15 10:44:57,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:44:57,510 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:44:57,510 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:44:57,511 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:44:57,511 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:44:57,511 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:44:57,522 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:44:57,522 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:44:57,565 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-02-15 10:44:57,565 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:44:57,568 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:44:57,575 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-02-15 10:44:57,575 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:44:58,021 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-02-15 10:44:58,040 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:44:58,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2019-02-15 10:44:58,040 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:44:58,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-02-15 10:44:58,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-02-15 10:44:58,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-02-15 10:44:58,041 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 17 states. [2019-02-15 10:44:58,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:44:58,099 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2019-02-15 10:44:58,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-02-15 10:44:58,100 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2019-02-15 10:44:58,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:44:58,101 INFO L225 Difference]: With dead ends: 52 [2019-02-15 10:44:58,101 INFO L226 Difference]: Without dead ends: 35 [2019-02-15 10:44:58,102 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-02-15 10:44:58,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-02-15 10:44:58,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-02-15 10:44:58,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-02-15 10:44:58,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2019-02-15 10:44:58,106 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 32 [2019-02-15 10:44:58,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:44:58,106 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2019-02-15 10:44:58,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-02-15 10:44:58,106 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2019-02-15 10:44:58,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-02-15 10:44:58,107 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:44:58,107 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1] [2019-02-15 10:44:58,108 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:44:58,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:44:58,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1714035115, now seen corresponding path program 15 times [2019-02-15 10:44:58,108 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:44:58,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:44:58,109 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:44:58,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:44:58,109 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:44:58,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:44:58,757 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-02-15 10:44:58,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:44:58,758 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:44:58,758 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:44:58,758 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:44:58,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:44:58,759 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:44:58,775 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:44:58,775 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:44:58,801 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:44:58,801 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:44:58,803 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:44:58,810 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-02-15 10:44:58,811 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:44:59,143 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-02-15 10:44:59,161 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:44:59,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2019-02-15 10:44:59,162 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:44:59,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-02-15 10:44:59,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-02-15 10:44:59,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-02-15 10:44:59,163 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 18 states. [2019-02-15 10:44:59,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:44:59,256 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2019-02-15 10:44:59,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-02-15 10:44:59,256 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 34 [2019-02-15 10:44:59,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:44:59,257 INFO L225 Difference]: With dead ends: 55 [2019-02-15 10:44:59,258 INFO L226 Difference]: Without dead ends: 37 [2019-02-15 10:44:59,259 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-02-15 10:44:59,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-02-15 10:44:59,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-02-15 10:44:59,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-02-15 10:44:59,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2019-02-15 10:44:59,263 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 34 [2019-02-15 10:44:59,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:44:59,263 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2019-02-15 10:44:59,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-02-15 10:44:59,263 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2019-02-15 10:44:59,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-02-15 10:44:59,264 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:44:59,264 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1] [2019-02-15 10:44:59,264 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:44:59,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:44:59,265 INFO L82 PathProgramCache]: Analyzing trace with hash 272417994, now seen corresponding path program 16 times [2019-02-15 10:44:59,265 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:44:59,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:44:59,266 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:44:59,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:44:59,266 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:44:59,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:44:59,906 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-02-15 10:44:59,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:44:59,906 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:44:59,907 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:44:59,907 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:44:59,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:44:59,907 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:44:59,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:44:59,916 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:44:59,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:44:59,943 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:44:59,950 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-02-15 10:44:59,950 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:00,623 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-02-15 10:45:00,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:00,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2019-02-15 10:45:00,642 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:00,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-02-15 10:45:00,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-02-15 10:45:00,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-02-15 10:45:00,643 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 19 states. [2019-02-15 10:45:00,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:00,726 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2019-02-15 10:45:00,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-02-15 10:45:00,726 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 36 [2019-02-15 10:45:00,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:00,729 INFO L225 Difference]: With dead ends: 58 [2019-02-15 10:45:00,730 INFO L226 Difference]: Without dead ends: 39 [2019-02-15 10:45:00,731 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-02-15 10:45:00,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-02-15 10:45:00,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-02-15 10:45:00,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-02-15 10:45:00,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2019-02-15 10:45:00,735 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 36 [2019-02-15 10:45:00,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:00,736 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2019-02-15 10:45:00,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-02-15 10:45:00,736 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2019-02-15 10:45:00,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-02-15 10:45:00,737 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:00,737 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1] [2019-02-15 10:45:00,737 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:00,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:00,738 INFO L82 PathProgramCache]: Analyzing trace with hash -392102219, now seen corresponding path program 17 times [2019-02-15 10:45:00,738 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:00,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:00,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:00,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:00,739 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:00,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:01,002 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-02-15 10:45:01,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:01,002 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:01,002 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:01,003 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:01,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:01,003 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:45:01,012 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:45:01,012 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:45:01,061 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-02-15 10:45:01,062 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:45:01,065 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:01,072 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-02-15 10:45:01,072 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:02,024 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-02-15 10:45:02,046 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:02,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2019-02-15 10:45:02,046 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:02,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-02-15 10:45:02,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-02-15 10:45:02,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-02-15 10:45:02,047 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 20 states. [2019-02-15 10:45:02,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:02,122 INFO L93 Difference]: Finished difference Result 61 states and 64 transitions. [2019-02-15 10:45:02,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-02-15 10:45:02,123 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 38 [2019-02-15 10:45:02,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:02,124 INFO L225 Difference]: With dead ends: 61 [2019-02-15 10:45:02,124 INFO L226 Difference]: Without dead ends: 41 [2019-02-15 10:45:02,125 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-02-15 10:45:02,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-02-15 10:45:02,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-02-15 10:45:02,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-02-15 10:45:02,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2019-02-15 10:45:02,130 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 38 [2019-02-15 10:45:02,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:02,130 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2019-02-15 10:45:02,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-02-15 10:45:02,130 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2019-02-15 10:45:02,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-02-15 10:45:02,131 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:02,131 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1] [2019-02-15 10:45:02,132 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:02,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:02,132 INFO L82 PathProgramCache]: Analyzing trace with hash -536355862, now seen corresponding path program 18 times [2019-02-15 10:45:02,132 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:02,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:02,133 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:45:02,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:02,133 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:02,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:02,910 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-02-15 10:45:02,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:02,910 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:02,910 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:02,910 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:02,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:02,911 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:45:02,927 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:45:02,927 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:45:02,979 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:45:02,979 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:45:02,982 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:02,990 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-02-15 10:45:02,990 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:03,509 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-02-15 10:45:03,527 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:03,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2019-02-15 10:45:03,528 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:03,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-02-15 10:45:03,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-02-15 10:45:03,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-02-15 10:45:03,529 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 21 states. [2019-02-15 10:45:03,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:03,776 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2019-02-15 10:45:03,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-02-15 10:45:03,776 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 40 [2019-02-15 10:45:03,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:03,777 INFO L225 Difference]: With dead ends: 64 [2019-02-15 10:45:03,777 INFO L226 Difference]: Without dead ends: 43 [2019-02-15 10:45:03,778 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-02-15 10:45:03,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-02-15 10:45:03,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-02-15 10:45:03,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-02-15 10:45:03,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2019-02-15 10:45:03,783 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 40 [2019-02-15 10:45:03,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:03,783 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2019-02-15 10:45:03,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-02-15 10:45:03,783 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2019-02-15 10:45:03,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-02-15 10:45:03,784 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:03,784 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1] [2019-02-15 10:45:03,784 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:03,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:03,785 INFO L82 PathProgramCache]: Analyzing trace with hash -684650731, now seen corresponding path program 19 times [2019-02-15 10:45:03,785 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:03,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:03,785 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:45:03,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:03,786 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:03,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:04,027 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-02-15 10:45:04,028 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:04,028 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:04,028 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:04,028 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:04,028 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:04,028 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:45:04,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:04,039 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:45:04,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:04,067 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:04,074 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-02-15 10:45:04,074 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:04,591 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-02-15 10:45:04,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:04,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2019-02-15 10:45:04,612 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:04,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-02-15 10:45:04,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-02-15 10:45:04,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-02-15 10:45:04,614 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 22 states. [2019-02-15 10:45:04,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:04,690 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2019-02-15 10:45:04,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-02-15 10:45:04,691 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 42 [2019-02-15 10:45:04,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:04,691 INFO L225 Difference]: With dead ends: 67 [2019-02-15 10:45:04,692 INFO L226 Difference]: Without dead ends: 45 [2019-02-15 10:45:04,693 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-02-15 10:45:04,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-02-15 10:45:04,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-02-15 10:45:04,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-02-15 10:45:04,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2019-02-15 10:45:04,697 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 42 [2019-02-15 10:45:04,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:04,698 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2019-02-15 10:45:04,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-02-15 10:45:04,698 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2019-02-15 10:45:04,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-02-15 10:45:04,700 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:04,700 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1] [2019-02-15 10:45:04,701 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:04,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:04,701 INFO L82 PathProgramCache]: Analyzing trace with hash 728709898, now seen corresponding path program 20 times [2019-02-15 10:45:04,701 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:04,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:04,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:04,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:04,702 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:04,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:05,105 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-02-15 10:45:05,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:05,105 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:05,105 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:05,105 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:05,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:05,105 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:45:05,114 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:45:05,114 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:45:05,182 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-02-15 10:45:05,182 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:45:05,184 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:05,192 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-02-15 10:45:05,193 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:05,722 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-02-15 10:45:05,741 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:05,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2019-02-15 10:45:05,742 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:05,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-02-15 10:45:05,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-02-15 10:45:05,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-02-15 10:45:05,744 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 23 states. [2019-02-15 10:45:05,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:05,820 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2019-02-15 10:45:05,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-02-15 10:45:05,821 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 44 [2019-02-15 10:45:05,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:05,822 INFO L225 Difference]: With dead ends: 70 [2019-02-15 10:45:05,822 INFO L226 Difference]: Without dead ends: 47 [2019-02-15 10:45:05,823 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-02-15 10:45:05,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-02-15 10:45:05,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-02-15 10:45:05,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-02-15 10:45:05,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2019-02-15 10:45:05,827 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 44 [2019-02-15 10:45:05,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:05,827 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2019-02-15 10:45:05,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-02-15 10:45:05,828 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2019-02-15 10:45:05,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-02-15 10:45:05,829 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:05,830 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1] [2019-02-15 10:45:05,830 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:05,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:05,830 INFO L82 PathProgramCache]: Analyzing trace with hash 954210165, now seen corresponding path program 21 times [2019-02-15 10:45:05,830 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:05,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:05,831 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:45:05,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:05,831 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:05,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:06,210 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-02-15 10:45:06,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:06,211 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:06,211 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:06,212 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:06,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:06,212 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:45:06,222 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:45:06,222 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:45:06,258 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:45:06,258 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:45:06,261 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:06,270 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-02-15 10:45:06,270 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:07,118 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-02-15 10:45:07,137 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:07,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2019-02-15 10:45:07,137 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:07,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-02-15 10:45:07,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-02-15 10:45:07,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-02-15 10:45:07,139 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 24 states. [2019-02-15 10:45:07,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:07,265 INFO L93 Difference]: Finished difference Result 73 states and 76 transitions. [2019-02-15 10:45:07,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-02-15 10:45:07,267 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 46 [2019-02-15 10:45:07,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:07,268 INFO L225 Difference]: With dead ends: 73 [2019-02-15 10:45:07,268 INFO L226 Difference]: Without dead ends: 49 [2019-02-15 10:45:07,270 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-02-15 10:45:07,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-02-15 10:45:07,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-02-15 10:45:07,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-02-15 10:45:07,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2019-02-15 10:45:07,273 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 46 [2019-02-15 10:45:07,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:07,274 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2019-02-15 10:45:07,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-02-15 10:45:07,274 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2019-02-15 10:45:07,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-02-15 10:45:07,275 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:07,275 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1] [2019-02-15 10:45:07,275 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:07,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:07,275 INFO L82 PathProgramCache]: Analyzing trace with hash -549920214, now seen corresponding path program 22 times [2019-02-15 10:45:07,276 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:07,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:07,276 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:45:07,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:07,277 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:07,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:07,565 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-02-15 10:45:07,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:07,565 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:07,565 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:07,565 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:07,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:07,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 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:45:07,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:07,575 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:45:07,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:07,614 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:07,625 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-02-15 10:45:07,625 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:08,308 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-02-15 10:45:08,327 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:08,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2019-02-15 10:45:08,327 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:08,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-02-15 10:45:08,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-02-15 10:45:08,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-02-15 10:45:08,329 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 25 states. [2019-02-15 10:45:08,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:08,462 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2019-02-15 10:45:08,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-02-15 10:45:08,465 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 48 [2019-02-15 10:45:08,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:08,466 INFO L225 Difference]: With dead ends: 76 [2019-02-15 10:45:08,466 INFO L226 Difference]: Without dead ends: 51 [2019-02-15 10:45:08,467 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-02-15 10:45:08,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-02-15 10:45:08,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-02-15 10:45:08,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-02-15 10:45:08,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2019-02-15 10:45:08,470 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 48 [2019-02-15 10:45:08,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:08,471 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2019-02-15 10:45:08,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-02-15 10:45:08,471 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2019-02-15 10:45:08,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-02-15 10:45:08,471 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:08,471 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1] [2019-02-15 10:45:08,472 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:08,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:08,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1451759573, now seen corresponding path program 23 times [2019-02-15 10:45:08,472 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:08,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:08,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:08,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:08,473 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:08,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:08,949 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-02-15 10:45:08,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:08,949 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:08,949 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:08,949 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:08,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:08,949 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:45:08,959 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:45:08,959 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:45:09,041 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-02-15 10:45:09,042 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:45:09,045 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:09,053 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-02-15 10:45:09,053 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:09,694 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-02-15 10:45:09,714 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:09,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2019-02-15 10:45:09,715 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:09,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-02-15 10:45:09,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-02-15 10:45:09,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-02-15 10:45:09,716 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 26 states. [2019-02-15 10:45:09,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:09,810 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2019-02-15 10:45:09,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-02-15 10:45:09,810 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 50 [2019-02-15 10:45:09,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:09,811 INFO L225 Difference]: With dead ends: 79 [2019-02-15 10:45:09,811 INFO L226 Difference]: Without dead ends: 53 [2019-02-15 10:45:09,813 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-02-15 10:45:09,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-02-15 10:45:09,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-02-15 10:45:09,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-02-15 10:45:09,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2019-02-15 10:45:09,816 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 50 [2019-02-15 10:45:09,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:09,816 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2019-02-15 10:45:09,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-02-15 10:45:09,817 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2019-02-15 10:45:09,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-02-15 10:45:09,817 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:09,817 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1] [2019-02-15 10:45:09,817 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:09,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:09,818 INFO L82 PathProgramCache]: Analyzing trace with hash -1297428150, now seen corresponding path program 24 times [2019-02-15 10:45:09,818 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:09,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:09,818 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:45:09,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:09,818 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:09,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:10,820 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-02-15 10:45:10,820 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:10,820 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:10,820 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:10,820 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:10,820 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:10,820 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:45:10,828 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:45:10,828 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:45:10,874 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:45:10,874 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:45:10,876 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:10,882 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-02-15 10:45:10,882 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:11,658 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-02-15 10:45:11,676 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:11,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2019-02-15 10:45:11,676 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:11,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-02-15 10:45:11,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-02-15 10:45:11,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-02-15 10:45:11,678 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 27 states. [2019-02-15 10:45:11,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:11,835 INFO L93 Difference]: Finished difference Result 82 states and 85 transitions. [2019-02-15 10:45:11,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-02-15 10:45:11,836 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 52 [2019-02-15 10:45:11,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:11,836 INFO L225 Difference]: With dead ends: 82 [2019-02-15 10:45:11,836 INFO L226 Difference]: Without dead ends: 55 [2019-02-15 10:45:11,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-02-15 10:45:11,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-02-15 10:45:11,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-02-15 10:45:11,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-02-15 10:45:11,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2019-02-15 10:45:11,840 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 52 [2019-02-15 10:45:11,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:11,841 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2019-02-15 10:45:11,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-02-15 10:45:11,841 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2019-02-15 10:45:11,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-02-15 10:45:11,842 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:11,842 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1] [2019-02-15 10:45:11,842 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:11,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:11,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1904013259, now seen corresponding path program 25 times [2019-02-15 10:45:11,842 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:11,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:11,843 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:45:11,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:11,843 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:11,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:12,580 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-02-15 10:45:12,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:12,580 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:12,580 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:12,580 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:12,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:12,581 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:45:12,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:12,589 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:45:12,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:12,628 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:12,636 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-02-15 10:45:12,636 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:13,875 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-02-15 10:45:13,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:13,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2019-02-15 10:45:13,893 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:13,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-02-15 10:45:13,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-02-15 10:45:13,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-02-15 10:45:13,895 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 28 states. [2019-02-15 10:45:13,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:13,981 INFO L93 Difference]: Finished difference Result 85 states and 88 transitions. [2019-02-15 10:45:13,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-02-15 10:45:13,982 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 54 [2019-02-15 10:45:13,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:13,983 INFO L225 Difference]: With dead ends: 85 [2019-02-15 10:45:13,983 INFO L226 Difference]: Without dead ends: 57 [2019-02-15 10:45:13,985 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-02-15 10:45:13,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-02-15 10:45:13,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-02-15 10:45:13,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-02-15 10:45:13,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2019-02-15 10:45:13,988 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 54 [2019-02-15 10:45:13,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:13,989 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2019-02-15 10:45:13,989 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-02-15 10:45:13,989 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2019-02-15 10:45:13,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-02-15 10:45:13,989 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:13,989 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1] [2019-02-15 10:45:13,990 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:13,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:13,990 INFO L82 PathProgramCache]: Analyzing trace with hash -2020931478, now seen corresponding path program 26 times [2019-02-15 10:45:13,990 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:13,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:13,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:13,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:13,991 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:14,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:14,354 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-02-15 10:45:14,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:14,354 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:14,354 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:14,354 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:14,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:14,354 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:45:14,363 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:45:14,363 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:45:14,465 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-02-15 10:45:14,465 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:45:14,468 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:14,475 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-02-15 10:45:14,476 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:15,263 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-02-15 10:45:15,282 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:15,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2019-02-15 10:45:15,282 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:15,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-02-15 10:45:15,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-02-15 10:45:15,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-02-15 10:45:15,284 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 29 states. [2019-02-15 10:45:15,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:15,374 INFO L93 Difference]: Finished difference Result 88 states and 91 transitions. [2019-02-15 10:45:15,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-02-15 10:45:15,374 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 56 [2019-02-15 10:45:15,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:15,375 INFO L225 Difference]: With dead ends: 88 [2019-02-15 10:45:15,375 INFO L226 Difference]: Without dead ends: 59 [2019-02-15 10:45:15,376 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-02-15 10:45:15,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-02-15 10:45:15,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-02-15 10:45:15,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-02-15 10:45:15,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2019-02-15 10:45:15,378 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 56 [2019-02-15 10:45:15,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:15,378 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2019-02-15 10:45:15,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-02-15 10:45:15,379 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2019-02-15 10:45:15,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-02-15 10:45:15,379 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:15,379 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1] [2019-02-15 10:45:15,380 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:15,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:15,380 INFO L82 PathProgramCache]: Analyzing trace with hash -190119787, now seen corresponding path program 27 times [2019-02-15 10:45:15,380 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:15,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:15,381 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:45:15,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:15,381 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:15,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:15,827 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2019-02-15 10:45:15,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:15,827 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:15,828 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:15,828 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:15,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:15,828 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:45:15,836 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:45:15,837 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:45:15,878 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:45:15,878 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:45:15,880 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:15,889 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2019-02-15 10:45:15,889 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:17,342 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2019-02-15 10:45:17,360 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:17,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2019-02-15 10:45:17,360 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:17,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-02-15 10:45:17,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-02-15 10:45:17,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-02-15 10:45:17,362 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 30 states. [2019-02-15 10:45:17,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:17,485 INFO L93 Difference]: Finished difference Result 91 states and 94 transitions. [2019-02-15 10:45:17,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-02-15 10:45:17,486 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 58 [2019-02-15 10:45:17,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:17,487 INFO L225 Difference]: With dead ends: 91 [2019-02-15 10:45:17,487 INFO L226 Difference]: Without dead ends: 61 [2019-02-15 10:45:17,488 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-02-15 10:45:17,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-02-15 10:45:17,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-02-15 10:45:17,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-02-15 10:45:17,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2019-02-15 10:45:17,491 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 58 [2019-02-15 10:45:17,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:17,492 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2019-02-15 10:45:17,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-02-15 10:45:17,492 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2019-02-15 10:45:17,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-02-15 10:45:17,492 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:17,492 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1] [2019-02-15 10:45:17,493 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:17,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:17,493 INFO L82 PathProgramCache]: Analyzing trace with hash -903903350, now seen corresponding path program 28 times [2019-02-15 10:45:17,493 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:17,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:17,494 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:45:17,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:17,494 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:17,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:18,004 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-02-15 10:45:18,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:18,004 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:18,004 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:18,004 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:18,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:18,004 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:45:18,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:18,013 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:45:18,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:18,065 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:18,076 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-02-15 10:45:18,077 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:19,241 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-02-15 10:45:19,259 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:19,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 59 [2019-02-15 10:45:19,259 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:19,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-02-15 10:45:19,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-02-15 10:45:19,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-02-15 10:45:19,260 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 31 states. [2019-02-15 10:45:19,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:19,381 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2019-02-15 10:45:19,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-02-15 10:45:19,381 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 60 [2019-02-15 10:45:19,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:19,382 INFO L225 Difference]: With dead ends: 94 [2019-02-15 10:45:19,383 INFO L226 Difference]: Without dead ends: 63 [2019-02-15 10:45:19,384 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-02-15 10:45:19,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-02-15 10:45:19,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-02-15 10:45:19,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-02-15 10:45:19,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2019-02-15 10:45:19,387 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 60 [2019-02-15 10:45:19,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:19,387 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2019-02-15 10:45:19,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-02-15 10:45:19,388 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2019-02-15 10:45:19,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-02-15 10:45:19,388 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:19,388 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1] [2019-02-15 10:45:19,388 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:19,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:19,389 INFO L82 PathProgramCache]: Analyzing trace with hash -228988683, now seen corresponding path program 29 times [2019-02-15 10:45:19,389 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:19,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:19,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:19,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:19,390 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:19,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:19,822 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2019-02-15 10:45:19,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:19,822 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:19,822 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:19,822 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:19,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:19,823 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:45:19,830 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:45:19,831 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:45:19,992 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-02-15 10:45:19,992 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:45:19,996 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:20,007 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2019-02-15 10:45:20,007 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:21,063 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2019-02-15 10:45:21,082 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:21,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2019-02-15 10:45:21,083 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:21,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-02-15 10:45:21,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-02-15 10:45:21,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-02-15 10:45:21,084 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 32 states. [2019-02-15 10:45:21,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:21,189 INFO L93 Difference]: Finished difference Result 97 states and 100 transitions. [2019-02-15 10:45:21,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-02-15 10:45:21,190 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 62 [2019-02-15 10:45:21,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:21,191 INFO L225 Difference]: With dead ends: 97 [2019-02-15 10:45:21,191 INFO L226 Difference]: Without dead ends: 65 [2019-02-15 10:45:21,192 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-02-15 10:45:21,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-02-15 10:45:21,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-02-15 10:45:21,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-02-15 10:45:21,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2019-02-15 10:45:21,194 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 62 [2019-02-15 10:45:21,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:21,195 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2019-02-15 10:45:21,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-02-15 10:45:21,195 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2019-02-15 10:45:21,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-02-15 10:45:21,195 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:21,195 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1] [2019-02-15 10:45:21,195 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:21,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:21,196 INFO L82 PathProgramCache]: Analyzing trace with hash -785494358, now seen corresponding path program 30 times [2019-02-15 10:45:21,196 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:21,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:21,196 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:45:21,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:21,197 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:21,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:22,358 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-02-15 10:45:22,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:22,358 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:22,358 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:22,359 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:22,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:22,359 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:45:22,376 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:45:22,376 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:45:22,421 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:45:22,422 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:45:22,424 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:22,434 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-02-15 10:45:22,434 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:23,512 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-02-15 10:45:23,530 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:23,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2019-02-15 10:45:23,530 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:23,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-02-15 10:45:23,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-02-15 10:45:23,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-02-15 10:45:23,531 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 33 states. [2019-02-15 10:45:23,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:23,684 INFO L93 Difference]: Finished difference Result 100 states and 103 transitions. [2019-02-15 10:45:23,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-02-15 10:45:23,684 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 64 [2019-02-15 10:45:23,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:23,685 INFO L225 Difference]: With dead ends: 100 [2019-02-15 10:45:23,685 INFO L226 Difference]: Without dead ends: 67 [2019-02-15 10:45:23,686 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-02-15 10:45:23,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-02-15 10:45:23,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-02-15 10:45:23,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-02-15 10:45:23,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2019-02-15 10:45:23,688 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 64 [2019-02-15 10:45:23,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:23,689 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2019-02-15 10:45:23,689 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-02-15 10:45:23,689 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2019-02-15 10:45:23,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-02-15 10:45:23,690 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:23,690 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1] [2019-02-15 10:45:23,690 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:23,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:23,691 INFO L82 PathProgramCache]: Analyzing trace with hash -429274795, now seen corresponding path program 31 times [2019-02-15 10:45:23,691 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:23,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:23,691 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:45:23,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:23,692 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:23,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:24,208 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2019-02-15 10:45:24,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:24,208 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:24,208 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:24,208 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:24,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:24,209 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:45:24,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:24,217 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:45:24,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:24,263 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:24,275 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2019-02-15 10:45:24,275 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:25,444 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2019-02-15 10:45:25,462 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:25,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2019-02-15 10:45:25,462 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:25,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-02-15 10:45:25,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-02-15 10:45:25,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-02-15 10:45:25,463 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 34 states. [2019-02-15 10:45:25,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:25,580 INFO L93 Difference]: Finished difference Result 103 states and 106 transitions. [2019-02-15 10:45:25,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-02-15 10:45:25,581 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 66 [2019-02-15 10:45:25,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:25,581 INFO L225 Difference]: With dead ends: 103 [2019-02-15 10:45:25,581 INFO L226 Difference]: Without dead ends: 69 [2019-02-15 10:45:25,582 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-02-15 10:45:25,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-02-15 10:45:25,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-02-15 10:45:25,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-02-15 10:45:25,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2019-02-15 10:45:25,585 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 66 [2019-02-15 10:45:25,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:25,585 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2019-02-15 10:45:25,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-02-15 10:45:25,586 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2019-02-15 10:45:25,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-02-15 10:45:25,586 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:25,586 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1, 1] [2019-02-15 10:45:25,586 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:25,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:25,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1040014794, now seen corresponding path program 32 times [2019-02-15 10:45:25,587 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:25,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:25,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:25,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:25,588 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:25,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:26,126 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-02-15 10:45:26,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:26,127 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:26,127 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:26,127 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:26,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:26,127 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:45:26,135 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:45:26,135 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:45:26,302 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-02-15 10:45:26,302 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:45:26,305 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:26,316 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-02-15 10:45:26,316 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:27,894 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-02-15 10:45:27,913 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:27,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 67 [2019-02-15 10:45:27,913 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:27,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-02-15 10:45:27,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-02-15 10:45:27,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-02-15 10:45:27,915 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 35 states. [2019-02-15 10:45:28,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:28,058 INFO L93 Difference]: Finished difference Result 106 states and 109 transitions. [2019-02-15 10:45:28,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-02-15 10:45:28,059 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 68 [2019-02-15 10:45:28,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:28,060 INFO L225 Difference]: With dead ends: 106 [2019-02-15 10:45:28,060 INFO L226 Difference]: Without dead ends: 71 [2019-02-15 10:45:28,061 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-02-15 10:45:28,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-02-15 10:45:28,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-02-15 10:45:28,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-02-15 10:45:28,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2019-02-15 10:45:28,064 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 68 [2019-02-15 10:45:28,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:28,064 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2019-02-15 10:45:28,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-02-15 10:45:28,065 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2019-02-15 10:45:28,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-02-15 10:45:28,065 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:28,065 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1] [2019-02-15 10:45:28,065 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:28,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:28,066 INFO L82 PathProgramCache]: Analyzing trace with hash -986406475, now seen corresponding path program 33 times [2019-02-15 10:45:28,066 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:28,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:28,067 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:45:28,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:28,067 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:28,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:28,599 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2019-02-15 10:45:28,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:28,600 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:28,600 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:28,600 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:28,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:28,600 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:45:28,609 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:45:28,609 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:45:28,660 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:45:28,660 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:45:28,662 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:28,671 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2019-02-15 10:45:28,671 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:29,980 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2019-02-15 10:45:29,998 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:29,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2019-02-15 10:45:29,998 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:29,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-02-15 10:45:29,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-02-15 10:45:29,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-02-15 10:45:30,000 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 36 states. [2019-02-15 10:45:30,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:30,170 INFO L93 Difference]: Finished difference Result 109 states and 112 transitions. [2019-02-15 10:45:30,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-02-15 10:45:30,171 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 70 [2019-02-15 10:45:30,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:30,172 INFO L225 Difference]: With dead ends: 109 [2019-02-15 10:45:30,172 INFO L226 Difference]: Without dead ends: 73 [2019-02-15 10:45:30,172 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-02-15 10:45:30,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-02-15 10:45:30,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-02-15 10:45:30,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-02-15 10:45:30,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2019-02-15 10:45:30,174 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 70 [2019-02-15 10:45:30,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:30,175 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2019-02-15 10:45:30,175 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-02-15 10:45:30,175 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2019-02-15 10:45:30,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-02-15 10:45:30,175 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:30,176 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1] [2019-02-15 10:45:30,176 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:30,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:30,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1548924138, now seen corresponding path program 34 times [2019-02-15 10:45:30,176 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:30,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:30,177 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:45:30,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:30,177 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:30,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:30,992 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2019-02-15 10:45:30,992 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:30,992 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:30,993 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:30,993 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:30,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:30,993 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:45:31,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:31,004 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:45:31,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:31,054 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:31,066 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2019-02-15 10:45:31,066 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:32,648 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2019-02-15 10:45:32,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:32,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 71 [2019-02-15 10:45:32,667 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:32,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-02-15 10:45:32,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-02-15 10:45:32,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-02-15 10:45:32,668 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 37 states. [2019-02-15 10:45:32,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:32,915 INFO L93 Difference]: Finished difference Result 112 states and 115 transitions. [2019-02-15 10:45:32,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-02-15 10:45:32,916 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 72 [2019-02-15 10:45:32,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:32,917 INFO L225 Difference]: With dead ends: 112 [2019-02-15 10:45:32,917 INFO L226 Difference]: Without dead ends: 75 [2019-02-15 10:45:32,917 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-02-15 10:45:32,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-02-15 10:45:32,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-02-15 10:45:32,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-02-15 10:45:32,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2019-02-15 10:45:32,921 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 72 [2019-02-15 10:45:32,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:32,921 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2019-02-15 10:45:32,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-02-15 10:45:32,922 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2019-02-15 10:45:32,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-02-15 10:45:32,922 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:32,922 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 1, 1, 1, 1] [2019-02-15 10:45:32,922 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:32,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:32,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1198231019, now seen corresponding path program 35 times [2019-02-15 10:45:32,923 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:32,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:32,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:32,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:32,924 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:32,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:33,468 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2019-02-15 10:45:33,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:33,469 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:33,469 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:33,469 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:33,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:33,469 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:45:33,478 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:45:33,479 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:45:33,836 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2019-02-15 10:45:33,836 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:45:33,841 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:33,853 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2019-02-15 10:45:33,854 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:35,250 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2019-02-15 10:45:35,269 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:35,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2019-02-15 10:45:35,269 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:35,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-02-15 10:45:35,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-02-15 10:45:35,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-02-15 10:45:35,270 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 38 states. [2019-02-15 10:45:35,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:35,405 INFO L93 Difference]: Finished difference Result 115 states and 118 transitions. [2019-02-15 10:45:35,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-02-15 10:45:35,405 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 74 [2019-02-15 10:45:35,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:35,406 INFO L225 Difference]: With dead ends: 115 [2019-02-15 10:45:35,406 INFO L226 Difference]: Without dead ends: 77 [2019-02-15 10:45:35,407 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-02-15 10:45:35,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-02-15 10:45:35,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-02-15 10:45:35,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-02-15 10:45:35,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2019-02-15 10:45:35,409 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 74 [2019-02-15 10:45:35,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:35,409 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2019-02-15 10:45:35,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-02-15 10:45:35,409 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2019-02-15 10:45:35,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-02-15 10:45:35,409 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:35,409 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 1, 1, 1, 1] [2019-02-15 10:45:35,410 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:35,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:35,410 INFO L82 PathProgramCache]: Analyzing trace with hash -2106305526, now seen corresponding path program 36 times [2019-02-15 10:45:35,410 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:35,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:35,411 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:45:35,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:35,411 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:35,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:36,034 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2019-02-15 10:45:36,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:36,035 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:36,035 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:36,035 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:36,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:36,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 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:45:36,044 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:45:36,044 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:45:36,100 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:45:36,100 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:45:36,102 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:36,114 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2019-02-15 10:45:36,114 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:37,965 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2019-02-15 10:45:37,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:37,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 75 [2019-02-15 10:45:37,983 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:37,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-02-15 10:45:37,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-02-15 10:45:37,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-02-15 10:45:37,984 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 39 states. [2019-02-15 10:45:38,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:38,127 INFO L93 Difference]: Finished difference Result 118 states and 121 transitions. [2019-02-15 10:45:38,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-02-15 10:45:38,127 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 76 [2019-02-15 10:45:38,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:38,128 INFO L225 Difference]: With dead ends: 118 [2019-02-15 10:45:38,128 INFO L226 Difference]: Without dead ends: 79 [2019-02-15 10:45:38,129 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-02-15 10:45:38,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-02-15 10:45:38,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-02-15 10:45:38,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-02-15 10:45:38,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2019-02-15 10:45:38,133 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 76 [2019-02-15 10:45:38,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:38,133 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2019-02-15 10:45:38,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-02-15 10:45:38,133 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2019-02-15 10:45:38,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-02-15 10:45:38,134 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:38,134 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 1, 1, 1, 1] [2019-02-15 10:45:38,134 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:38,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:38,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1075627403, now seen corresponding path program 37 times [2019-02-15 10:45:38,134 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:38,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:38,135 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:45:38,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:38,135 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:38,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:38,752 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2019-02-15 10:45:38,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:38,753 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:38,753 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:38,753 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:38,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:38,753 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:45:38,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:38,761 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:45:38,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:38,817 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:38,829 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2019-02-15 10:45:38,830 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:40,573 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2019-02-15 10:45:40,591 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:40,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 77 [2019-02-15 10:45:40,592 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:40,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-02-15 10:45:40,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-02-15 10:45:40,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-02-15 10:45:40,593 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 40 states. [2019-02-15 10:45:40,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:40,746 INFO L93 Difference]: Finished difference Result 121 states and 124 transitions. [2019-02-15 10:45:40,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-02-15 10:45:40,746 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 78 [2019-02-15 10:45:40,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:40,747 INFO L225 Difference]: With dead ends: 121 [2019-02-15 10:45:40,747 INFO L226 Difference]: Without dead ends: 81 [2019-02-15 10:45:40,748 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-02-15 10:45:40,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-02-15 10:45:40,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-02-15 10:45:40,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-02-15 10:45:40,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2019-02-15 10:45:40,750 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 78 [2019-02-15 10:45:40,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:40,750 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2019-02-15 10:45:40,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-02-15 10:45:40,750 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2019-02-15 10:45:40,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-02-15 10:45:40,750 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:40,751 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 1, 1, 1, 1] [2019-02-15 10:45:40,751 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:40,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:40,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1898461994, now seen corresponding path program 38 times [2019-02-15 10:45:40,751 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:40,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:40,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:40,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:40,752 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:40,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:41,471 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2019-02-15 10:45:41,472 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:41,472 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:41,472 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:41,472 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:41,472 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:41,472 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:45:41,482 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:45:41,482 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:45:41,864 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-02-15 10:45:41,865 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:45:41,869 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:41,882 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2019-02-15 10:45:41,882 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:43,855 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2019-02-15 10:45:43,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:43,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 79 [2019-02-15 10:45:43,876 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:43,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-02-15 10:45:43,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-02-15 10:45:43,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-02-15 10:45:43,877 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 41 states. [2019-02-15 10:45:44,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:44,021 INFO L93 Difference]: Finished difference Result 124 states and 127 transitions. [2019-02-15 10:45:44,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-02-15 10:45:44,022 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 80 [2019-02-15 10:45:44,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:44,023 INFO L225 Difference]: With dead ends: 124 [2019-02-15 10:45:44,023 INFO L226 Difference]: Without dead ends: 83 [2019-02-15 10:45:44,023 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-02-15 10:45:44,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-02-15 10:45:44,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-02-15 10:45:44,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-02-15 10:45:44,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2019-02-15 10:45:44,026 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 80 [2019-02-15 10:45:44,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:44,026 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2019-02-15 10:45:44,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-02-15 10:45:44,026 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2019-02-15 10:45:44,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-02-15 10:45:44,027 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:44,027 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 1, 1, 1, 1] [2019-02-15 10:45:44,027 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:44,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:44,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1341848277, now seen corresponding path program 39 times [2019-02-15 10:45:44,027 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:44,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:44,028 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:45:44,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:44,028 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:44,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:44,796 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2019-02-15 10:45:44,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:44,797 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:44,797 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:44,797 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:44,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:44,797 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:45:44,806 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:45:44,806 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:45:44,871 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:45:44,871 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:45:44,874 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:44,883 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2019-02-15 10:45:44,883 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:46,552 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2019-02-15 10:45:46,571 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:46,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 81 [2019-02-15 10:45:46,572 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:46,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-02-15 10:45:46,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-02-15 10:45:46,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-02-15 10:45:46,573 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand 42 states. [2019-02-15 10:45:46,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:46,718 INFO L93 Difference]: Finished difference Result 127 states and 130 transitions. [2019-02-15 10:45:46,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-02-15 10:45:46,718 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 82 [2019-02-15 10:45:46,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:46,719 INFO L225 Difference]: With dead ends: 127 [2019-02-15 10:45:46,719 INFO L226 Difference]: Without dead ends: 85 [2019-02-15 10:45:46,719 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-02-15 10:45:46,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-02-15 10:45:46,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-02-15 10:45:46,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-02-15 10:45:46,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2019-02-15 10:45:46,723 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 82 [2019-02-15 10:45:46,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:46,723 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2019-02-15 10:45:46,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-02-15 10:45:46,723 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2019-02-15 10:45:46,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-02-15 10:45:46,724 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:46,724 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 1, 1, 1, 1] [2019-02-15 10:45:46,724 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:46,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:46,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1280021942, now seen corresponding path program 40 times [2019-02-15 10:45:46,724 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:46,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:46,725 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:45:46,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:46,725 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:46,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:47,562 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2019-02-15 10:45:47,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:47,563 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:47,563 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:47,563 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:47,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:47,563 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:45:47,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:47,571 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:45:47,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:47,629 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:47,640 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2019-02-15 10:45:47,641 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:49,699 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2019-02-15 10:45:49,717 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:49,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 83 [2019-02-15 10:45:49,718 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:49,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-02-15 10:45:49,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-02-15 10:45:49,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-02-15 10:45:49,719 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 43 states. [2019-02-15 10:45:49,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:49,875 INFO L93 Difference]: Finished difference Result 130 states and 133 transitions. [2019-02-15 10:45:49,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-02-15 10:45:49,876 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 84 [2019-02-15 10:45:49,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:49,877 INFO L225 Difference]: With dead ends: 130 [2019-02-15 10:45:49,877 INFO L226 Difference]: Without dead ends: 87 [2019-02-15 10:45:49,878 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-02-15 10:45:49,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-02-15 10:45:49,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-02-15 10:45:49,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-02-15 10:45:49,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2019-02-15 10:45:49,881 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 84 [2019-02-15 10:45:49,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:49,881 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2019-02-15 10:45:49,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-02-15 10:45:49,881 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2019-02-15 10:45:49,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-02-15 10:45:49,882 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:49,882 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 1, 1, 1, 1] [2019-02-15 10:45:49,882 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:49,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:49,883 INFO L82 PathProgramCache]: Analyzing trace with hash -214584523, now seen corresponding path program 41 times [2019-02-15 10:45:49,883 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:49,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:49,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:49,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:49,884 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:49,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:50,971 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2019-02-15 10:45:50,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:50,972 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:50,972 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:50,972 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:50,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:50,972 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:45:50,981 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:45:50,981 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:45:51,301 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-02-15 10:45:51,301 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:45:51,306 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:51,319 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2019-02-15 10:45:51,319 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:53,393 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2019-02-15 10:45:53,412 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:53,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 85 [2019-02-15 10:45:53,413 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:53,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-02-15 10:45:53,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-02-15 10:45:53,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-02-15 10:45:53,414 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 44 states. [2019-02-15 10:45:53,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:53,573 INFO L93 Difference]: Finished difference Result 133 states and 136 transitions. [2019-02-15 10:45:53,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-02-15 10:45:53,573 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 86 [2019-02-15 10:45:53,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:53,574 INFO L225 Difference]: With dead ends: 133 [2019-02-15 10:45:53,574 INFO L226 Difference]: Without dead ends: 89 [2019-02-15 10:45:53,574 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-02-15 10:45:53,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-02-15 10:45:53,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-02-15 10:45:53,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-02-15 10:45:53,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2019-02-15 10:45:53,578 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 86 [2019-02-15 10:45:53,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:53,578 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2019-02-15 10:45:53,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-02-15 10:45:53,578 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2019-02-15 10:45:53,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-02-15 10:45:53,579 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:53,579 INFO L402 BasicCegarLoop]: trace histogram [42, 42, 1, 1, 1, 1] [2019-02-15 10:45:53,579 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:53,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:53,579 INFO L82 PathProgramCache]: Analyzing trace with hash -2170518, now seen corresponding path program 42 times [2019-02-15 10:45:53,580 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:53,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:53,580 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:45:53,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:53,581 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:53,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:55,496 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2019-02-15 10:45:55,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:55,497 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:55,497 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:55,497 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:55,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:55,497 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:45:55,505 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:45:55,506 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:45:55,565 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:45:55,566 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:45:55,568 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:55,581 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2019-02-15 10:45:55,581 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:57,662 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2019-02-15 10:45:57,680 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:57,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 87 [2019-02-15 10:45:57,680 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:57,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-02-15 10:45:57,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-02-15 10:45:57,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-02-15 10:45:57,681 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand 45 states. [2019-02-15 10:45:57,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:57,916 INFO L93 Difference]: Finished difference Result 136 states and 139 transitions. [2019-02-15 10:45:57,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-02-15 10:45:57,917 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 88 [2019-02-15 10:45:57,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:57,917 INFO L225 Difference]: With dead ends: 136 [2019-02-15 10:45:57,918 INFO L226 Difference]: Without dead ends: 91 [2019-02-15 10:45:57,919 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-02-15 10:45:57,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-02-15 10:45:57,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-02-15 10:45:57,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-02-15 10:45:57,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2019-02-15 10:45:57,923 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 88 [2019-02-15 10:45:57,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:57,923 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2019-02-15 10:45:57,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-02-15 10:45:57,923 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2019-02-15 10:45:57,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-02-15 10:45:57,924 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:57,924 INFO L402 BasicCegarLoop]: trace histogram [43, 43, 1, 1, 1, 1] [2019-02-15 10:45:57,924 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:57,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:57,924 INFO L82 PathProgramCache]: Analyzing trace with hash -378707051, now seen corresponding path program 43 times [2019-02-15 10:45:57,924 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:57,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:57,925 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:45:57,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:57,925 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:57,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:58,977 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2019-02-15 10:45:58,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:58,977 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:58,977 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:58,977 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:58,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:58,977 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:45:58,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:58,986 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:45:59,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:59,052 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:59,063 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2019-02-15 10:45:59,063 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:46:01,087 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2019-02-15 10:46:01,114 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:46:01,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 89 [2019-02-15 10:46:01,115 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:46:01,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-02-15 10:46:01,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-02-15 10:46:01,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-02-15 10:46:01,116 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand 46 states. [2019-02-15 10:46:01,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:46:01,381 INFO L93 Difference]: Finished difference Result 139 states and 142 transitions. [2019-02-15 10:46:01,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-02-15 10:46:01,381 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 90 [2019-02-15 10:46:01,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:46:01,382 INFO L225 Difference]: With dead ends: 139 [2019-02-15 10:46:01,382 INFO L226 Difference]: Without dead ends: 93 [2019-02-15 10:46:01,383 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-02-15 10:46:01,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-02-15 10:46:01,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-02-15 10:46:01,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-02-15 10:46:01,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2019-02-15 10:46:01,385 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 90 [2019-02-15 10:46:01,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:46:01,385 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2019-02-15 10:46:01,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-02-15 10:46:01,385 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2019-02-15 10:46:01,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-02-15 10:46:01,386 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:46:01,386 INFO L402 BasicCegarLoop]: trace histogram [44, 44, 1, 1, 1, 1] [2019-02-15 10:46:01,386 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:46:01,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:46:01,386 INFO L82 PathProgramCache]: Analyzing trace with hash -1779588982, now seen corresponding path program 44 times [2019-02-15 10:46:01,386 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:46:01,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:01,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:46:01,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:01,387 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:46:01,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:46:02,239 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-02-15 10:46:02,239 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:02,239 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:46:02,239 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:46:02,239 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:46:02,240 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:02,240 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:46:02,247 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:46:02,247 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:46:02,613 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2019-02-15 10:46:02,613 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:46:02,618 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:46:02,627 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-02-15 10:46:02,628 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:46:05,018 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-02-15 10:46:05,037 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:46:05,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 91 [2019-02-15 10:46:05,038 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:46:05,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-02-15 10:46:05,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-02-15 10:46:05,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-02-15 10:46:05,039 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand 47 states. [2019-02-15 10:46:06,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:46:06,906 INFO L93 Difference]: Finished difference Result 142 states and 145 transitions. [2019-02-15 10:46:06,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-02-15 10:46:06,907 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 92 [2019-02-15 10:46:06,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:46:06,907 INFO L225 Difference]: With dead ends: 142 [2019-02-15 10:46:06,907 INFO L226 Difference]: Without dead ends: 95 [2019-02-15 10:46:06,908 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-02-15 10:46:06,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-02-15 10:46:06,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-02-15 10:46:06,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-02-15 10:46:06,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2019-02-15 10:46:06,911 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 92 [2019-02-15 10:46:06,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:46:06,911 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2019-02-15 10:46:06,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-02-15 10:46:06,912 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2019-02-15 10:46:06,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-02-15 10:46:06,912 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:46:06,912 INFO L402 BasicCegarLoop]: trace histogram [45, 45, 1, 1, 1, 1] [2019-02-15 10:46:06,912 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:46:06,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:46:06,913 INFO L82 PathProgramCache]: Analyzing trace with hash -939783179, now seen corresponding path program 45 times [2019-02-15 10:46:06,913 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:46:06,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:06,913 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:46:06,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:06,913 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:46:06,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:46:07,845 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2019-02-15 10:46:07,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:07,845 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:46:07,845 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:46:07,846 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:46:07,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:07,846 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:46:07,868 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:46:07,868 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:46:07,945 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:46:07,946 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:46:07,948 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:46:07,965 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2019-02-15 10:46:07,966 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:46:11,385 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2019-02-15 10:46:11,405 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:46:11,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 93 [2019-02-15 10:46:11,405 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:46:11,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-02-15 10:46:11,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-02-15 10:46:11,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-02-15 10:46:11,406 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand 48 states. [2019-02-15 10:46:11,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:46:11,638 INFO L93 Difference]: Finished difference Result 145 states and 148 transitions. [2019-02-15 10:46:11,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-02-15 10:46:11,641 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 94 [2019-02-15 10:46:11,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:46:11,641 INFO L225 Difference]: With dead ends: 145 [2019-02-15 10:46:11,641 INFO L226 Difference]: Without dead ends: 97 [2019-02-15 10:46:11,642 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-02-15 10:46:11,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-02-15 10:46:11,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-02-15 10:46:11,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-02-15 10:46:11,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2019-02-15 10:46:11,644 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 94 [2019-02-15 10:46:11,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:46:11,644 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2019-02-15 10:46:11,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-02-15 10:46:11,645 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2019-02-15 10:46:11,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-02-15 10:46:11,645 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:46:11,645 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1] [2019-02-15 10:46:11,645 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:46:11,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:46:11,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1599690838, now seen corresponding path program 46 times [2019-02-15 10:46:11,646 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:46:11,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:11,646 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:46:11,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:11,647 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:46:11,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:46:13,121 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-02-15 10:46:13,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:13,121 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:46:13,121 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:46:13,121 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:46:13,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:13,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 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:46:13,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:46:13,130 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:46:13,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:46:13,197 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:46:13,211 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-02-15 10:46:13,211 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:46:15,703 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-02-15 10:46:15,722 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:46:15,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2019-02-15 10:46:15,722 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:46:15,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-02-15 10:46:15,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-02-15 10:46:15,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-02-15 10:46:15,723 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 49 states. [2019-02-15 10:46:16,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:46:16,063 INFO L93 Difference]: Finished difference Result 148 states and 151 transitions. [2019-02-15 10:46:16,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-02-15 10:46:16,064 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 96 [2019-02-15 10:46:16,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:46:16,065 INFO L225 Difference]: With dead ends: 148 [2019-02-15 10:46:16,065 INFO L226 Difference]: Without dead ends: 99 [2019-02-15 10:46:16,066 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-02-15 10:46:16,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-02-15 10:46:16,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-02-15 10:46:16,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-02-15 10:46:16,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2019-02-15 10:46:16,070 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 96 [2019-02-15 10:46:16,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:46:16,070 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2019-02-15 10:46:16,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-02-15 10:46:16,070 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2019-02-15 10:46:16,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-02-15 10:46:16,071 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:46:16,071 INFO L402 BasicCegarLoop]: trace histogram [47, 47, 1, 1, 1, 1] [2019-02-15 10:46:16,071 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:46:16,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:46:16,072 INFO L82 PathProgramCache]: Analyzing trace with hash 431729749, now seen corresponding path program 47 times [2019-02-15 10:46:16,072 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:46:16,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:16,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:46:16,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:16,072 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:46:16,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:46:17,054 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2019-02-15 10:46:17,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:17,054 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:46:17,054 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:46:17,054 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:46:17,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:17,054 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:46:17,062 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:46:17,062 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:46:17,560 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2019-02-15 10:46:17,561 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:46:17,567 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:46:17,583 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2019-02-15 10:46:17,583 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:46:20,351 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2019-02-15 10:46:20,371 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:46:20,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2019-02-15 10:46:20,372 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:46:20,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-02-15 10:46:20,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-02-15 10:46:20,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-02-15 10:46:20,373 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 50 states. [2019-02-15 10:46:20,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:46:20,553 INFO L93 Difference]: Finished difference Result 151 states and 154 transitions. [2019-02-15 10:46:20,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-02-15 10:46:20,554 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 98 [2019-02-15 10:46:20,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:46:20,554 INFO L225 Difference]: With dead ends: 151 [2019-02-15 10:46:20,554 INFO L226 Difference]: Without dead ends: 101 [2019-02-15 10:46:20,555 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-02-15 10:46:20,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-02-15 10:46:20,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-02-15 10:46:20,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-02-15 10:46:20,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 102 transitions. [2019-02-15 10:46:20,558 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 102 transitions. Word has length 98 [2019-02-15 10:46:20,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:46:20,559 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 102 transitions. [2019-02-15 10:46:20,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-02-15 10:46:20,559 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 102 transitions. [2019-02-15 10:46:20,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-02-15 10:46:20,559 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:46:20,559 INFO L402 BasicCegarLoop]: trace histogram [48, 48, 1, 1, 1, 1] [2019-02-15 10:46:20,559 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:46:20,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:46:20,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1789921590, now seen corresponding path program 48 times [2019-02-15 10:46:20,560 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:46:20,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:20,560 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:46:20,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:20,561 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:46:20,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:46:21,564 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2019-02-15 10:46:21,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:21,564 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:46:21,564 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:46:21,564 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:46:21,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:21,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 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:46:21,574 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:46:21,574 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:46:21,645 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:46:21,646 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:46:21,648 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:46:21,665 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2019-02-15 10:46:21,665 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:46:24,359 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2019-02-15 10:46:24,378 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:46:24,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 99 [2019-02-15 10:46:24,379 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:46:24,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-02-15 10:46:24,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-02-15 10:46:24,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-02-15 10:46:24,380 INFO L87 Difference]: Start difference. First operand 101 states and 102 transitions. Second operand 51 states. [2019-02-15 10:46:24,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:46:24,621 INFO L93 Difference]: Finished difference Result 154 states and 157 transitions. [2019-02-15 10:46:24,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-02-15 10:46:24,623 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 100 [2019-02-15 10:46:24,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:46:24,624 INFO L225 Difference]: With dead ends: 154 [2019-02-15 10:46:24,624 INFO L226 Difference]: Without dead ends: 103 [2019-02-15 10:46:24,625 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-02-15 10:46:24,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-02-15 10:46:24,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-02-15 10:46:24,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-02-15 10:46:24,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2019-02-15 10:46:24,629 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 100 [2019-02-15 10:46:24,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:46:24,629 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2019-02-15 10:46:24,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-02-15 10:46:24,629 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2019-02-15 10:46:24,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-02-15 10:46:24,630 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:46:24,630 INFO L402 BasicCegarLoop]: trace histogram [49, 49, 1, 1, 1, 1] [2019-02-15 10:46:24,630 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:46:24,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:46:24,631 INFO L82 PathProgramCache]: Analyzing trace with hash -16366411, now seen corresponding path program 49 times [2019-02-15 10:46:24,631 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:46:24,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:24,631 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:46:24,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:24,632 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:46:24,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:46:25,719 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2019-02-15 10:46:25,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:25,720 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:46:25,720 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:46:25,720 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:46:25,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:25,720 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:46:25,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:46:25,729 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:46:25,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:46:25,811 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:46:25,823 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2019-02-15 10:46:25,823 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:46:28,447 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2019-02-15 10:46:28,465 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:46:28,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 101 [2019-02-15 10:46:28,465 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:46:28,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-02-15 10:46:28,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-02-15 10:46:28,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-02-15 10:46:28,466 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 52 states. [2019-02-15 10:46:28,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:46:28,775 INFO L93 Difference]: Finished difference Result 157 states and 160 transitions. [2019-02-15 10:46:28,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-02-15 10:46:28,776 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 102 [2019-02-15 10:46:28,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:46:28,777 INFO L225 Difference]: With dead ends: 157 [2019-02-15 10:46:28,777 INFO L226 Difference]: Without dead ends: 105 [2019-02-15 10:46:28,777 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-02-15 10:46:28,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-02-15 10:46:28,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-02-15 10:46:28,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-02-15 10:46:28,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2019-02-15 10:46:28,782 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 102 [2019-02-15 10:46:28,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:46:28,782 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2019-02-15 10:46:28,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-02-15 10:46:28,782 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2019-02-15 10:46:28,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-02-15 10:46:28,783 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:46:28,783 INFO L402 BasicCegarLoop]: trace histogram [50, 50, 1, 1, 1, 1] [2019-02-15 10:46:28,783 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:46:28,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:46:28,784 INFO L82 PathProgramCache]: Analyzing trace with hash -1817211414, now seen corresponding path program 50 times [2019-02-15 10:46:28,784 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:46:28,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:28,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:46:28,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:28,785 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:46:28,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:46:29,850 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2019-02-15 10:46:29,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:29,850 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:46:29,850 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:46:29,850 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:46:29,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:29,851 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:46:29,861 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:46:29,861 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:46:31,034 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2019-02-15 10:46:31,034 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:46:31,042 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:46:31,062 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2019-02-15 10:46:31,063 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:46:34,322 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2019-02-15 10:46:34,343 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:46:34,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 103 [2019-02-15 10:46:34,343 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:46:34,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-02-15 10:46:34,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-02-15 10:46:34,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-02-15 10:46:34,345 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand 53 states. [2019-02-15 10:46:35,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:46:35,140 INFO L93 Difference]: Finished difference Result 160 states and 163 transitions. [2019-02-15 10:46:35,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-02-15 10:46:35,140 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 104 [2019-02-15 10:46:35,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:46:35,141 INFO L225 Difference]: With dead ends: 160 [2019-02-15 10:46:35,141 INFO L226 Difference]: Without dead ends: 107 [2019-02-15 10:46:35,142 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-02-15 10:46:35,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-02-15 10:46:35,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-02-15 10:46:35,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-02-15 10:46:35,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2019-02-15 10:46:35,146 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 104 [2019-02-15 10:46:35,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:46:35,146 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2019-02-15 10:46:35,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-02-15 10:46:35,146 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2019-02-15 10:46:35,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-02-15 10:46:35,147 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:46:35,147 INFO L402 BasicCegarLoop]: trace histogram [51, 51, 1, 1, 1, 1] [2019-02-15 10:46:35,147 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:46:35,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:46:35,148 INFO L82 PathProgramCache]: Analyzing trace with hash -843721451, now seen corresponding path program 51 times [2019-02-15 10:46:35,148 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:46:35,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:35,148 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:46:35,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:35,149 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:46:35,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:46:36,301 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2019-02-15 10:46:36,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:36,302 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:46:36,302 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:46:36,302 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:46:36,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:36,302 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:46:36,311 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:46:36,311 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:46:36,385 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:46:36,385 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:46:36,388 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:46:36,402 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2019-02-15 10:46:36,402 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:46:39,401 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2019-02-15 10:46:39,420 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:46:39,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 105 [2019-02-15 10:46:39,421 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:46:39,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-02-15 10:46:39,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-02-15 10:46:39,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-02-15 10:46:39,422 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand 54 states. [2019-02-15 10:46:39,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:46:39,659 INFO L93 Difference]: Finished difference Result 163 states and 166 transitions. [2019-02-15 10:46:39,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-02-15 10:46:39,659 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 106 [2019-02-15 10:46:39,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:46:39,660 INFO L225 Difference]: With dead ends: 163 [2019-02-15 10:46:39,660 INFO L226 Difference]: Without dead ends: 109 [2019-02-15 10:46:39,661 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-02-15 10:46:39,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-02-15 10:46:39,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-02-15 10:46:39,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-02-15 10:46:39,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2019-02-15 10:46:39,664 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 106 [2019-02-15 10:46:39,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:46:39,664 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2019-02-15 10:46:39,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-02-15 10:46:39,665 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2019-02-15 10:46:39,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-02-15 10:46:39,665 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:46:39,665 INFO L402 BasicCegarLoop]: trace histogram [52, 52, 1, 1, 1, 1] [2019-02-15 10:46:39,666 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:46:39,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:46:39,666 INFO L82 PathProgramCache]: Analyzing trace with hash -972329718, now seen corresponding path program 52 times [2019-02-15 10:46:39,666 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:46:39,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:39,667 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:46:39,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:39,667 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:46:39,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:46:41,698 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2019-02-15 10:46:41,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:41,698 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:46:41,698 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:46:41,698 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:46:41,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:41,699 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:46:41,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:46:41,707 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:46:41,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:46:41,785 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:46:41,799 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2019-02-15 10:46:41,800 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:46:44,985 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2019-02-15 10:46:45,004 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:46:45,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 107 [2019-02-15 10:46:45,005 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:46:45,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-02-15 10:46:45,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-02-15 10:46:45,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-02-15 10:46:45,006 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand 55 states. [2019-02-15 10:46:45,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:46:45,224 INFO L93 Difference]: Finished difference Result 166 states and 169 transitions. [2019-02-15 10:46:45,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-02-15 10:46:45,225 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 108 [2019-02-15 10:46:45,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:46:45,226 INFO L225 Difference]: With dead ends: 166 [2019-02-15 10:46:45,226 INFO L226 Difference]: Without dead ends: 111 [2019-02-15 10:46:45,226 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-02-15 10:46:45,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-02-15 10:46:45,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-02-15 10:46:45,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-02-15 10:46:45,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2019-02-15 10:46:45,229 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 108 [2019-02-15 10:46:45,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:46:45,229 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2019-02-15 10:46:45,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-02-15 10:46:45,229 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2019-02-15 10:46:45,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-02-15 10:46:45,230 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:46:45,230 INFO L402 BasicCegarLoop]: trace histogram [53, 53, 1, 1, 1, 1] [2019-02-15 10:46:45,230 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:46:45,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:46:45,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1323016843, now seen corresponding path program 53 times [2019-02-15 10:46:45,230 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:46:45,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:45,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:46:45,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:45,231 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:46:45,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:46:46,519 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2019-02-15 10:46:46,519 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:46,519 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:46:46,520 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:46:46,520 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:46:46,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:46,520 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:46:46,529 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:46:46,529 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:46:47,674 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2019-02-15 10:46:47,674 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:46:47,683 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:46:47,699 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2019-02-15 10:46:47,700 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:46:51,033 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2019-02-15 10:46:51,053 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:46:51,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 109 [2019-02-15 10:46:51,054 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:46:51,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-02-15 10:46:51,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-02-15 10:46:51,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-02-15 10:46:51,055 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand 56 states. [2019-02-15 10:46:51,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:46:51,305 INFO L93 Difference]: Finished difference Result 169 states and 172 transitions. [2019-02-15 10:46:51,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-02-15 10:46:51,306 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 110 [2019-02-15 10:46:51,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:46:51,306 INFO L225 Difference]: With dead ends: 169 [2019-02-15 10:46:51,307 INFO L226 Difference]: Without dead ends: 113 [2019-02-15 10:46:51,307 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-02-15 10:46:51,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-02-15 10:46:51,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-02-15 10:46:51,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-02-15 10:46:51,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 114 transitions. [2019-02-15 10:46:51,310 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 114 transitions. Word has length 110 [2019-02-15 10:46:51,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:46:51,310 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 114 transitions. [2019-02-15 10:46:51,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-02-15 10:46:51,310 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 114 transitions. [2019-02-15 10:46:51,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-02-15 10:46:51,311 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:46:51,311 INFO L402 BasicCegarLoop]: trace histogram [54, 54, 1, 1, 1, 1] [2019-02-15 10:46:51,311 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:46:51,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:46:51,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1054239702, now seen corresponding path program 54 times [2019-02-15 10:46:51,312 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:46:51,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:51,312 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:46:51,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:51,312 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:46:51,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:46:52,510 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2019-02-15 10:46:52,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:52,510 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:46:52,511 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:46:52,511 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:46:52,511 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:52,511 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:46:52,523 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:46:52,523 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:46:52,601 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:46:52,601 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:46:52,604 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:46:52,617 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2019-02-15 10:46:52,617 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:46:55,912 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2019-02-15 10:46:55,930 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:46:55,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 111 [2019-02-15 10:46:55,931 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:46:55,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-02-15 10:46:55,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-02-15 10:46:55,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-02-15 10:46:55,932 INFO L87 Difference]: Start difference. First operand 113 states and 114 transitions. Second operand 57 states. [2019-02-15 10:46:56,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:46:56,155 INFO L93 Difference]: Finished difference Result 172 states and 175 transitions. [2019-02-15 10:46:56,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-02-15 10:46:56,155 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 112 [2019-02-15 10:46:56,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:46:56,156 INFO L225 Difference]: With dead ends: 172 [2019-02-15 10:46:56,156 INFO L226 Difference]: Without dead ends: 115 [2019-02-15 10:46:56,157 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-02-15 10:46:56,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-02-15 10:46:56,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2019-02-15 10:46:56,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-02-15 10:46:56,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 116 transitions. [2019-02-15 10:46:56,160 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 116 transitions. Word has length 112 [2019-02-15 10:46:56,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:46:56,161 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 116 transitions. [2019-02-15 10:46:56,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-02-15 10:46:56,161 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 116 transitions. [2019-02-15 10:46:56,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-02-15 10:46:56,162 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:46:56,162 INFO L402 BasicCegarLoop]: trace histogram [55, 55, 1, 1, 1, 1] [2019-02-15 10:46:56,162 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:46:56,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:46:56,162 INFO L82 PathProgramCache]: Analyzing trace with hash 1244388821, now seen corresponding path program 55 times [2019-02-15 10:46:56,162 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:46:56,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:56,163 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:46:56,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:56,163 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:46:56,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:46:57,429 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2019-02-15 10:46:57,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:57,429 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:46:57,429 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:46:57,429 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:46:57,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:57,430 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:46:57,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:46:57,438 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:46:57,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:46:57,525 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:46:57,543 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2019-02-15 10:46:57,544 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:47:01,322 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2019-02-15 10:47:01,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:47:01,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 113 [2019-02-15 10:47:01,341 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:47:01,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-02-15 10:47:01,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-02-15 10:47:01,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-02-15 10:47:01,343 INFO L87 Difference]: Start difference. First operand 115 states and 116 transitions. Second operand 58 states. [2019-02-15 10:47:01,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:47:01,686 INFO L93 Difference]: Finished difference Result 175 states and 178 transitions. [2019-02-15 10:47:01,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-02-15 10:47:01,687 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 114 [2019-02-15 10:47:01,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:47:01,687 INFO L225 Difference]: With dead ends: 175 [2019-02-15 10:47:01,688 INFO L226 Difference]: Without dead ends: 117 [2019-02-15 10:47:01,688 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-02-15 10:47:01,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-02-15 10:47:01,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2019-02-15 10:47:01,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-02-15 10:47:01,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 118 transitions. [2019-02-15 10:47:01,693 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 118 transitions. Word has length 114 [2019-02-15 10:47:01,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:47:01,693 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 118 transitions. [2019-02-15 10:47:01,693 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-02-15 10:47:01,693 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 118 transitions. [2019-02-15 10:47:01,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-02-15 10:47:01,694 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:47:01,694 INFO L402 BasicCegarLoop]: trace histogram [56, 56, 1, 1, 1, 1] [2019-02-15 10:47:01,694 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:47:01,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:47:01,695 INFO L82 PathProgramCache]: Analyzing trace with hash -464518326, now seen corresponding path program 56 times [2019-02-15 10:47:01,695 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:47:01,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:47:01,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:47:01,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:47:01,696 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:47:01,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:47:03,227 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2019-02-15 10:47:03,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:47:03,228 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:47:03,228 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:47:03,228 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:47:03,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:47:03,228 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:47:03,238 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:47:03,238 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:47:04,057 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2019-02-15 10:47:04,057 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:47:04,063 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:47:04,083 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2019-02-15 10:47:04,083 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:47:07,882 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2019-02-15 10:47:07,903 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:47:07,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 115 [2019-02-15 10:47:07,904 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:47:07,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-02-15 10:47:07,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-02-15 10:47:07,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-02-15 10:47:07,905 INFO L87 Difference]: Start difference. First operand 117 states and 118 transitions. Second operand 59 states. [2019-02-15 10:47:08,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:47:08,217 INFO L93 Difference]: Finished difference Result 178 states and 181 transitions. [2019-02-15 10:47:08,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-02-15 10:47:08,217 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 116 [2019-02-15 10:47:08,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:47:08,218 INFO L225 Difference]: With dead ends: 178 [2019-02-15 10:47:08,218 INFO L226 Difference]: Without dead ends: 119 [2019-02-15 10:47:08,219 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-02-15 10:47:08,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-02-15 10:47:08,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2019-02-15 10:47:08,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-02-15 10:47:08,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 120 transitions. [2019-02-15 10:47:08,223 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 120 transitions. Word has length 116 [2019-02-15 10:47:08,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:47:08,223 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 120 transitions. [2019-02-15 10:47:08,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-02-15 10:47:08,223 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2019-02-15 10:47:08,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-02-15 10:47:08,224 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:47:08,224 INFO L402 BasicCegarLoop]: trace histogram [57, 57, 1, 1, 1, 1] [2019-02-15 10:47:08,224 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:47:08,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:47:08,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1327912501, now seen corresponding path program 57 times [2019-02-15 10:47:08,225 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:47:08,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:47:08,225 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:47:08,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:47:08,226 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:47:08,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:47:09,814 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2019-02-15 10:47:09,814 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:47:09,814 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:47:09,814 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:47:09,814 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:47:09,814 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:47:09,814 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:47:09,822 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:47:09,822 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:47:09,901 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:47:09,901 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:47:09,904 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:47:09,923 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2019-02-15 10:47:09,924 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:47:13,503 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2019-02-15 10:47:13,521 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:47:13,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 117 [2019-02-15 10:47:13,521 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:47:13,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-02-15 10:47:13,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-02-15 10:47:13,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-02-15 10:47:13,523 INFO L87 Difference]: Start difference. First operand 119 states and 120 transitions. Second operand 60 states. [2019-02-15 10:47:13,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:47:13,808 INFO L93 Difference]: Finished difference Result 181 states and 184 transitions. [2019-02-15 10:47:13,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-02-15 10:47:13,808 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 118 [2019-02-15 10:47:13,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:47:13,809 INFO L225 Difference]: With dead ends: 181 [2019-02-15 10:47:13,809 INFO L226 Difference]: Without dead ends: 121 [2019-02-15 10:47:13,810 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-02-15 10:47:13,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-02-15 10:47:13,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2019-02-15 10:47:13,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-02-15 10:47:13,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 122 transitions. [2019-02-15 10:47:13,813 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 122 transitions. Word has length 118 [2019-02-15 10:47:13,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:47:13,813 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 122 transitions. [2019-02-15 10:47:13,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-02-15 10:47:13,813 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 122 transitions. [2019-02-15 10:47:13,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-02-15 10:47:13,814 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:47:13,814 INFO L402 BasicCegarLoop]: trace histogram [58, 58, 1, 1, 1, 1] [2019-02-15 10:47:13,814 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:47:13,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:47:13,815 INFO L82 PathProgramCache]: Analyzing trace with hash -1186678166, now seen corresponding path program 58 times [2019-02-15 10:47:13,815 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:47:13,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:47:13,815 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:47:13,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:47:13,816 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:47:13,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:47:15,713 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 1711 trivial. 0 not checked. [2019-02-15 10:47:15,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:47:15,714 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:47:15,714 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:47:15,714 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:47:15,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:47:15,714 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:47:15,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:47:15,726 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:47:15,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:47:15,810 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:47:15,828 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 1711 trivial. 0 not checked. [2019-02-15 10:47:15,828 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:47:19,404 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 1711 trivial. 0 not checked. [2019-02-15 10:47:19,424 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:47:19,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 119 [2019-02-15 10:47:19,424 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:47:19,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-02-15 10:47:19,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-02-15 10:47:19,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-02-15 10:47:19,425 INFO L87 Difference]: Start difference. First operand 121 states and 122 transitions. Second operand 61 states. [2019-02-15 10:47:19,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:47:19,781 INFO L93 Difference]: Finished difference Result 184 states and 187 transitions. [2019-02-15 10:47:19,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-02-15 10:47:19,781 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 120 [2019-02-15 10:47:19,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:47:19,782 INFO L225 Difference]: With dead ends: 184 [2019-02-15 10:47:19,782 INFO L226 Difference]: Without dead ends: 123 [2019-02-15 10:47:19,782 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-02-15 10:47:19,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-02-15 10:47:19,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2019-02-15 10:47:19,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-02-15 10:47:19,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 124 transitions. [2019-02-15 10:47:19,786 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 124 transitions. Word has length 120 [2019-02-15 10:47:19,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:47:19,786 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 124 transitions. [2019-02-15 10:47:19,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-02-15 10:47:19,786 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 124 transitions. [2019-02-15 10:47:19,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-02-15 10:47:19,787 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:47:19,787 INFO L402 BasicCegarLoop]: trace histogram [59, 59, 1, 1, 1, 1] [2019-02-15 10:47:19,787 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:47:19,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:47:19,788 INFO L82 PathProgramCache]: Analyzing trace with hash 737003157, now seen corresponding path program 59 times [2019-02-15 10:47:19,788 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:47:19,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:47:19,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:47:19,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:47:19,789 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:47:19,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:47:21,352 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2019-02-15 10:47:21,352 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:47:21,352 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:47:21,352 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:47:21,352 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:47:21,352 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:47:21,352 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:47:21,361 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:47:21,361 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:47:22,383 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2019-02-15 10:47:22,383 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:47:22,389 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:47:22,403 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2019-02-15 10:47:22,404 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:47:26,346 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2019-02-15 10:47:26,367 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:47:26,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 121 [2019-02-15 10:47:26,368 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:47:26,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-02-15 10:47:26,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-02-15 10:47:26,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2019-02-15 10:47:26,369 INFO L87 Difference]: Start difference. First operand 123 states and 124 transitions. Second operand 62 states. [2019-02-15 10:47:26,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:47:26,999 INFO L93 Difference]: Finished difference Result 187 states and 190 transitions. [2019-02-15 10:47:26,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-02-15 10:47:27,000 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 122 [2019-02-15 10:47:27,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:47:27,000 INFO L225 Difference]: With dead ends: 187 [2019-02-15 10:47:27,000 INFO L226 Difference]: Without dead ends: 125 [2019-02-15 10:47:27,001 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2019-02-15 10:47:27,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-02-15 10:47:27,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2019-02-15 10:47:27,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-02-15 10:47:27,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 126 transitions. [2019-02-15 10:47:27,004 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 126 transitions. Word has length 122 [2019-02-15 10:47:27,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:47:27,004 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 126 transitions. [2019-02-15 10:47:27,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-02-15 10:47:27,005 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 126 transitions. [2019-02-15 10:47:27,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-02-15 10:47:27,005 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:47:27,005 INFO L402 BasicCegarLoop]: trace histogram [60, 60, 1, 1, 1, 1] [2019-02-15 10:47:27,006 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:47:27,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:47:27,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1414379914, now seen corresponding path program 60 times [2019-02-15 10:47:27,006 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:47:27,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:47:27,007 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:47:27,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:47:27,007 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:47:27,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:47:28,398 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 1830 trivial. 0 not checked. [2019-02-15 10:47:28,399 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:47:28,399 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:47:28,399 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:47:28,399 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:47:28,399 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:47:28,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 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:47:28,408 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:47:28,408 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:47:28,493 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:47:28,493 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:47:28,496 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:47:28,514 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 1830 trivial. 0 not checked. [2019-02-15 10:47:28,514 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:47:32,570 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 1830 trivial. 0 not checked. [2019-02-15 10:47:32,589 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:47:32,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 123 [2019-02-15 10:47:32,589 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:47:32,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-02-15 10:47:32,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-02-15 10:47:32,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2019-02-15 10:47:32,590 INFO L87 Difference]: Start difference. First operand 125 states and 126 transitions. Second operand 63 states. [2019-02-15 10:47:32,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:47:32,852 INFO L93 Difference]: Finished difference Result 190 states and 193 transitions. [2019-02-15 10:47:32,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-02-15 10:47:32,853 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 124 [2019-02-15 10:47:32,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:47:32,853 INFO L225 Difference]: With dead ends: 190 [2019-02-15 10:47:32,854 INFO L226 Difference]: Without dead ends: 127 [2019-02-15 10:47:32,854 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2019-02-15 10:47:32,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-02-15 10:47:32,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2019-02-15 10:47:32,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-02-15 10:47:32,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2019-02-15 10:47:32,857 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 124 [2019-02-15 10:47:32,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:47:32,858 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2019-02-15 10:47:32,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-02-15 10:47:32,858 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2019-02-15 10:47:32,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-02-15 10:47:32,858 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:47:32,858 INFO L402 BasicCegarLoop]: trace histogram [61, 61, 1, 1, 1, 1] [2019-02-15 10:47:32,858 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:47:32,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:47:32,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1579405579, now seen corresponding path program 61 times [2019-02-15 10:47:32,859 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:47:32,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:47:32,859 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:47:32,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:47:32,860 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:47:32,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:47:34,266 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2019-02-15 10:47:34,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:47:34,266 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:47:34,266 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:47:34,266 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:47:34,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:47:34,267 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:47:34,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:47:34,275 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:47:34,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:47:34,360 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:47:34,375 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2019-02-15 10:47:34,375 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:47:38,612 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2019-02-15 10:47:38,630 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:47:38,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 125 [2019-02-15 10:47:38,631 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:47:38,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-02-15 10:47:38,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-02-15 10:47:38,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2019-02-15 10:47:38,632 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand 64 states. [2019-02-15 10:47:38,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:47:38,976 INFO L93 Difference]: Finished difference Result 193 states and 196 transitions. [2019-02-15 10:47:38,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-02-15 10:47:38,976 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 126 [2019-02-15 10:47:38,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:47:38,977 INFO L225 Difference]: With dead ends: 193 [2019-02-15 10:47:38,977 INFO L226 Difference]: Without dead ends: 129 [2019-02-15 10:47:38,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2019-02-15 10:47:38,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-02-15 10:47:38,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2019-02-15 10:47:38,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-02-15 10:47:38,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 130 transitions. [2019-02-15 10:47:38,980 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 130 transitions. Word has length 126 [2019-02-15 10:47:38,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:47:38,980 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 130 transitions. [2019-02-15 10:47:38,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-02-15 10:47:38,980 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 130 transitions. [2019-02-15 10:47:38,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-02-15 10:47:38,981 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:47:38,981 INFO L402 BasicCegarLoop]: trace histogram [62, 62, 1, 1, 1, 1] [2019-02-15 10:47:38,981 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:47:38,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:47:38,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1271856982, now seen corresponding path program 62 times [2019-02-15 10:47:38,982 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:47:38,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:47:38,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:47:38,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:47:38,982 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:47:39,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:47:40,698 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2019-02-15 10:47:40,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:47:40,698 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:47:40,698 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:47:40,698 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:47:40,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:47:40,699 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:47:40,707 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:47:40,708 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:47:41,700 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2019-02-15 10:47:41,700 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:47:41,706 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:47:41,720 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2019-02-15 10:47:41,720 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:47:46,017 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2019-02-15 10:47:46,039 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:47:46,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 127 [2019-02-15 10:47:46,039 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:47:46,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-02-15 10:47:46,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-02-15 10:47:46,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2019-02-15 10:47:46,041 INFO L87 Difference]: Start difference. First operand 129 states and 130 transitions. Second operand 65 states. [2019-02-15 10:47:46,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:47:46,398 INFO L93 Difference]: Finished difference Result 196 states and 199 transitions. [2019-02-15 10:47:46,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-02-15 10:47:46,399 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 128 [2019-02-15 10:47:46,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:47:46,399 INFO L225 Difference]: With dead ends: 196 [2019-02-15 10:47:46,400 INFO L226 Difference]: Without dead ends: 131 [2019-02-15 10:47:46,400 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2019-02-15 10:47:46,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-02-15 10:47:46,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2019-02-15 10:47:46,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-02-15 10:47:46,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 132 transitions. [2019-02-15 10:47:46,404 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 132 transitions. Word has length 128 [2019-02-15 10:47:46,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:47:46,404 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 132 transitions. [2019-02-15 10:47:46,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-02-15 10:47:46,404 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 132 transitions. [2019-02-15 10:47:46,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-02-15 10:47:46,405 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:47:46,405 INFO L402 BasicCegarLoop]: trace histogram [63, 63, 1, 1, 1, 1] [2019-02-15 10:47:46,405 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:47:46,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:47:46,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1741393749, now seen corresponding path program 63 times [2019-02-15 10:47:46,406 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:47:46,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:47:46,407 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:47:46,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:47:46,407 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:47:46,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:47:47,984 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2019-02-15 10:47:47,984 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:47:47,984 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:47:47,984 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:47:47,984 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:47:47,984 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:47:47,985 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:47:48,001 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:47:48,001 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:47:48,087 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:47:48,087 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:47:48,090 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:47:48,106 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2019-02-15 10:47:48,106 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:47:52,598 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2019-02-15 10:47:52,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:47:52,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 129 [2019-02-15 10:47:52,616 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:47:52,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-02-15 10:47:52,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-02-15 10:47:52,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2019-02-15 10:47:52,618 INFO L87 Difference]: Start difference. First operand 131 states and 132 transitions. Second operand 66 states. [2019-02-15 10:47:52,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:47:52,996 INFO L93 Difference]: Finished difference Result 199 states and 202 transitions. [2019-02-15 10:47:52,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-02-15 10:47:52,996 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 130 [2019-02-15 10:47:52,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:47:52,997 INFO L225 Difference]: With dead ends: 199 [2019-02-15 10:47:52,997 INFO L226 Difference]: Without dead ends: 133 [2019-02-15 10:47:52,997 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2019-02-15 10:47:52,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-02-15 10:47:53,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2019-02-15 10:47:53,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-02-15 10:47:53,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 134 transitions. [2019-02-15 10:47:53,001 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 134 transitions. Word has length 130 [2019-02-15 10:47:53,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:47:53,001 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 134 transitions. [2019-02-15 10:47:53,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-02-15 10:47:53,001 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 134 transitions. [2019-02-15 10:47:53,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-02-15 10:47:53,002 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:47:53,002 INFO L402 BasicCegarLoop]: trace histogram [64, 64, 1, 1, 1, 1] [2019-02-15 10:47:53,002 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:47:53,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:47:53,003 INFO L82 PathProgramCache]: Analyzing trace with hash 573870026, now seen corresponding path program 64 times [2019-02-15 10:47:53,003 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:47:53,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:47:53,005 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:47:53,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:47:53,005 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:47:53,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:47:54,576 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 2080 trivial. 0 not checked. [2019-02-15 10:47:54,576 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:47:54,576 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:47:54,576 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:47:54,576 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:47:54,577 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:47:54,577 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:47:54,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:47:54,585 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:47:54,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:47:54,677 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:47:54,696 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 2080 trivial. 0 not checked. [2019-02-15 10:47:54,696 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:47:59,574 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 2080 trivial. 0 not checked. [2019-02-15 10:47:59,593 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:47:59,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 131 [2019-02-15 10:47:59,593 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:47:59,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-02-15 10:47:59,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-02-15 10:47:59,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2019-02-15 10:47:59,594 INFO L87 Difference]: Start difference. First operand 133 states and 134 transitions. Second operand 67 states. [2019-02-15 10:48:00,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:48:00,016 INFO L93 Difference]: Finished difference Result 202 states and 205 transitions. [2019-02-15 10:48:00,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-02-15 10:48:00,017 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 132 [2019-02-15 10:48:00,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:48:00,018 INFO L225 Difference]: With dead ends: 202 [2019-02-15 10:48:00,018 INFO L226 Difference]: Without dead ends: 135 [2019-02-15 10:48:00,019 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2019-02-15 10:48:00,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-02-15 10:48:00,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2019-02-15 10:48:00,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-02-15 10:48:00,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 136 transitions. [2019-02-15 10:48:00,023 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 136 transitions. Word has length 132 [2019-02-15 10:48:00,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:48:00,023 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 136 transitions. [2019-02-15 10:48:00,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-02-15 10:48:00,023 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 136 transitions. [2019-02-15 10:48:00,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-02-15 10:48:00,024 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:48:00,024 INFO L402 BasicCegarLoop]: trace histogram [65, 65, 1, 1, 1, 1] [2019-02-15 10:48:00,024 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:48:00,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:48:00,025 INFO L82 PathProgramCache]: Analyzing trace with hash -904534091, now seen corresponding path program 65 times [2019-02-15 10:48:00,025 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:48:00,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:48:00,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:48:00,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:48:00,026 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:48:00,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:48:01,887 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2019-02-15 10:48:01,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:48:01,887 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:48:01,888 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:48:01,888 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:48:01,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:48:01,888 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:48:01,896 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:48:01,897 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:48:04,892 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2019-02-15 10:48:04,892 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:48:04,906 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:48:04,941 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2019-02-15 10:48:04,941 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:48:09,651 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2019-02-15 10:48:09,674 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:48:09,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 133 [2019-02-15 10:48:09,674 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:48:09,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-02-15 10:48:09,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-02-15 10:48:09,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2019-02-15 10:48:09,676 INFO L87 Difference]: Start difference. First operand 135 states and 136 transitions. Second operand 68 states. [2019-02-15 10:48:10,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:48:10,038 INFO L93 Difference]: Finished difference Result 205 states and 208 transitions. [2019-02-15 10:48:10,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-02-15 10:48:10,038 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 134 [2019-02-15 10:48:10,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:48:10,039 INFO L225 Difference]: With dead ends: 205 [2019-02-15 10:48:10,039 INFO L226 Difference]: Without dead ends: 137 [2019-02-15 10:48:10,040 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2019-02-15 10:48:10,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-02-15 10:48:10,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2019-02-15 10:48:10,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-02-15 10:48:10,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 138 transitions. [2019-02-15 10:48:10,043 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 138 transitions. Word has length 134 [2019-02-15 10:48:10,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:48:10,043 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 138 transitions. [2019-02-15 10:48:10,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-02-15 10:48:10,043 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 138 transitions. [2019-02-15 10:48:10,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-02-15 10:48:10,044 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:48:10,044 INFO L402 BasicCegarLoop]: trace histogram [66, 66, 1, 1, 1, 1] [2019-02-15 10:48:10,044 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:48:10,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:48:10,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1843501334, now seen corresponding path program 66 times [2019-02-15 10:48:10,044 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:48:10,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:48:10,045 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:48:10,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:48:10,045 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:48:10,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:48:12,512 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 2211 trivial. 0 not checked. [2019-02-15 10:48:12,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:48:12,513 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:48:12,513 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:48:12,513 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:48:12,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:48:12,513 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:48:12,523 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:48:12,524 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:48:12,616 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:48:12,617 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:48:12,620 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:48:12,645 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 2211 trivial. 0 not checked. [2019-02-15 10:48:12,645 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:48:17,723 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 2211 trivial. 0 not checked. [2019-02-15 10:48:17,741 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:48:17,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 135 [2019-02-15 10:48:17,742 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:48:17,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-02-15 10:48:17,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-02-15 10:48:17,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2019-02-15 10:48:17,743 INFO L87 Difference]: Start difference. First operand 137 states and 138 transitions. Second operand 69 states. [2019-02-15 10:48:18,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:48:18,185 INFO L93 Difference]: Finished difference Result 208 states and 211 transitions. [2019-02-15 10:48:18,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-02-15 10:48:18,186 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 136 [2019-02-15 10:48:18,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:48:18,186 INFO L225 Difference]: With dead ends: 208 [2019-02-15 10:48:18,186 INFO L226 Difference]: Without dead ends: 139 [2019-02-15 10:48:18,187 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2019-02-15 10:48:18,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-02-15 10:48:18,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2019-02-15 10:48:18,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-02-15 10:48:18,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 140 transitions. [2019-02-15 10:48:18,190 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 140 transitions. Word has length 136 [2019-02-15 10:48:18,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:48:18,190 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 140 transitions. [2019-02-15 10:48:18,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-02-15 10:48:18,191 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 140 transitions. [2019-02-15 10:48:18,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-02-15 10:48:18,191 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:48:18,191 INFO L402 BasicCegarLoop]: trace histogram [67, 67, 1, 1, 1, 1] [2019-02-15 10:48:18,191 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:48:18,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:48:18,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1251293205, now seen corresponding path program 67 times [2019-02-15 10:48:18,192 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:48:18,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:48:18,192 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:48:18,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:48:18,192 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:48:18,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:48:19,908 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2019-02-15 10:48:19,909 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:48:19,909 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:48:19,909 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:48:19,909 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:48:19,909 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:48:19,909 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:48:19,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:48:19,918 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:48:20,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:48:20,016 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:48:20,033 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2019-02-15 10:48:20,034 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:48:25,084 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2019-02-15 10:48:25,102 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:48:25,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 137 [2019-02-15 10:48:25,102 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:48:25,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-02-15 10:48:25,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-02-15 10:48:25,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2019-02-15 10:48:25,104 INFO L87 Difference]: Start difference. First operand 139 states and 140 transitions. Second operand 70 states. [2019-02-15 10:48:25,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:48:25,546 INFO L93 Difference]: Finished difference Result 211 states and 214 transitions. [2019-02-15 10:48:25,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-02-15 10:48:25,546 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 138 [2019-02-15 10:48:25,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:48:25,547 INFO L225 Difference]: With dead ends: 211 [2019-02-15 10:48:25,547 INFO L226 Difference]: Without dead ends: 141 [2019-02-15 10:48:25,548 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2019-02-15 10:48:25,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-02-15 10:48:25,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2019-02-15 10:48:25,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-02-15 10:48:25,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 142 transitions. [2019-02-15 10:48:25,551 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 142 transitions. Word has length 138 [2019-02-15 10:48:25,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:48:25,551 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 142 transitions. [2019-02-15 10:48:25,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-02-15 10:48:25,551 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 142 transitions. [2019-02-15 10:48:25,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-02-15 10:48:25,552 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:48:25,552 INFO L402 BasicCegarLoop]: trace histogram [68, 68, 1, 1, 1, 1] [2019-02-15 10:48:25,553 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:48:25,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:48:25,553 INFO L82 PathProgramCache]: Analyzing trace with hash 36996618, now seen corresponding path program 68 times [2019-02-15 10:48:25,553 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:48:25,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:48:25,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:48:25,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:48:25,554 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:48:25,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:48:27,686 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2019-02-15 10:48:27,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:48:27,687 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:48:27,687 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:48:27,687 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:48:27,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:48:27,687 INFO 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-02-15 10:48:27,695 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:48:27,696 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:48:30,943 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2019-02-15 10:48:30,944 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:48:30,960 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:48:30,975 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2019-02-15 10:48:30,976 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:48:36,199 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2019-02-15 10:48:36,222 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:48:36,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 139 [2019-02-15 10:48:36,223 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:48:36,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-02-15 10:48:36,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-02-15 10:48:36,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2019-02-15 10:48:36,225 INFO L87 Difference]: Start difference. First operand 141 states and 142 transitions. Second operand 71 states. [2019-02-15 10:48:36,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:48:36,728 INFO L93 Difference]: Finished difference Result 214 states and 217 transitions. [2019-02-15 10:48:36,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-02-15 10:48:36,729 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 140 [2019-02-15 10:48:36,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:48:36,729 INFO L225 Difference]: With dead ends: 214 [2019-02-15 10:48:36,729 INFO L226 Difference]: Without dead ends: 143 [2019-02-15 10:48:36,730 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2019-02-15 10:48:36,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-02-15 10:48:36,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2019-02-15 10:48:36,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-02-15 10:48:36,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 144 transitions. [2019-02-15 10:48:36,733 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 144 transitions. Word has length 140 [2019-02-15 10:48:36,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:48:36,733 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 144 transitions. [2019-02-15 10:48:36,733 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-02-15 10:48:36,733 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 144 transitions. [2019-02-15 10:48:36,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-02-15 10:48:36,734 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:48:36,734 INFO L402 BasicCegarLoop]: trace histogram [69, 69, 1, 1, 1, 1] [2019-02-15 10:48:36,734 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:48:36,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:48:36,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1084457077, now seen corresponding path program 69 times [2019-02-15 10:48:36,734 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:48:36,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:48:36,735 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:48:36,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:48:36,735 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:48:36,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:48:38,619 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2019-02-15 10:48:38,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:48:38,620 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:48:38,620 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:48:38,620 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:48:38,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:48:38,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 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-02-15 10:48:38,630 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:48:38,631 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:48:38,725 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:48:38,725 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:48:38,728 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:48:38,745 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2019-02-15 10:48:38,745 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:48:44,009 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2019-02-15 10:48:44,028 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:48:44,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 141 [2019-02-15 10:48:44,029 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:48:44,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-02-15 10:48:44,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-02-15 10:48:44,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2019-02-15 10:48:44,030 INFO L87 Difference]: Start difference. First operand 143 states and 144 transitions. Second operand 72 states. [2019-02-15 10:48:44,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:48:44,488 INFO L93 Difference]: Finished difference Result 217 states and 220 transitions. [2019-02-15 10:48:44,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-02-15 10:48:44,489 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 142 [2019-02-15 10:48:44,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:48:44,490 INFO L225 Difference]: With dead ends: 217 [2019-02-15 10:48:44,490 INFO L226 Difference]: Without dead ends: 145 [2019-02-15 10:48:44,491 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2019-02-15 10:48:44,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-02-15 10:48:44,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2019-02-15 10:48:44,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-02-15 10:48:44,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 146 transitions. [2019-02-15 10:48:44,494 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 146 transitions. Word has length 142 [2019-02-15 10:48:44,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:48:44,494 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 146 transitions. [2019-02-15 10:48:44,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-02-15 10:48:44,494 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 146 transitions. [2019-02-15 10:48:44,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-02-15 10:48:44,495 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:48:44,495 INFO L402 BasicCegarLoop]: trace histogram [70, 70, 1, 1, 1, 1] [2019-02-15 10:48:44,496 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:48:44,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:48:44,496 INFO L82 PathProgramCache]: Analyzing trace with hash -616764118, now seen corresponding path program 70 times [2019-02-15 10:48:44,496 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:48:44,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:48:44,497 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:48:44,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:48:44,497 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:48:44,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:48:46,387 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 2485 trivial. 0 not checked. [2019-02-15 10:48:46,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:48:46,387 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:48:46,387 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:48:46,388 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:48:46,388 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:48:46,388 INFO 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-02-15 10:48:46,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:48:46,396 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:48:46,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:48:46,495 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:48:46,513 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 2485 trivial. 0 not checked. [2019-02-15 10:48:46,513 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:48:52,079 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 2485 trivial. 0 not checked. [2019-02-15 10:48:52,097 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:48:52,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 143 [2019-02-15 10:48:52,098 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:48:52,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-02-15 10:48:52,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-02-15 10:48:52,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2019-02-15 10:48:52,099 INFO L87 Difference]: Start difference. First operand 145 states and 146 transitions. Second operand 73 states. [2019-02-15 10:48:52,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:48:52,575 INFO L93 Difference]: Finished difference Result 220 states and 223 transitions. [2019-02-15 10:48:52,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-02-15 10:48:52,576 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 144 [2019-02-15 10:48:52,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:48:52,576 INFO L225 Difference]: With dead ends: 220 [2019-02-15 10:48:52,576 INFO L226 Difference]: Without dead ends: 147 [2019-02-15 10:48:52,577 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2019-02-15 10:48:52,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-02-15 10:48:52,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2019-02-15 10:48:52,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-02-15 10:48:52,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 148 transitions. [2019-02-15 10:48:52,582 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 148 transitions. Word has length 144 [2019-02-15 10:48:52,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:48:52,582 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 148 transitions. [2019-02-15 10:48:52,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-02-15 10:48:52,582 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 148 transitions. [2019-02-15 10:48:52,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-02-15 10:48:52,583 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:48:52,583 INFO L402 BasicCegarLoop]: trace histogram [71, 71, 1, 1, 1, 1] [2019-02-15 10:48:52,583 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:48:52,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:48:52,583 INFO L82 PathProgramCache]: Analyzing trace with hash 2031796437, now seen corresponding path program 71 times [2019-02-15 10:48:52,583 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:48:52,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:48:52,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:48:52,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:48:52,584 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:48:52,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:48:54,488 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2019-02-15 10:48:54,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:48:54,488 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:48:54,488 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:48:54,488 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:48:54,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:48:54,488 INFO 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-02-15 10:48:54,496 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:48:54,496 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:48:57,179 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 37 check-sat command(s) [2019-02-15 10:48:57,179 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:48:57,193 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:48:57,211 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2019-02-15 10:48:57,212 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:49:02,901 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2019-02-15 10:49:02,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:49:02,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 145 [2019-02-15 10:49:02,924 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:49:02,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-02-15 10:49:02,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-02-15 10:49:02,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2019-02-15 10:49:02,926 INFO L87 Difference]: Start difference. First operand 147 states and 148 transitions. Second operand 74 states. [2019-02-15 10:49:03,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:49:03,444 INFO L93 Difference]: Finished difference Result 223 states and 226 transitions. [2019-02-15 10:49:03,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-02-15 10:49:03,444 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 146 [2019-02-15 10:49:03,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:49:03,445 INFO L225 Difference]: With dead ends: 223 [2019-02-15 10:49:03,445 INFO L226 Difference]: Without dead ends: 149 [2019-02-15 10:49:03,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2019-02-15 10:49:03,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-02-15 10:49:03,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2019-02-15 10:49:03,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-02-15 10:49:03,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 150 transitions. [2019-02-15 10:49:03,450 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 150 transitions. Word has length 146 [2019-02-15 10:49:03,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:49:03,450 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 150 transitions. [2019-02-15 10:49:03,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-02-15 10:49:03,450 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 150 transitions. [2019-02-15 10:49:03,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-02-15 10:49:03,451 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:49:03,451 INFO L402 BasicCegarLoop]: trace histogram [72, 72, 1, 1, 1, 1] [2019-02-15 10:49:03,451 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:49:03,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:49:03,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1350409290, now seen corresponding path program 72 times [2019-02-15 10:49:03,451 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:49:03,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:03,452 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:49:03,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:03,452 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:49:03,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:05,434 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 2628 trivial. 0 not checked. [2019-02-15 10:49:05,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:05,434 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:49:05,434 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:49:05,434 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:49:05,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:05,434 INFO 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-02-15 10:49:05,443 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:49:05,443 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:49:05,548 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:49:05,548 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:49:05,553 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:49:05,579 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 2628 trivial. 0 not checked. [2019-02-15 10:49:05,580 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:49:11,287 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 2628 trivial. 0 not checked. [2019-02-15 10:49:11,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:49:11,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 147 [2019-02-15 10:49:11,306 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:49:11,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-02-15 10:49:11,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-02-15 10:49:11,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2019-02-15 10:49:11,308 INFO L87 Difference]: Start difference. First operand 149 states and 150 transitions. Second operand 75 states. [2019-02-15 10:49:11,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:49:11,787 INFO L93 Difference]: Finished difference Result 226 states and 229 transitions. [2019-02-15 10:49:11,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-02-15 10:49:11,787 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 148 [2019-02-15 10:49:11,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:49:11,788 INFO L225 Difference]: With dead ends: 226 [2019-02-15 10:49:11,788 INFO L226 Difference]: Without dead ends: 151 [2019-02-15 10:49:11,789 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2019-02-15 10:49:11,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-02-15 10:49:11,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2019-02-15 10:49:11,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-02-15 10:49:11,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 152 transitions. [2019-02-15 10:49:11,793 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 152 transitions. Word has length 148 [2019-02-15 10:49:11,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:49:11,793 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 152 transitions. [2019-02-15 10:49:11,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-02-15 10:49:11,793 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 152 transitions. [2019-02-15 10:49:11,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-02-15 10:49:11,794 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:49:11,794 INFO L402 BasicCegarLoop]: trace histogram [73, 73, 1, 1, 1, 1] [2019-02-15 10:49:11,794 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:49:11,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:49:11,795 INFO L82 PathProgramCache]: Analyzing trace with hash -699074251, now seen corresponding path program 73 times [2019-02-15 10:49:11,795 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:49:11,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:11,795 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:49:11,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:11,796 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:49:11,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:14,108 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 2701 trivial. 0 not checked. [2019-02-15 10:49:14,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:14,109 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:49:14,109 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:49:14,109 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:49:14,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:14,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 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-02-15 10:49:14,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:49:14,118 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:49:14,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:14,247 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:49:14,266 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 2701 trivial. 0 not checked. [2019-02-15 10:49:14,266 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:49:20,171 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 2701 trivial. 0 not checked. [2019-02-15 10:49:20,190 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:49:20,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 149 [2019-02-15 10:49:20,190 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:49:20,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-02-15 10:49:20,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-02-15 10:49:20,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2019-02-15 10:49:20,192 INFO L87 Difference]: Start difference. First operand 151 states and 152 transitions. Second operand 76 states. [2019-02-15 10:49:20,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:49:20,640 INFO L93 Difference]: Finished difference Result 229 states and 232 transitions. [2019-02-15 10:49:20,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-02-15 10:49:20,641 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 150 [2019-02-15 10:49:20,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:49:20,641 INFO L225 Difference]: With dead ends: 229 [2019-02-15 10:49:20,641 INFO L226 Difference]: Without dead ends: 153 [2019-02-15 10:49:20,642 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2019-02-15 10:49:20,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-02-15 10:49:20,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2019-02-15 10:49:20,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-02-15 10:49:20,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 154 transitions. [2019-02-15 10:49:20,646 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 154 transitions. Word has length 150 [2019-02-15 10:49:20,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:49:20,646 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 154 transitions. [2019-02-15 10:49:20,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-02-15 10:49:20,646 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 154 transitions. [2019-02-15 10:49:20,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-02-15 10:49:20,647 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:49:20,647 INFO L402 BasicCegarLoop]: trace histogram [74, 74, 1, 1, 1, 1] [2019-02-15 10:49:20,647 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:49:20,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:49:20,648 INFO L82 PathProgramCache]: Analyzing trace with hash -1078160534, now seen corresponding path program 74 times [2019-02-15 10:49:20,648 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:49:20,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:20,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:49:20,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:20,649 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:49:20,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:23,119 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2019-02-15 10:49:23,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:23,119 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:49:23,119 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:49:23,120 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:49:23,120 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:23,120 INFO 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-02-15 10:49:23,151 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:49:23,151 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:49:25,337 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2019-02-15 10:49:25,337 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:49:25,345 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:49:25,371 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2019-02-15 10:49:25,371 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:49:31,413 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2019-02-15 10:49:31,436 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:49:31,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 151 [2019-02-15 10:49:31,436 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:49:31,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-02-15 10:49:31,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-02-15 10:49:31,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2019-02-15 10:49:31,438 INFO L87 Difference]: Start difference. First operand 153 states and 154 transitions. Second operand 77 states. [2019-02-15 10:49:31,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:49:31,968 INFO L93 Difference]: Finished difference Result 232 states and 235 transitions. [2019-02-15 10:49:31,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-02-15 10:49:31,968 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 152 [2019-02-15 10:49:31,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:49:31,969 INFO L225 Difference]: With dead ends: 232 [2019-02-15 10:49:31,969 INFO L226 Difference]: Without dead ends: 155 [2019-02-15 10:49:31,970 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2019-02-15 10:49:31,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-02-15 10:49:31,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2019-02-15 10:49:31,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-02-15 10:49:31,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 156 transitions. [2019-02-15 10:49:31,973 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 156 transitions. Word has length 152 [2019-02-15 10:49:31,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:49:31,973 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 156 transitions. [2019-02-15 10:49:31,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-02-15 10:49:31,973 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 156 transitions. [2019-02-15 10:49:31,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-02-15 10:49:31,973 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:49:31,974 INFO L402 BasicCegarLoop]: trace histogram [75, 75, 1, 1, 1, 1] [2019-02-15 10:49:31,974 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:49:31,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:49:31,974 INFO L82 PathProgramCache]: Analyzing trace with hash -265541227, now seen corresponding path program 75 times [2019-02-15 10:49:31,974 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:49:31,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:31,975 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:49:31,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:31,975 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:49:32,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:34,316 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 2850 trivial. 0 not checked. [2019-02-15 10:49:34,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:34,316 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:49:34,316 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:49:34,316 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:49:34,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:34,316 INFO 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-02-15 10:49:34,325 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:49:34,325 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:49:34,428 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:49:34,428 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:49:34,432 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:49:34,451 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 2850 trivial. 0 not checked. [2019-02-15 10:49:34,451 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:49:40,585 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 2850 trivial. 0 not checked. [2019-02-15 10:49:40,603 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:49:40,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 153 [2019-02-15 10:49:40,603 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:49:40,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-02-15 10:49:40,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-02-15 10:49:40,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2019-02-15 10:49:40,605 INFO L87 Difference]: Start difference. First operand 155 states and 156 transitions. Second operand 78 states. [2019-02-15 10:49:41,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:49:41,236 INFO L93 Difference]: Finished difference Result 235 states and 238 transitions. [2019-02-15 10:49:41,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-02-15 10:49:41,237 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 154 [2019-02-15 10:49:41,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:49:41,238 INFO L225 Difference]: With dead ends: 235 [2019-02-15 10:49:41,238 INFO L226 Difference]: Without dead ends: 157 [2019-02-15 10:49:41,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2019-02-15 10:49:41,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-02-15 10:49:41,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2019-02-15 10:49:41,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-02-15 10:49:41,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 158 transitions. [2019-02-15 10:49:41,241 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 158 transitions. Word has length 154 [2019-02-15 10:49:41,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:49:41,242 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 158 transitions. [2019-02-15 10:49:41,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-02-15 10:49:41,242 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 158 transitions. [2019-02-15 10:49:41,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-02-15 10:49:41,242 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:49:41,242 INFO L402 BasicCegarLoop]: trace histogram [76, 76, 1, 1, 1, 1] [2019-02-15 10:49:41,242 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:49:41,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:49:41,243 INFO L82 PathProgramCache]: Analyzing trace with hash 289395338, now seen corresponding path program 76 times [2019-02-15 10:49:41,243 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:49:41,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:41,243 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:49:41,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:41,244 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:49:41,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:43,639 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 2926 trivial. 0 not checked. [2019-02-15 10:49:43,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:43,640 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:49:43,640 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:49:43,640 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:49:43,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:43,640 INFO 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-02-15 10:49:43,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:49:43,648 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:49:43,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:43,754 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:49:43,773 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 2926 trivial. 0 not checked. [2019-02-15 10:49:43,774 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:49:50,169 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 2926 trivial. 0 not checked. [2019-02-15 10:49:50,187 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:49:50,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 155 [2019-02-15 10:49:50,187 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:49:50,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-02-15 10:49:50,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-02-15 10:49:50,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2019-02-15 10:49:50,189 INFO L87 Difference]: Start difference. First operand 157 states and 158 transitions. Second operand 79 states. [2019-02-15 10:49:50,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:49:50,847 INFO L93 Difference]: Finished difference Result 238 states and 241 transitions. [2019-02-15 10:49:50,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-02-15 10:49:50,848 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 156 [2019-02-15 10:49:50,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:49:50,849 INFO L225 Difference]: With dead ends: 238 [2019-02-15 10:49:50,849 INFO L226 Difference]: Without dead ends: 159 [2019-02-15 10:49:50,850 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2019-02-15 10:49:50,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-02-15 10:49:50,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2019-02-15 10:49:50,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-02-15 10:49:50,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 160 transitions. [2019-02-15 10:49:50,854 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 160 transitions. Word has length 156 [2019-02-15 10:49:50,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:49:50,855 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 160 transitions. [2019-02-15 10:49:50,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-02-15 10:49:50,855 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 160 transitions. [2019-02-15 10:49:50,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-02-15 10:49:50,855 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:49:50,855 INFO L402 BasicCegarLoop]: trace histogram [77, 77, 1, 1, 1, 1] [2019-02-15 10:49:50,856 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:49:50,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:49:50,856 INFO L82 PathProgramCache]: Analyzing trace with hash -1275440651, now seen corresponding path program 77 times [2019-02-15 10:49:50,856 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:49:50,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:50,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:49:50,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:50,857 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:49:50,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:53,041 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2019-02-15 10:49:53,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:53,042 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:49:53,042 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:49:53,042 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:49:53,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:53,042 INFO 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-02-15 10:49:53,057 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:49:53,058 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:49:57,425 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2019-02-15 10:49:57,425 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:49:57,444 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:49:57,462 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2019-02-15 10:49:57,463 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:50:04,153 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2019-02-15 10:50:04,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:50:04,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 157 [2019-02-15 10:50:04,178 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:50:04,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-02-15 10:50:04,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-02-15 10:50:04,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2019-02-15 10:50:04,179 INFO L87 Difference]: Start difference. First operand 159 states and 160 transitions. Second operand 80 states. [2019-02-15 10:50:04,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:50:04,832 INFO L93 Difference]: Finished difference Result 241 states and 244 transitions. [2019-02-15 10:50:04,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-02-15 10:50:04,832 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 158 [2019-02-15 10:50:04,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:50:04,833 INFO L225 Difference]: With dead ends: 241 [2019-02-15 10:50:04,833 INFO L226 Difference]: Without dead ends: 161 [2019-02-15 10:50:04,834 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2019-02-15 10:50:04,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-02-15 10:50:04,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2019-02-15 10:50:04,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-02-15 10:50:04,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 162 transitions. [2019-02-15 10:50:04,837 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 162 transitions. Word has length 158 [2019-02-15 10:50:04,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:50:04,838 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 162 transitions. [2019-02-15 10:50:04,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-02-15 10:50:04,838 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 162 transitions. [2019-02-15 10:50:04,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-02-15 10:50:04,839 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:50:04,839 INFO L402 BasicCegarLoop]: trace histogram [78, 78, 1, 1, 1, 1] [2019-02-15 10:50:04,839 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:50:04,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:50:04,839 INFO L82 PathProgramCache]: Analyzing trace with hash 399333802, now seen corresponding path program 78 times [2019-02-15 10:50:04,839 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:50:04,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:50:04,840 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:50:04,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:50:04,840 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:50:04,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:50:07,108 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 3081 trivial. 0 not checked. [2019-02-15 10:50:07,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:50:07,109 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:50:07,109 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:50:07,109 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:50:07,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:50:07,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 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-02-15 10:50:07,118 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:50:07,118 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:50:07,227 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:50:07,227 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:50:07,231 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:50:07,250 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 3081 trivial. 0 not checked. [2019-02-15 10:50:07,250 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:50:13,751 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 3081 trivial. 0 not checked. [2019-02-15 10:50:13,769 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:50:13,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 159 [2019-02-15 10:50:13,770 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:50:13,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-02-15 10:50:13,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-02-15 10:50:13,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2019-02-15 10:50:13,772 INFO L87 Difference]: Start difference. First operand 161 states and 162 transitions. Second operand 81 states. [2019-02-15 10:50:14,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:50:14,538 INFO L93 Difference]: Finished difference Result 244 states and 247 transitions. [2019-02-15 10:50:14,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-02-15 10:50:14,538 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 160 [2019-02-15 10:50:14,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:50:14,539 INFO L225 Difference]: With dead ends: 244 [2019-02-15 10:50:14,539 INFO L226 Difference]: Without dead ends: 163 [2019-02-15 10:50:14,540 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2019-02-15 10:50:14,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-02-15 10:50:14,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2019-02-15 10:50:14,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-02-15 10:50:14,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 164 transitions. [2019-02-15 10:50:14,544 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 164 transitions. Word has length 160 [2019-02-15 10:50:14,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:50:14,544 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 164 transitions. [2019-02-15 10:50:14,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-02-15 10:50:14,544 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 164 transitions. [2019-02-15 10:50:14,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-02-15 10:50:14,545 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:50:14,545 INFO L402 BasicCegarLoop]: trace histogram [79, 79, 1, 1, 1, 1] [2019-02-15 10:50:14,545 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:50:14,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:50:14,546 INFO L82 PathProgramCache]: Analyzing trace with hash 77165141, now seen corresponding path program 79 times [2019-02-15 10:50:14,546 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:50:14,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:50:14,547 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:50:14,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:50:14,547 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:50:14,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:50:17,047 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 3160 trivial. 0 not checked. [2019-02-15 10:50:17,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:50:17,047 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:50:17,048 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:50:17,048 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:50:17,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:50:17,048 INFO 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-02-15 10:50:17,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:50:17,057 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:50:17,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:50:17,167 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:50:17,188 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 3160 trivial. 0 not checked. [2019-02-15 10:50:17,188 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:50:23,940 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 3160 trivial. 0 not checked. [2019-02-15 10:50:23,959 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:50:23,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 161 [2019-02-15 10:50:23,959 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:50:23,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-02-15 10:50:23,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-02-15 10:50:23,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2019-02-15 10:50:23,961 INFO L87 Difference]: Start difference. First operand 163 states and 164 transitions. Second operand 82 states. [2019-02-15 10:50:24,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:50:24,660 INFO L93 Difference]: Finished difference Result 247 states and 250 transitions. [2019-02-15 10:50:24,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-02-15 10:50:24,660 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 162 [2019-02-15 10:50:24,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:50:24,661 INFO L225 Difference]: With dead ends: 247 [2019-02-15 10:50:24,661 INFO L226 Difference]: Without dead ends: 165 [2019-02-15 10:50:24,661 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2019-02-15 10:50:24,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-02-15 10:50:24,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2019-02-15 10:50:24,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-02-15 10:50:24,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 166 transitions. [2019-02-15 10:50:24,664 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 166 transitions. Word has length 162 [2019-02-15 10:50:24,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:50:24,664 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 166 transitions. [2019-02-15 10:50:24,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-02-15 10:50:24,665 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 166 transitions. [2019-02-15 10:50:24,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-02-15 10:50:24,665 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:50:24,666 INFO L402 BasicCegarLoop]: trace histogram [80, 80, 1, 1, 1, 1] [2019-02-15 10:50:24,666 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:50:24,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:50:24,666 INFO L82 PathProgramCache]: Analyzing trace with hash -257218358, now seen corresponding path program 80 times [2019-02-15 10:50:24,666 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:50:24,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:50:24,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:50:24,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:50:24,667 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:50:24,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:50:27,097 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2019-02-15 10:50:27,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:50:27,098 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:50:27,098 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:50:27,098 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:50:27,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:50:27,098 INFO 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-02-15 10:50:27,106 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:50:27,106 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:50:30,067 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 41 check-sat command(s) [2019-02-15 10:50:30,068 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:50:30,075 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:50:30,094 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2019-02-15 10:50:30,094 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:50:37,177 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2019-02-15 10:50:37,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:50:37,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 163 [2019-02-15 10:50:37,201 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:50:37,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-02-15 10:50:37,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-02-15 10:50:37,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2019-02-15 10:50:37,203 INFO L87 Difference]: Start difference. First operand 165 states and 166 transitions. Second operand 83 states. [2019-02-15 10:50:37,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:50:37,908 INFO L93 Difference]: Finished difference Result 250 states and 253 transitions. [2019-02-15 10:50:37,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-02-15 10:50:37,908 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 164 [2019-02-15 10:50:37,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:50:37,909 INFO L225 Difference]: With dead ends: 250 [2019-02-15 10:50:37,909 INFO L226 Difference]: Without dead ends: 167 [2019-02-15 10:50:37,910 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2019-02-15 10:50:37,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-02-15 10:50:37,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2019-02-15 10:50:37,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-02-15 10:50:37,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 168 transitions. [2019-02-15 10:50:37,912 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 168 transitions. Word has length 164 [2019-02-15 10:50:37,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:50:37,913 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 168 transitions. [2019-02-15 10:50:37,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-02-15 10:50:37,913 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 168 transitions. [2019-02-15 10:50:37,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-02-15 10:50:37,913 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:50:37,913 INFO L402 BasicCegarLoop]: trace histogram [81, 81, 1, 1, 1, 1] [2019-02-15 10:50:37,914 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:50:37,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:50:37,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1516473013, now seen corresponding path program 81 times [2019-02-15 10:50:37,914 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:50:37,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:50:37,915 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:50:37,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:50:37,915 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:50:37,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:50:40,766 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 3321 trivial. 0 not checked. [2019-02-15 10:50:40,766 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:50:40,766 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:50:40,766 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:50:40,767 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:50:40,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:50:40,767 INFO 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-02-15 10:50:40,774 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:50:40,775 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:50:40,887 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:50:40,887 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:50:40,891 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:50:40,931 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 3321 trivial. 0 not checked. [2019-02-15 10:50:40,931 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:50:48,026 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 3321 trivial. 0 not checked. [2019-02-15 10:50:48,044 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:50:48,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 165 [2019-02-15 10:50:48,045 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:50:48,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-02-15 10:50:48,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-02-15 10:50:48,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2019-02-15 10:50:48,047 INFO L87 Difference]: Start difference. First operand 167 states and 168 transitions. Second operand 84 states. [2019-02-15 10:50:48,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:50:48,654 INFO L93 Difference]: Finished difference Result 253 states and 256 transitions. [2019-02-15 10:50:48,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-02-15 10:50:48,655 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 166 [2019-02-15 10:50:48,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:50:48,655 INFO L225 Difference]: With dead ends: 253 [2019-02-15 10:50:48,655 INFO L226 Difference]: Without dead ends: 169 [2019-02-15 10:50:48,656 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2019-02-15 10:50:48,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-02-15 10:50:48,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2019-02-15 10:50:48,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-02-15 10:50:48,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 170 transitions. [2019-02-15 10:50:48,660 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 170 transitions. Word has length 166 [2019-02-15 10:50:48,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:50:48,660 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 170 transitions. [2019-02-15 10:50:48,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-02-15 10:50:48,660 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 170 transitions. [2019-02-15 10:50:48,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-02-15 10:50:48,661 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:50:48,661 INFO L402 BasicCegarLoop]: trace histogram [82, 82, 1, 1, 1, 1] [2019-02-15 10:50:48,661 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:50:48,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:50:48,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1671380970, now seen corresponding path program 82 times [2019-02-15 10:50:48,662 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:50:48,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:50:48,662 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:50:48,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:50:48,662 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:50:48,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:50:51,352 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 3403 trivial. 0 not checked. [2019-02-15 10:50:51,352 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:50:51,353 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:50:51,353 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:50:51,353 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:50:51,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:50:51,353 INFO 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-02-15 10:50:51,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:50:51,361 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:50:51,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:50:51,478 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:50:51,499 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 3403 trivial. 0 not checked. [2019-02-15 10:50:51,500 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:50:58,873 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 3403 trivial. 0 not checked. [2019-02-15 10:50:58,892 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:50:58,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 167 [2019-02-15 10:50:58,893 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:50:58,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-02-15 10:50:58,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-02-15 10:50:58,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2019-02-15 10:50:58,894 INFO L87 Difference]: Start difference. First operand 169 states and 170 transitions. Second operand 85 states. [2019-02-15 10:50:59,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:50:59,730 INFO L93 Difference]: Finished difference Result 256 states and 259 transitions. [2019-02-15 10:50:59,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-02-15 10:50:59,730 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 168 [2019-02-15 10:50:59,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:50:59,731 INFO L225 Difference]: With dead ends: 256 [2019-02-15 10:50:59,731 INFO L226 Difference]: Without dead ends: 171 [2019-02-15 10:50:59,732 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2019-02-15 10:50:59,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-02-15 10:50:59,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2019-02-15 10:50:59,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-02-15 10:50:59,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 172 transitions. [2019-02-15 10:50:59,735 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 172 transitions. Word has length 168 [2019-02-15 10:50:59,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:50:59,735 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 172 transitions. [2019-02-15 10:50:59,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-02-15 10:50:59,735 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 172 transitions. [2019-02-15 10:50:59,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-02-15 10:50:59,736 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:50:59,736 INFO L402 BasicCegarLoop]: trace histogram [83, 83, 1, 1, 1, 1] [2019-02-15 10:50:59,736 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:50:59,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:50:59,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1664260885, now seen corresponding path program 83 times [2019-02-15 10:50:59,736 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:50:59,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:50:59,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:50:59,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:50:59,737 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:50:59,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:51:02,639 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2019-02-15 10:51:02,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:02,640 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:51:02,640 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:51:02,640 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:51:02,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:02,640 INFO 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-02-15 10:51:02,650 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:51:02,651 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:51:11,242 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 43 check-sat command(s) [2019-02-15 10:51:11,242 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:51:11,269 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:51:11,289 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2019-02-15 10:51:11,290 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:51:18,813 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2019-02-15 10:51:18,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:51:18,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 169 [2019-02-15 10:51:18,838 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:51:18,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-02-15 10:51:18,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-02-15 10:51:18,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2019-02-15 10:51:18,840 INFO L87 Difference]: Start difference. First operand 171 states and 172 transitions. Second operand 86 states. [2019-02-15 10:51:19,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:51:19,658 INFO L93 Difference]: Finished difference Result 259 states and 262 transitions. [2019-02-15 10:51:19,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-02-15 10:51:19,658 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 170 [2019-02-15 10:51:19,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:51:19,659 INFO L225 Difference]: With dead ends: 259 [2019-02-15 10:51:19,659 INFO L226 Difference]: Without dead ends: 173 [2019-02-15 10:51:19,659 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2019-02-15 10:51:19,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-02-15 10:51:19,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2019-02-15 10:51:19,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-02-15 10:51:19,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 174 transitions. [2019-02-15 10:51:19,662 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 174 transitions. Word has length 170 [2019-02-15 10:51:19,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:51:19,663 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 174 transitions. [2019-02-15 10:51:19,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-02-15 10:51:19,663 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 174 transitions. [2019-02-15 10:51:19,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-02-15 10:51:19,664 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:51:19,664 INFO L402 BasicCegarLoop]: trace histogram [84, 84, 1, 1, 1, 1] [2019-02-15 10:51:19,664 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:51:19,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:51:19,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1123000074, now seen corresponding path program 84 times [2019-02-15 10:51:19,665 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:51:19,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:19,665 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:51:19,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:19,666 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:51:19,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:51:22,470 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 3570 trivial. 0 not checked. [2019-02-15 10:51:22,470 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:22,470 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:51:22,470 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:51:22,471 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:51:22,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:22,471 INFO 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-02-15 10:51:22,478 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:51:22,478 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:51:22,594 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:51:22,594 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:51:22,598 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:51:22,621 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 3570 trivial. 0 not checked. [2019-02-15 10:51:22,622 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:51:30,113 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 3570 trivial. 0 not checked. [2019-02-15 10:51:30,132 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:51:30,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 171 [2019-02-15 10:51:30,132 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:51:30,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-02-15 10:51:30,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-02-15 10:51:30,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2019-02-15 10:51:30,135 INFO L87 Difference]: Start difference. First operand 173 states and 174 transitions. Second operand 87 states. [2019-02-15 10:51:30,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:51:30,967 INFO L93 Difference]: Finished difference Result 262 states and 265 transitions. [2019-02-15 10:51:30,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-02-15 10:51:30,967 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 172 [2019-02-15 10:51:30,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:51:30,968 INFO L225 Difference]: With dead ends: 262 [2019-02-15 10:51:30,968 INFO L226 Difference]: Without dead ends: 175 [2019-02-15 10:51:30,969 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2019-02-15 10:51:30,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-02-15 10:51:30,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2019-02-15 10:51:30,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-02-15 10:51:30,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 176 transitions. [2019-02-15 10:51:30,973 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 176 transitions. Word has length 172 [2019-02-15 10:51:30,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:51:30,973 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 176 transitions. [2019-02-15 10:51:30,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-02-15 10:51:30,973 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 176 transitions. [2019-02-15 10:51:30,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-02-15 10:51:30,977 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:51:30,977 INFO L402 BasicCegarLoop]: trace histogram [85, 85, 1, 1, 1, 1] [2019-02-15 10:51:30,978 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:51:30,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:51:30,978 INFO L82 PathProgramCache]: Analyzing trace with hash -1570725003, now seen corresponding path program 85 times [2019-02-15 10:51:30,978 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:51:30,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:30,979 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:51:30,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:30,979 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:51:31,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:51:33,699 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 3655 trivial. 0 not checked. [2019-02-15 10:51:33,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:33,699 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:51:33,699 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:51:33,700 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:51:33,700 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:33,700 INFO 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-02-15 10:51:33,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:51:33,710 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:51:33,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:51:33,828 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:51:33,851 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 3655 trivial. 0 not checked. [2019-02-15 10:51:33,851 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:51:41,828 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 3655 trivial. 0 not checked. [2019-02-15 10:51:41,845 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:51:41,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 173 [2019-02-15 10:51:41,846 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:51:41,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-02-15 10:51:41,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-02-15 10:51:41,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2019-02-15 10:51:41,848 INFO L87 Difference]: Start difference. First operand 175 states and 176 transitions. Second operand 88 states. [2019-02-15 10:51:42,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:51:42,749 INFO L93 Difference]: Finished difference Result 265 states and 268 transitions. [2019-02-15 10:51:42,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-02-15 10:51:42,749 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 174 [2019-02-15 10:51:42,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:51:42,750 INFO L225 Difference]: With dead ends: 265 [2019-02-15 10:51:42,750 INFO L226 Difference]: Without dead ends: 177 [2019-02-15 10:51:42,751 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2019-02-15 10:51:42,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-02-15 10:51:42,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2019-02-15 10:51:42,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-02-15 10:51:42,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 178 transitions. [2019-02-15 10:51:42,754 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 178 transitions. Word has length 174 [2019-02-15 10:51:42,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:51:42,754 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 178 transitions. [2019-02-15 10:51:42,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-02-15 10:51:42,755 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 178 transitions. [2019-02-15 10:51:42,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-02-15 10:51:42,755 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:51:42,756 INFO L402 BasicCegarLoop]: trace histogram [86, 86, 1, 1, 1, 1] [2019-02-15 10:51:42,756 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:51:42,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:51:42,756 INFO L82 PathProgramCache]: Analyzing trace with hash -882751958, now seen corresponding path program 86 times [2019-02-15 10:51:42,756 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:51:42,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:42,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:51:42,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:42,757 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:51:42,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:51:45,458 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 3741 trivial. 0 not checked. [2019-02-15 10:51:45,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:45,458 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:51:45,458 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:51:45,458 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:51:45,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:45,459 INFO 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-02-15 10:51:45,466 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:51:45,466 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:51:54,425 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) [2019-02-15 10:51:54,426 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:51:54,457 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:51:54,479 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 3741 trivial. 0 not checked. [2019-02-15 10:51:54,479 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:52:02,760 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 3741 trivial. 0 not checked. [2019-02-15 10:52:02,785 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:52:02,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 175 [2019-02-15 10:52:02,785 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:52:02,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-02-15 10:52:02,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-02-15 10:52:02,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2019-02-15 10:52:02,788 INFO L87 Difference]: Start difference. First operand 177 states and 178 transitions. Second operand 89 states. [2019-02-15 10:52:03,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:52:03,523 INFO L93 Difference]: Finished difference Result 268 states and 271 transitions. [2019-02-15 10:52:03,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-02-15 10:52:03,524 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 176 [2019-02-15 10:52:03,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:52:03,525 INFO L225 Difference]: With dead ends: 268 [2019-02-15 10:52:03,525 INFO L226 Difference]: Without dead ends: 179 [2019-02-15 10:52:03,527 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 438 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2019-02-15 10:52:03,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-02-15 10:52:03,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2019-02-15 10:52:03,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-02-15 10:52:03,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 180 transitions. [2019-02-15 10:52:03,530 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 180 transitions. Word has length 176 [2019-02-15 10:52:03,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:52:03,530 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 180 transitions. [2019-02-15 10:52:03,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-02-15 10:52:03,530 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 180 transitions. [2019-02-15 10:52:03,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-02-15 10:52:03,531 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:52:03,531 INFO L402 BasicCegarLoop]: trace histogram [87, 87, 1, 1, 1, 1] [2019-02-15 10:52:03,531 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:52:03,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:52:03,531 INFO L82 PathProgramCache]: Analyzing trace with hash 281519061, now seen corresponding path program 87 times [2019-02-15 10:52:03,532 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:52:03,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:52:03,532 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:52:03,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:52:03,532 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:52:03,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:52:06,363 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2019-02-15 10:52:06,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:52:06,363 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:52:06,363 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:52:06,363 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:52:06,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:52:06,364 INFO 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-02-15 10:52:06,390 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:52:06,390 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:52:06,509 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:52:06,509 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:52:06,514 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:52:06,536 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2019-02-15 10:52:06,536 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:52:14,578 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2019-02-15 10:52:14,597 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:52:14,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 177 [2019-02-15 10:52:14,598 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:52:14,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-02-15 10:52:14,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-02-15 10:52:14,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2019-02-15 10:52:14,600 INFO L87 Difference]: Start difference. First operand 179 states and 180 transitions. Second operand 90 states. [2019-02-15 10:52:15,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:52:15,525 INFO L93 Difference]: Finished difference Result 271 states and 274 transitions. [2019-02-15 10:52:15,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-02-15 10:52:15,526 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 178 [2019-02-15 10:52:15,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:52:15,526 INFO L225 Difference]: With dead ends: 271 [2019-02-15 10:52:15,526 INFO L226 Difference]: Without dead ends: 181 [2019-02-15 10:52:15,528 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 443 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2019-02-15 10:52:15,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-02-15 10:52:15,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2019-02-15 10:52:15,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-02-15 10:52:15,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 182 transitions. [2019-02-15 10:52:15,531 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 182 transitions. Word has length 178 [2019-02-15 10:52:15,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:52:15,531 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 182 transitions. [2019-02-15 10:52:15,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-02-15 10:52:15,531 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 182 transitions. [2019-02-15 10:52:15,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-02-15 10:52:15,532 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:52:15,532 INFO L402 BasicCegarLoop]: trace histogram [88, 88, 1, 1, 1, 1] [2019-02-15 10:52:15,532 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:52:15,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:52:15,532 INFO L82 PathProgramCache]: Analyzing trace with hash 71120202, now seen corresponding path program 88 times [2019-02-15 10:52:15,532 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:52:15,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:52:15,533 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:52:15,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:52:15,533 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:52:15,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:52:18,695 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 3916 trivial. 0 not checked. [2019-02-15 10:52:18,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:52:18,695 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:52:18,695 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:52:18,696 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:52:18,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:52:18,696 INFO 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-02-15 10:52:18,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:52:18,704 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:52:18,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:52:18,829 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:52:18,852 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 3916 trivial. 0 not checked. [2019-02-15 10:52:18,852 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:52:27,103 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 3916 trivial. 0 not checked. [2019-02-15 10:52:27,122 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:52:27,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90, 90] total 179 [2019-02-15 10:52:27,122 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:52:27,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-02-15 10:52:27,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-02-15 10:52:27,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2019-02-15 10:52:27,125 INFO L87 Difference]: Start difference. First operand 181 states and 182 transitions. Second operand 91 states. [2019-02-15 10:52:27,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:52:27,981 INFO L93 Difference]: Finished difference Result 274 states and 277 transitions. [2019-02-15 10:52:27,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-02-15 10:52:27,981 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 180 [2019-02-15 10:52:27,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:52:27,982 INFO L225 Difference]: With dead ends: 274 [2019-02-15 10:52:27,982 INFO L226 Difference]: Without dead ends: 183 [2019-02-15 10:52:27,983 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2019-02-15 10:52:27,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-02-15 10:52:27,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2019-02-15 10:52:27,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-02-15 10:52:27,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 184 transitions. [2019-02-15 10:52:27,986 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 184 transitions. Word has length 180 [2019-02-15 10:52:27,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:52:27,986 INFO L480 AbstractCegarLoop]: Abstraction has 183 states and 184 transitions. [2019-02-15 10:52:27,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-02-15 10:52:27,986 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 184 transitions. [2019-02-15 10:52:27,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-02-15 10:52:27,987 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:52:27,987 INFO L402 BasicCegarLoop]: trace histogram [89, 89, 1, 1, 1, 1] [2019-02-15 10:52:27,987 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:52:27,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:52:27,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1128162251, now seen corresponding path program 89 times [2019-02-15 10:52:27,987 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:52:27,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:52:27,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:52:27,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:52:27,988 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:52:28,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:52:30,783 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 4005 trivial. 0 not checked. [2019-02-15 10:52:30,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:52:30,783 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:52:30,784 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:52:30,784 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:52:30,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:52:30,784 INFO 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-02-15 10:52:30,792 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:52:30,792 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:52:35,501 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2019-02-15 10:52:35,501 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:52:35,509 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:52:35,532 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 4005 trivial. 0 not checked. [2019-02-15 10:52:35,532 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:52:44,345 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 4005 trivial. 0 not checked. [2019-02-15 10:52:44,371 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:52:44,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 181 [2019-02-15 10:52:44,371 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:52:44,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-02-15 10:52:44,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-02-15 10:52:44,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2019-02-15 10:52:44,373 INFO L87 Difference]: Start difference. First operand 183 states and 184 transitions. Second operand 92 states. [2019-02-15 10:52:45,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:52:45,131 INFO L93 Difference]: Finished difference Result 277 states and 280 transitions. [2019-02-15 10:52:45,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-02-15 10:52:45,132 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 182 [2019-02-15 10:52:45,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:52:45,132 INFO L225 Difference]: With dead ends: 277 [2019-02-15 10:52:45,132 INFO L226 Difference]: Without dead ends: 185 [2019-02-15 10:52:45,133 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2019-02-15 10:52:45,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-02-15 10:52:45,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2019-02-15 10:52:45,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-02-15 10:52:45,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 186 transitions. [2019-02-15 10:52:45,136 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 186 transitions. Word has length 182 [2019-02-15 10:52:45,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:52:45,136 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 186 transitions. [2019-02-15 10:52:45,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-02-15 10:52:45,137 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 186 transitions. [2019-02-15 10:52:45,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-02-15 10:52:45,137 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:52:45,137 INFO L402 BasicCegarLoop]: trace histogram [90, 90, 1, 1, 1, 1] [2019-02-15 10:52:45,137 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:52:45,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:52:45,138 INFO L82 PathProgramCache]: Analyzing trace with hash 524708970, now seen corresponding path program 90 times [2019-02-15 10:52:45,138 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:52:45,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:52:45,138 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:52:45,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:52:45,138 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:52:45,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:52:48,275 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 4095 trivial. 0 not checked. [2019-02-15 10:52:48,275 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:52:48,275 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:52:48,275 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:52:48,275 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:52:48,275 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:52:48,276 INFO 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-02-15 10:52:48,285 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:52:48,285 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:52:48,410 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:52:48,410 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:52:48,415 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:52:48,440 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 4095 trivial. 0 not checked. [2019-02-15 10:52:48,440 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:52:57,246 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 4095 trivial. 0 not checked. [2019-02-15 10:52:57,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:52:57,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92, 92] total 183 [2019-02-15 10:52:57,265 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:52:57,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-02-15 10:52:57,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-02-15 10:52:57,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2019-02-15 10:52:57,267 INFO L87 Difference]: Start difference. First operand 185 states and 186 transitions. Second operand 93 states. [2019-02-15 10:52:58,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:52:58,045 INFO L93 Difference]: Finished difference Result 280 states and 283 transitions. [2019-02-15 10:52:58,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-02-15 10:52:58,045 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 184 [2019-02-15 10:52:58,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:52:58,046 INFO L225 Difference]: With dead ends: 280 [2019-02-15 10:52:58,046 INFO L226 Difference]: Without dead ends: 187 [2019-02-15 10:52:58,047 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2019-02-15 10:52:58,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-02-15 10:52:58,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2019-02-15 10:52:58,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-02-15 10:52:58,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 188 transitions. [2019-02-15 10:52:58,051 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 188 transitions. Word has length 184 [2019-02-15 10:52:58,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:52:58,051 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 188 transitions. [2019-02-15 10:52:58,052 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-02-15 10:52:58,052 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 188 transitions. [2019-02-15 10:52:58,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-02-15 10:52:58,053 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:52:58,053 INFO L402 BasicCegarLoop]: trace histogram [91, 91, 1, 1, 1, 1] [2019-02-15 10:52:58,053 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:52:58,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:52:58,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1781042325, now seen corresponding path program 91 times [2019-02-15 10:52:58,053 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:52:58,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:52:58,054 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:52:58,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:52:58,054 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:52:58,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:53:01,045 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 4186 trivial. 0 not checked. [2019-02-15 10:53:01,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:01,046 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:53:01,046 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:53:01,046 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:53:01,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:01,046 INFO 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-02-15 10:53:01,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:53:01,055 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:53:01,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:53:01,184 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:53:01,207 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 4186 trivial. 0 not checked. [2019-02-15 10:53:01,208 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:53:10,426 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 4186 trivial. 0 not checked. [2019-02-15 10:53:10,445 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:53:10,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 185 [2019-02-15 10:53:10,445 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:53:10,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-02-15 10:53:10,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-02-15 10:53:10,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2019-02-15 10:53:10,448 INFO L87 Difference]: Start difference. First operand 187 states and 188 transitions. Second operand 94 states. [2019-02-15 10:53:11,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:53:11,537 INFO L93 Difference]: Finished difference Result 283 states and 286 transitions. [2019-02-15 10:53:11,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-02-15 10:53:11,537 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 186 [2019-02-15 10:53:11,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:53:11,538 INFO L225 Difference]: With dead ends: 283 [2019-02-15 10:53:11,538 INFO L226 Difference]: Without dead ends: 189 [2019-02-15 10:53:11,539 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 463 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2019-02-15 10:53:11,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-02-15 10:53:11,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2019-02-15 10:53:11,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-02-15 10:53:11,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 190 transitions. [2019-02-15 10:53:11,543 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 190 transitions. Word has length 186 [2019-02-15 10:53:11,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:53:11,544 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 190 transitions. [2019-02-15 10:53:11,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-02-15 10:53:11,544 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 190 transitions. [2019-02-15 10:53:11,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-02-15 10:53:11,545 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:53:11,545 INFO L402 BasicCegarLoop]: trace histogram [92, 92, 1, 1, 1, 1] [2019-02-15 10:53:11,545 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:53:11,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:53:11,545 INFO L82 PathProgramCache]: Analyzing trace with hash -658248822, now seen corresponding path program 92 times [2019-02-15 10:53:11,545 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:53:11,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:11,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:53:11,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:11,546 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:53:11,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:53:14,886 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 4278 trivial. 0 not checked. [2019-02-15 10:53:14,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:14,887 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:53:14,887 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:53:14,887 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:53:14,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:14,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 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-02-15 10:53:14,895 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:53:14,895 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:53:19,905 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 47 check-sat command(s) [2019-02-15 10:53:19,905 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:53:19,913 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:53:19,937 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 4278 trivial. 0 not checked. [2019-02-15 10:53:19,937 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:53:29,269 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 4278 trivial. 0 not checked. [2019-02-15 10:53:29,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:53:29,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94, 94] total 187 [2019-02-15 10:53:29,296 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:53:29,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-02-15 10:53:29,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-02-15 10:53:29,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2019-02-15 10:53:29,298 INFO L87 Difference]: Start difference. First operand 189 states and 190 transitions. Second operand 95 states. [2019-02-15 10:53:30,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:53:30,224 INFO L93 Difference]: Finished difference Result 286 states and 289 transitions. [2019-02-15 10:53:30,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-02-15 10:53:30,225 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 188 [2019-02-15 10:53:30,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:53:30,226 INFO L225 Difference]: With dead ends: 286 [2019-02-15 10:53:30,226 INFO L226 Difference]: Without dead ends: 191 [2019-02-15 10:53:30,227 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 468 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2019-02-15 10:53:30,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-02-15 10:53:30,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2019-02-15 10:53:30,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-02-15 10:53:30,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 192 transitions. [2019-02-15 10:53:30,230 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 192 transitions. Word has length 188 [2019-02-15 10:53:30,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:53:30,231 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 192 transitions. [2019-02-15 10:53:30,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-02-15 10:53:30,231 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 192 transitions. [2019-02-15 10:53:30,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-02-15 10:53:30,232 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:53:30,232 INFO L402 BasicCegarLoop]: trace histogram [93, 93, 1, 1, 1, 1] [2019-02-15 10:53:30,232 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:53:30,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:53:30,233 INFO L82 PathProgramCache]: Analyzing trace with hash 844526837, now seen corresponding path program 93 times [2019-02-15 10:53:30,233 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:53:30,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:30,233 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:53:30,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:30,234 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:53:30,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:53:33,373 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 4371 trivial. 0 not checked. [2019-02-15 10:53:33,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:33,373 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:53:33,373 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:53:33,373 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:53:33,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:33,373 INFO 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-02-15 10:53:33,383 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:53:33,383 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:53:33,508 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:53:33,509 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:53:33,513 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:53:33,538 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 4371 trivial. 0 not checked. [2019-02-15 10:53:33,539 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:53:42,943 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 4371 trivial. 0 not checked. [2019-02-15 10:53:42,962 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:53:42,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 189 [2019-02-15 10:53:42,963 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:53:42,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-02-15 10:53:42,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-02-15 10:53:42,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2019-02-15 10:53:42,965 INFO L87 Difference]: Start difference. First operand 191 states and 192 transitions. Second operand 96 states. [2019-02-15 10:53:44,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:53:44,104 INFO L93 Difference]: Finished difference Result 289 states and 292 transitions. [2019-02-15 10:53:44,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-02-15 10:53:44,104 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 190 [2019-02-15 10:53:44,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:53:44,105 INFO L225 Difference]: With dead ends: 289 [2019-02-15 10:53:44,105 INFO L226 Difference]: Without dead ends: 193 [2019-02-15 10:53:44,106 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 473 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2019-02-15 10:53:44,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-02-15 10:53:44,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2019-02-15 10:53:44,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-02-15 10:53:44,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 194 transitions. [2019-02-15 10:53:44,109 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 194 transitions. Word has length 190 [2019-02-15 10:53:44,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:53:44,110 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 194 transitions. [2019-02-15 10:53:44,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-02-15 10:53:44,110 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 194 transitions. [2019-02-15 10:53:44,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-02-15 10:53:44,110 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:53:44,111 INFO L402 BasicCegarLoop]: trace histogram [94, 94, 1, 1, 1, 1] [2019-02-15 10:53:44,111 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:53:44,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:53:44,111 INFO L82 PathProgramCache]: Analyzing trace with hash -679759190, now seen corresponding path program 94 times [2019-02-15 10:53:44,111 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:53:44,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:44,112 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:53:44,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:44,112 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:53:44,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:53:47,253 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 4465 trivial. 0 not checked. [2019-02-15 10:53:47,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:47,254 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:53:47,254 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:53:47,254 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:53:47,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:47,254 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-15 10:53:47,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:53:47,264 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:53:47,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:53:47,396 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:53:47,422 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 4465 trivial. 0 not checked. [2019-02-15 10:53:47,422 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:53:57,012 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 4465 trivial. 0 not checked. [2019-02-15 10:53:57,031 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:53:57,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 191 [2019-02-15 10:53:57,031 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:53:57,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-02-15 10:53:57,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-02-15 10:53:57,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2019-02-15 10:53:57,033 INFO L87 Difference]: Start difference. First operand 193 states and 194 transitions. Second operand 97 states. [2019-02-15 10:53:58,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:53:58,167 INFO L93 Difference]: Finished difference Result 292 states and 295 transitions. [2019-02-15 10:53:58,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-02-15 10:53:58,168 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 192 [2019-02-15 10:53:58,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:53:58,169 INFO L225 Difference]: With dead ends: 292 [2019-02-15 10:53:58,169 INFO L226 Difference]: Without dead ends: 195 [2019-02-15 10:53:58,169 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 478 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2019-02-15 10:53:58,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-02-15 10:53:58,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2019-02-15 10:53:58,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-02-15 10:53:58,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 196 transitions. [2019-02-15 10:53:58,172 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 196 transitions. Word has length 192 [2019-02-15 10:53:58,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:53:58,172 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 196 transitions. [2019-02-15 10:53:58,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-02-15 10:53:58,172 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 196 transitions. [2019-02-15 10:53:58,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-02-15 10:53:58,173 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:53:58,173 INFO L402 BasicCegarLoop]: trace histogram [95, 95, 1, 1, 1, 1] [2019-02-15 10:53:58,173 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:53:58,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:53:58,174 INFO L82 PathProgramCache]: Analyzing trace with hash 606426453, now seen corresponding path program 95 times [2019-02-15 10:53:58,174 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:53:58,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:58,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:53:58,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:58,175 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:53:58,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:54:01,716 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 4560 trivial. 0 not checked. [2019-02-15 10:54:01,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:54:01,717 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:54:01,717 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:54:01,717 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:54:01,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:54:01,717 INFO 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-02-15 10:54:01,726 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:54:01,726 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:54:07,629 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 49 check-sat command(s) [2019-02-15 10:54:07,629 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:54:07,640 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:54:07,665 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 4560 trivial. 0 not checked. [2019-02-15 10:54:07,666 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:54:17,626 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 4560 trivial. 0 not checked. [2019-02-15 10:54:17,652 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:54:17,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 193 [2019-02-15 10:54:17,653 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:54:17,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-02-15 10:54:17,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-02-15 10:54:17,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2019-02-15 10:54:17,655 INFO L87 Difference]: Start difference. First operand 195 states and 196 transitions. Second operand 98 states. [2019-02-15 10:54:18,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:54:18,955 INFO L93 Difference]: Finished difference Result 295 states and 298 transitions. [2019-02-15 10:54:18,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-02-15 10:54:18,955 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 194 [2019-02-15 10:54:18,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:54:18,956 INFO L225 Difference]: With dead ends: 295 [2019-02-15 10:54:18,956 INFO L226 Difference]: Without dead ends: 197 [2019-02-15 10:54:18,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 483 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2019-02-15 10:54:18,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-02-15 10:54:18,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2019-02-15 10:54:18,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-02-15 10:54:18,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 198 transitions. [2019-02-15 10:54:18,960 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 198 transitions. Word has length 194 [2019-02-15 10:54:18,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:54:18,961 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 198 transitions. [2019-02-15 10:54:18,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-02-15 10:54:18,961 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 198 transitions. [2019-02-15 10:54:18,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-02-15 10:54:18,962 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:54:18,962 INFO L402 BasicCegarLoop]: trace histogram [96, 96, 1, 1, 1, 1] [2019-02-15 10:54:18,962 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:54:18,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:54:18,962 INFO L82 PathProgramCache]: Analyzing trace with hash 213107146, now seen corresponding path program 96 times [2019-02-15 10:54:18,963 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:54:18,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:54:18,963 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:54:18,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:54:18,964 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:54:19,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:54:22,491 INFO L134 CoverageAnalysis]: Checked inductivity of 9312 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 4656 trivial. 0 not checked. [2019-02-15 10:54:22,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:54:22,492 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:54:22,492 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:54:22,492 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:54:22,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:54:22,492 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-15 10:54:22,501 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:54:22,501 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:54:22,636 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:54:22,637 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:54:22,642 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:54:22,669 INFO L134 CoverageAnalysis]: Checked inductivity of 9312 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 4656 trivial. 0 not checked. [2019-02-15 10:54:22,669 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:54:32,840 INFO L134 CoverageAnalysis]: Checked inductivity of 9312 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 4656 trivial. 0 not checked. [2019-02-15 10:54:32,859 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:54:32,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 195 [2019-02-15 10:54:32,859 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:54:32,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-02-15 10:54:32,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-02-15 10:54:32,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2019-02-15 10:54:32,861 INFO L87 Difference]: Start difference. First operand 197 states and 198 transitions. Second operand 99 states. [2019-02-15 10:54:34,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:54:34,205 INFO L93 Difference]: Finished difference Result 298 states and 301 transitions. [2019-02-15 10:54:34,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-02-15 10:54:34,205 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 196 [2019-02-15 10:54:34,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:54:34,206 INFO L225 Difference]: With dead ends: 298 [2019-02-15 10:54:34,206 INFO L226 Difference]: Without dead ends: 199 [2019-02-15 10:54:34,207 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 488 GetRequests, 294 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2019-02-15 10:54:34,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-02-15 10:54:34,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2019-02-15 10:54:34,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-02-15 10:54:34,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 200 transitions. [2019-02-15 10:54:34,210 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 200 transitions. Word has length 196 [2019-02-15 10:54:34,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:54:34,210 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 200 transitions. [2019-02-15 10:54:34,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-02-15 10:54:34,210 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 200 transitions. [2019-02-15 10:54:34,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-02-15 10:54:34,211 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:54:34,211 INFO L402 BasicCegarLoop]: trace histogram [97, 97, 1, 1, 1, 1] [2019-02-15 10:54:34,211 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:54:34,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:54:34,211 INFO L82 PathProgramCache]: Analyzing trace with hash -470864459, now seen corresponding path program 97 times [2019-02-15 10:54:34,212 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:54:34,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:54:34,212 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:54:34,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:54:34,212 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:54:34,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:54:37,893 INFO L134 CoverageAnalysis]: Checked inductivity of 9506 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 4753 trivial. 0 not checked. [2019-02-15 10:54:37,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:54:37,893 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:54:37,893 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:54:37,893 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:54:37,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:54:37,893 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-15 10:54:37,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:54:37,901 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:54:38,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:54:38,038 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:54:38,064 INFO L134 CoverageAnalysis]: Checked inductivity of 9506 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 4753 trivial. 0 not checked. [2019-02-15 10:54:38,064 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:54:48,433 INFO L134 CoverageAnalysis]: Checked inductivity of 9506 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 4753 trivial. 0 not checked. [2019-02-15 10:54:48,451 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:54:48,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 197 [2019-02-15 10:54:48,452 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:54:48,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-02-15 10:54:48,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-02-15 10:54:48,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2019-02-15 10:54:48,454 INFO L87 Difference]: Start difference. First operand 199 states and 200 transitions. Second operand 100 states. [2019-02-15 10:54:49,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:54:49,511 INFO L93 Difference]: Finished difference Result 301 states and 304 transitions. [2019-02-15 10:54:49,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-02-15 10:54:49,511 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 198 [2019-02-15 10:54:49,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:54:49,512 INFO L225 Difference]: With dead ends: 301 [2019-02-15 10:54:49,512 INFO L226 Difference]: Without dead ends: 201 [2019-02-15 10:54:49,513 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 493 GetRequests, 297 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2019-02-15 10:54:49,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-02-15 10:54:49,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2019-02-15 10:54:49,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-02-15 10:54:49,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 202 transitions. [2019-02-15 10:54:49,516 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 202 transitions. Word has length 198 [2019-02-15 10:54:49,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:54:49,516 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 202 transitions. [2019-02-15 10:54:49,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-02-15 10:54:49,516 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 202 transitions. [2019-02-15 10:54:49,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-02-15 10:54:49,517 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:54:49,517 INFO L402 BasicCegarLoop]: trace histogram [98, 98, 1, 1, 1, 1] [2019-02-15 10:54:49,517 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:54:49,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:54:49,518 INFO L82 PathProgramCache]: Analyzing trace with hash 338827498, now seen corresponding path program 98 times [2019-02-15 10:54:49,518 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:54:49,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:54:49,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:54:49,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:54:49,519 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:54:49,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:54:53,234 INFO L134 CoverageAnalysis]: Checked inductivity of 9702 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 4851 trivial. 0 not checked. [2019-02-15 10:54:53,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:54:53,234 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:54:53,234 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:54:53,234 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:54:53,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:54:53,235 INFO 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-02-15 10:54:53,242 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:54:53,243 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:55:08,271 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 50 check-sat command(s) [2019-02-15 10:55:08,271 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:55:08,311 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:55:08,337 INFO L134 CoverageAnalysis]: Checked inductivity of 9702 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 4851 trivial. 0 not checked. [2019-02-15 10:55:08,337 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:55:18,932 INFO L134 CoverageAnalysis]: Checked inductivity of 9702 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 4851 trivial. 0 not checked. [2019-02-15 10:55:18,959 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:55:18,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100, 100] total 199 [2019-02-15 10:55:18,959 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:55:18,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-02-15 10:55:18,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-02-15 10:55:18,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2019-02-15 10:55:18,962 INFO L87 Difference]: Start difference. First operand 201 states and 202 transitions. Second operand 101 states. [2019-02-15 10:55:20,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:55:20,333 INFO L93 Difference]: Finished difference Result 304 states and 307 transitions. [2019-02-15 10:55:20,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-02-15 10:55:20,334 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 200 [2019-02-15 10:55:20,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:55:20,335 INFO L225 Difference]: With dead ends: 304 [2019-02-15 10:55:20,335 INFO L226 Difference]: Without dead ends: 203 [2019-02-15 10:55:20,336 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 498 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2019-02-15 10:55:20,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-02-15 10:55:20,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2019-02-15 10:55:20,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-02-15 10:55:20,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 204 transitions. [2019-02-15 10:55:20,338 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 204 transitions. Word has length 200 [2019-02-15 10:55:20,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:55:20,338 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 204 transitions. [2019-02-15 10:55:20,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-02-15 10:55:20,339 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 204 transitions. [2019-02-15 10:55:20,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-02-15 10:55:20,339 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:55:20,339 INFO L402 BasicCegarLoop]: trace histogram [99, 99, 1, 1, 1, 1] [2019-02-15 10:55:20,339 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:55:20,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:55:20,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1267596821, now seen corresponding path program 99 times [2019-02-15 10:55:20,340 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:55:20,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:55:20,340 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:55:20,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:55:20,340 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:55:20,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:55:23,998 INFO L134 CoverageAnalysis]: Checked inductivity of 9900 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 4950 trivial. 0 not checked. [2019-02-15 10:55:23,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:55:23,998 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:55:23,998 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:55:23,998 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:55:23,999 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:55:23,999 INFO 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-02-15 10:55:24,006 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:55:24,006 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:55:24,144 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:55:24,145 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:55:24,149 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:55:24,177 INFO L134 CoverageAnalysis]: Checked inductivity of 9900 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 4950 trivial. 0 not checked. [2019-02-15 10:55:24,178 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:55:34,629 INFO L134 CoverageAnalysis]: Checked inductivity of 9900 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 4950 trivial. 0 not checked. [2019-02-15 10:55:34,648 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:55:34,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101, 101] total 201 [2019-02-15 10:55:34,649 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:55:34,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-02-15 10:55:34,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-02-15 10:55:34,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2019-02-15 10:55:34,651 INFO L87 Difference]: Start difference. First operand 203 states and 204 transitions. Second operand 102 states. [2019-02-15 10:55:36,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:55:36,063 INFO L93 Difference]: Finished difference Result 307 states and 310 transitions. [2019-02-15 10:55:36,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-02-15 10:55:36,063 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 202 [2019-02-15 10:55:36,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:55:36,064 INFO L225 Difference]: With dead ends: 307 [2019-02-15 10:55:36,064 INFO L226 Difference]: Without dead ends: 205 [2019-02-15 10:55:36,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 503 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2019-02-15 10:55:36,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-02-15 10:55:36,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2019-02-15 10:55:36,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-02-15 10:55:36,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 206 transitions. [2019-02-15 10:55:36,068 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 206 transitions. Word has length 202 [2019-02-15 10:55:36,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:55:36,068 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 206 transitions. [2019-02-15 10:55:36,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-02-15 10:55:36,068 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 206 transitions. [2019-02-15 10:55:36,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-02-15 10:55:36,068 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:55:36,069 INFO L402 BasicCegarLoop]: trace histogram [100, 100, 1, 1, 1, 1] [2019-02-15 10:55:36,069 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:55:36,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:55:36,069 INFO L82 PathProgramCache]: Analyzing trace with hash -1807960054, now seen corresponding path program 100 times [2019-02-15 10:55:36,069 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:55:36,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:55:36,070 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:55:36,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:55:36,070 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:55:36,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:55:39,899 INFO L134 CoverageAnalysis]: Checked inductivity of 10100 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 5050 trivial. 0 not checked. [2019-02-15 10:55:39,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:55:39,900 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:55:39,900 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:55:39,900 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:55:39,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:55:39,900 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:55:39,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:55:39,908 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:55:40,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:55:40,051 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:55:40,079 INFO L134 CoverageAnalysis]: Checked inductivity of 10100 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 5050 trivial. 0 not checked. [2019-02-15 10:55:40,080 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:55:51,006 INFO L134 CoverageAnalysis]: Checked inductivity of 10100 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 5050 trivial. 0 not checked. [2019-02-15 10:55:51,024 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:55:51,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 102, 102] total 203 [2019-02-15 10:55:51,025 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:55:51,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-02-15 10:55:51,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-02-15 10:55:51,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2019-02-15 10:55:51,027 INFO L87 Difference]: Start difference. First operand 205 states and 206 transitions. Second operand 103 states. [2019-02-15 10:55:52,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:55:52,381 INFO L93 Difference]: Finished difference Result 310 states and 313 transitions. [2019-02-15 10:55:52,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-02-15 10:55:52,381 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 204 [2019-02-15 10:55:52,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:55:52,382 INFO L225 Difference]: With dead ends: 310 [2019-02-15 10:55:52,383 INFO L226 Difference]: Without dead ends: 207 [2019-02-15 10:55:52,384 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 508 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2019-02-15 10:55:52,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-02-15 10:55:52,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2019-02-15 10:55:52,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2019-02-15 10:55:52,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 208 transitions. [2019-02-15 10:55:52,388 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 208 transitions. Word has length 204 [2019-02-15 10:55:52,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:55:52,388 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 208 transitions. [2019-02-15 10:55:52,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-02-15 10:55:52,388 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 208 transitions. [2019-02-15 10:55:52,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-02-15 10:55:52,393 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:55:52,393 INFO L402 BasicCegarLoop]: trace histogram [101, 101, 1, 1, 1, 1] [2019-02-15 10:55:52,393 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:55:52,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:55:52,393 INFO L82 PathProgramCache]: Analyzing trace with hash 173786741, now seen corresponding path program 101 times [2019-02-15 10:55:52,393 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:55:52,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:55:52,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:55:52,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:55:52,394 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:55:52,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:55:56,023 INFO L134 CoverageAnalysis]: Checked inductivity of 10302 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 5151 trivial. 0 not checked. [2019-02-15 10:55:56,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:55:56,024 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:55:56,024 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:55:56,024 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:55:56,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:55:56,024 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:55:56,033 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:55:56,033 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:56:14,468 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2019-02-15 10:56:14,468 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:56:14,524 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:56:14,553 INFO L134 CoverageAnalysis]: Checked inductivity of 10302 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 5151 trivial. 0 not checked. [2019-02-15 10:56:14,554 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:56:25,642 INFO L134 CoverageAnalysis]: Checked inductivity of 10302 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 5151 trivial. 0 not checked. [2019-02-15 10:56:25,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:56:25,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 103, 103] total 205 [2019-02-15 10:56:25,672 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:56:25,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-02-15 10:56:25,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-02-15 10:56:25,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2019-02-15 10:56:25,676 INFO L87 Difference]: Start difference. First operand 207 states and 208 transitions. Second operand 104 states. [2019-02-15 10:56:27,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:56:27,278 INFO L93 Difference]: Finished difference Result 313 states and 316 transitions. [2019-02-15 10:56:27,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-02-15 10:56:27,279 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 206 [2019-02-15 10:56:27,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:56:27,280 INFO L225 Difference]: With dead ends: 313 [2019-02-15 10:56:27,280 INFO L226 Difference]: Without dead ends: 209 [2019-02-15 10:56:27,282 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 513 GetRequests, 309 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2019-02-15 10:56:27,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-02-15 10:56:27,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2019-02-15 10:56:27,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-02-15 10:56:27,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 210 transitions. [2019-02-15 10:56:27,286 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 210 transitions. Word has length 206 [2019-02-15 10:56:27,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:56:27,286 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 210 transitions. [2019-02-15 10:56:27,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-02-15 10:56:27,287 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 210 transitions. [2019-02-15 10:56:27,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-02-15 10:56:27,288 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:56:27,288 INFO L402 BasicCegarLoop]: trace histogram [102, 102, 1, 1, 1, 1] [2019-02-15 10:56:27,288 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:56:27,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:56:27,288 INFO L82 PathProgramCache]: Analyzing trace with hash -1650876630, now seen corresponding path program 102 times [2019-02-15 10:56:27,288 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:56:27,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:56:27,289 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:56:27,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:56:27,289 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:56:27,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:56:31,365 INFO L134 CoverageAnalysis]: Checked inductivity of 10506 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 5253 trivial. 0 not checked. [2019-02-15 10:56:31,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:56:31,365 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:56:31,365 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:56:31,365 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:56:31,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:56:31,366 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:56:31,373 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:56:31,373 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:56:31,516 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:56:31,516 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:56:31,521 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:56:31,550 INFO L134 CoverageAnalysis]: Checked inductivity of 10506 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 5253 trivial. 0 not checked. [2019-02-15 10:56:31,550 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:56:43,093 INFO L134 CoverageAnalysis]: Checked inductivity of 10506 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 5253 trivial. 0 not checked. [2019-02-15 10:56:43,111 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:56:43,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104, 104, 104] total 207 [2019-02-15 10:56:43,111 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:56:43,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-02-15 10:56:43,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-02-15 10:56:43,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2019-02-15 10:56:43,115 INFO L87 Difference]: Start difference. First operand 209 states and 210 transitions. Second operand 105 states. [2019-02-15 10:56:44,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:56:44,509 INFO L93 Difference]: Finished difference Result 316 states and 319 transitions. [2019-02-15 10:56:44,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-02-15 10:56:44,509 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 208 [2019-02-15 10:56:44,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:56:44,510 INFO L225 Difference]: With dead ends: 316 [2019-02-15 10:56:44,510 INFO L226 Difference]: Without dead ends: 211 [2019-02-15 10:56:44,512 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 518 GetRequests, 312 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.4s TimeCoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2019-02-15 10:56:44,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-02-15 10:56:44,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2019-02-15 10:56:44,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-02-15 10:56:44,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 212 transitions. [2019-02-15 10:56:44,516 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 212 transitions. Word has length 208 [2019-02-15 10:56:44,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:56:44,517 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 212 transitions. [2019-02-15 10:56:44,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-02-15 10:56:44,517 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 212 transitions. [2019-02-15 10:56:44,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-02-15 10:56:44,518 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:56:44,518 INFO L402 BasicCegarLoop]: trace histogram [103, 103, 1, 1, 1, 1] [2019-02-15 10:56:44,518 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:56:44,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:56:44,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1160939221, now seen corresponding path program 103 times [2019-02-15 10:56:44,519 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:56:44,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:56:44,519 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:56:44,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:56:44,519 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:56:44,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:56:48,724 INFO L134 CoverageAnalysis]: Checked inductivity of 10712 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 5356 trivial. 0 not checked. [2019-02-15 10:56:48,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:56:48,725 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:56:48,725 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:56:48,725 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:56:48,725 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:56:48,725 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:56:48,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:56:48,737 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:56:48,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:56:48,885 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:56:48,922 INFO L134 CoverageAnalysis]: Checked inductivity of 10712 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 5356 trivial. 0 not checked. [2019-02-15 10:56:48,922 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:57:00,510 INFO L134 CoverageAnalysis]: Checked inductivity of 10712 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 5356 trivial. 0 not checked. [2019-02-15 10:57:00,529 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:57:00,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105, 105, 105] total 209 [2019-02-15 10:57:00,530 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:57:00,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-02-15 10:57:00,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-02-15 10:57:00,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2019-02-15 10:57:00,533 INFO L87 Difference]: Start difference. First operand 211 states and 212 transitions. Second operand 106 states. [2019-02-15 10:57:02,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:57:02,062 INFO L93 Difference]: Finished difference Result 319 states and 322 transitions. [2019-02-15 10:57:02,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-02-15 10:57:02,063 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 210 [2019-02-15 10:57:02,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:57:02,063 INFO L225 Difference]: With dead ends: 319 [2019-02-15 10:57:02,064 INFO L226 Difference]: Without dead ends: 213 [2019-02-15 10:57:02,066 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 523 GetRequests, 315 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2019-02-15 10:57:02,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-02-15 10:57:02,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2019-02-15 10:57:02,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-02-15 10:57:02,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 214 transitions. [2019-02-15 10:57:02,070 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 214 transitions. Word has length 210 [2019-02-15 10:57:02,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:57:02,070 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 214 transitions. [2019-02-15 10:57:02,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-02-15 10:57:02,070 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 214 transitions. [2019-02-15 10:57:02,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-02-15 10:57:02,071 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:57:02,072 INFO L402 BasicCegarLoop]: trace histogram [104, 104, 1, 1, 1, 1] [2019-02-15 10:57:02,072 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:57:02,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:02,072 INFO L82 PathProgramCache]: Analyzing trace with hash 193908298, now seen corresponding path program 104 times [2019-02-15 10:57:02,072 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:57:02,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:02,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:02,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:02,073 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:57:02,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:06,206 INFO L134 CoverageAnalysis]: Checked inductivity of 10920 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 5460 trivial. 0 not checked. [2019-02-15 10:57:06,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:06,207 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:57:06,207 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:57:06,207 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:57:06,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:06,207 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:57:06,216 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:57:06,216 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:57:14,536 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 53 check-sat command(s) [2019-02-15 10:57:14,536 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:57:14,547 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:57:14,578 INFO L134 CoverageAnalysis]: Checked inductivity of 10920 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 5460 trivial. 0 not checked. [2019-02-15 10:57:14,578 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:57:26,421 INFO L134 CoverageAnalysis]: Checked inductivity of 10920 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 5460 trivial. 0 not checked. [2019-02-15 10:57:26,450 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:57:26,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106, 106, 106] total 211 [2019-02-15 10:57:26,451 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:57:26,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-02-15 10:57:26,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-02-15 10:57:26,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2019-02-15 10:57:26,454 INFO L87 Difference]: Start difference. First operand 213 states and 214 transitions. Second operand 107 states. [2019-02-15 10:57:27,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:57:27,791 INFO L93 Difference]: Finished difference Result 322 states and 325 transitions. [2019-02-15 10:57:27,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-02-15 10:57:27,792 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 212 [2019-02-15 10:57:27,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:57:27,792 INFO L225 Difference]: With dead ends: 322 [2019-02-15 10:57:27,792 INFO L226 Difference]: Without dead ends: 215 [2019-02-15 10:57:27,794 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 528 GetRequests, 318 SyntacticMatches, 0 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2019-02-15 10:57:27,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-02-15 10:57:27,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2019-02-15 10:57:27,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2019-02-15 10:57:27,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 216 transitions. [2019-02-15 10:57:27,798 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 216 transitions. Word has length 212 [2019-02-15 10:57:27,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:57:27,799 INFO L480 AbstractCegarLoop]: Abstraction has 215 states and 216 transitions. [2019-02-15 10:57:27,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-02-15 10:57:27,799 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 216 transitions. [2019-02-15 10:57:27,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-02-15 10:57:27,800 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:57:27,800 INFO L402 BasicCegarLoop]: trace histogram [105, 105, 1, 1, 1, 1] [2019-02-15 10:57:27,800 INFO L423 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:57:27,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:27,801 INFO L82 PathProgramCache]: Analyzing trace with hash 913063733, now seen corresponding path program 105 times [2019-02-15 10:57:27,801 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:57:27,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:27,801 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:57:27,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:27,802 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:57:27,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:32,155 INFO L134 CoverageAnalysis]: Checked inductivity of 11130 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 5565 trivial. 0 not checked. [2019-02-15 10:57:32,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:32,155 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:57:32,156 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:57:32,156 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:57:32,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:32,156 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:57:32,164 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:57:32,164 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:57:32,307 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:57:32,307 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:57:32,312 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:57:32,344 INFO L134 CoverageAnalysis]: Checked inductivity of 11130 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 5565 trivial. 0 not checked. [2019-02-15 10:57:32,345 INFO L316 TraceCheckSpWp]: Computing backward predicates...