java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/array3.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-0302a3f [2019-02-25 15:36:47,555 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-25 15:36:47,557 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-25 15:36:47,574 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-25 15:36:47,574 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-25 15:36:47,575 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-25 15:36:47,578 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-25 15:36:47,580 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-25 15:36:47,585 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-25 15:36:47,586 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-25 15:36:47,587 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-25 15:36:47,589 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-25 15:36:47,590 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-25 15:36:47,592 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-25 15:36:47,600 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-25 15:36:47,601 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-25 15:36:47,604 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-25 15:36:47,607 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-25 15:36:47,610 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-25 15:36:47,612 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-25 15:36:47,613 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-25 15:36:47,615 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-25 15:36:47,617 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-25 15:36:47,618 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-25 15:36:47,618 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-25 15:36:47,619 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-25 15:36:47,620 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-25 15:36:47,621 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-25 15:36:47,624 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-25 15:36:47,625 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-25 15:36:47,626 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-25 15:36:47,627 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-25 15:36:47,628 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-25 15:36:47,629 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-25 15:36:47,630 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-25 15:36:47,630 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-25 15:36:47,631 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2019-02-25 15:36:47,649 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-25 15:36:47,649 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-25 15:36:47,650 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-25 15:36:47,650 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-25 15:36:47,650 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-25 15:36:47,650 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-25 15:36:47,650 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-25 15:36:47,651 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-25 15:36:47,651 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-25 15:36:47,651 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-02-25 15:36:47,651 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-02-25 15:36:47,651 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-25 15:36:47,652 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-25 15:36:47,652 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-25 15:36:47,653 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-25 15:36:47,653 INFO L133 SettingsManager]: * Use SBE=true [2019-02-25 15:36:47,653 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-25 15:36:47,653 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-25 15:36:47,653 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-25 15:36:47,654 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-25 15:36:47,654 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-25 15:36:47,654 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-25 15:36:47,654 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-25 15:36:47,654 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-25 15:36:47,654 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-25 15:36:47,655 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-25 15:36:47,655 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-25 15:36:47,655 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-25 15:36:47,655 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-25 15:36:47,655 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-25 15:36:47,656 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-25 15:36:47,656 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-25 15:36:47,656 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-25 15:36:47,656 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-25 15:36:47,656 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-25 15:36:47,657 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-25 15:36:47,657 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-02-25 15:36:47,657 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-25 15:36:47,657 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-25 15:36:47,687 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-25 15:36:47,698 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-25 15:36:47,702 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-25 15:36:47,703 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-25 15:36:47,703 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-25 15:36:47,704 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-25 15:36:47,704 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array3.i_4.bpl' [2019-02-25 15:36:47,755 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-25 15:36:47,756 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-25 15:36:47,757 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-25 15:36:47,757 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-25 15:36:47,757 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-25 15:36:47,774 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 25.02 03:36:47" (1/1) ... [2019-02-25 15:36:47,785 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 25.02 03:36:47" (1/1) ... [2019-02-25 15:36:47,793 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-25 15:36:47,794 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-25 15:36:47,794 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-25 15:36:47,794 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-25 15:36:47,806 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:36:47" (1/1) ... [2019-02-25 15:36:47,806 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:36:47" (1/1) ... [2019-02-25 15:36:47,808 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:36:47" (1/1) ... [2019-02-25 15:36:47,809 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:36:47" (1/1) ... [2019-02-25 15:36:47,813 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:36:47" (1/1) ... [2019-02-25 15:36:47,816 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:36:47" (1/1) ... [2019-02-25 15:36:47,817 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:36:47" (1/1) ... [2019-02-25 15:36:47,819 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-25 15:36:47,819 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-25 15:36:47,819 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-25 15:36:47,820 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-25 15:36:47,821 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:36: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-25 15:36:47,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-25 15:36:47,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-25 15:36:48,148 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-25 15:36:48,148 INFO L286 CfgBuilder]: Removed 2 assue(true) statements. [2019-02-25 15:36:48,151 INFO L202 PluginConnector]: Adding new model array3.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.02 03:36:48 BoogieIcfgContainer [2019-02-25 15:36:48,152 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-25 15:36:48,153 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-25 15:36:48,153 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-25 15:36:48,156 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-25 15:36:48,156 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:36:47" (1/2) ... [2019-02-25 15:36:48,157 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bb1dd5e and model type array3.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.02 03:36:48, skipping insertion in model container [2019-02-25 15:36:48,157 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.02 03:36:48" (2/2) ... [2019-02-25 15:36:48,160 INFO L112 eAbstractionObserver]: Analyzing ICFG array3.i_4.bpl [2019-02-25 15:36:48,170 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-25 15:36:48,179 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-02-25 15:36:48,192 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-02-25 15:36:48,225 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-25 15:36:48,226 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-25 15:36:48,226 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-25 15:36:48,226 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-25 15:36:48,226 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-25 15:36:48,226 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-25 15:36:48,226 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-25 15:36:48,227 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-25 15:36:48,239 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2019-02-25 15:36:48,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:36:48,245 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:36:48,246 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:36:48,248 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:36:48,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:36:48,254 INFO L82 PathProgramCache]: Analyzing trace with hash 928714, now seen corresponding path program 1 times [2019-02-25 15:36:48,257 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:36:48,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:48,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:36:48,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:48,301 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:36:48,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:36:48,380 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-25 15:36:48,382 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-25 15:36:48,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-25 15:36:48,383 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:36:48,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-25 15:36:48,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-25 15:36:48,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-25 15:36:48,400 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2019-02-25 15:36:48,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:36:48,469 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2019-02-25 15:36:48,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-25 15:36:48,472 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-02-25 15:36:48,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:36:48,484 INFO L225 Difference]: With dead ends: 12 [2019-02-25 15:36:48,484 INFO L226 Difference]: Without dead ends: 7 [2019-02-25 15:36:48,488 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-25 15:36:48,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-02-25 15:36:48,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-02-25 15:36:48,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-02-25 15:36:48,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-02-25 15:36:48,532 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 4 [2019-02-25 15:36:48,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:36:48,533 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-02-25 15:36:48,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-25 15:36:48,533 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2019-02-25 15:36:48,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:36:48,533 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:36:48,534 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:36:48,534 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:36:48,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:36:48,534 INFO L82 PathProgramCache]: Analyzing trace with hash 894131125, now seen corresponding path program 1 times [2019-02-25 15:36:48,535 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:36:48,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:48,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:36:48,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:48,536 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:36:48,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:36:48,651 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-25 15:36:48,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:48,652 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:36:48,653 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:36:48,656 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [12], [14], [16] [2019-02-25 15:36:48,748 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:36:48,748 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:36:51,173 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:36:51,175 INFO L272 AbstractInterpreter]: Visited 6 different actions 34 times. Merged at 2 different actions 14 times. Widened at 2 different actions 6 times. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:36:51,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:36:51,186 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:36:51,186 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:51,186 INFO 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-25 15:36:51,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:36:51,204 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:36:51,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:36:51,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 3 conjunts are in the unsatisfiable core [2019-02-25 15:36:51,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:36:51,255 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-25 15:36:51,256 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:36:51,414 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-25 15:36:51,435 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:36:51,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2019-02-25 15:36:51,435 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:36:51,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-25 15:36:51,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-25 15:36:51,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-02-25 15:36:51,437 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 4 states. [2019-02-25 15:36:51,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:36:51,525 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2019-02-25 15:36:51,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-25 15:36:51,525 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-02-25 15:36:51,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:36:51,526 INFO L225 Difference]: With dead ends: 13 [2019-02-25 15:36:51,526 INFO L226 Difference]: Without dead ends: 9 [2019-02-25 15:36:51,527 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-02-25 15:36:51,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-02-25 15:36:51,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-02-25 15:36:51,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-02-25 15:36:51,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-02-25 15:36:51,531 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2019-02-25 15:36:51,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:36:51,531 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-02-25 15:36:51,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-25 15:36:51,532 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2019-02-25 15:36:51,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-25 15:36:51,532 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:36:51,533 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2019-02-25 15:36:51,533 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:36:51,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:36:51,534 INFO L82 PathProgramCache]: Analyzing trace with hash 315556586, now seen corresponding path program 2 times [2019-02-25 15:36:51,534 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:36:51,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:51,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:36:51,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:51,536 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:36:51,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:36:51,678 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-25 15:36:51,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:51,679 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:36:51,679 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:36:51,680 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:36:51,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:51,680 INFO 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-25 15:36:51,690 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:36:51,690 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:36:51,709 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-02-25 15:36:51,709 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:36:51,711 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 4 conjunts are in the unsatisfiable core [2019-02-25 15:36:51,712 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:36:51,716 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-25 15:36:51,716 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:36:51,952 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-25 15:36:51,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:36:51,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2019-02-25 15:36:51,984 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:36:51,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-02-25 15:36:51,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-02-25 15:36:51,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-02-25 15:36:51,986 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 5 states. [2019-02-25 15:36:52,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:36:52,156 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2019-02-25 15:36:52,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-25 15:36:52,158 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-02-25 15:36:52,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:36:52,159 INFO L225 Difference]: With dead ends: 16 [2019-02-25 15:36:52,159 INFO L226 Difference]: Without dead ends: 11 [2019-02-25 15:36:52,160 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-02-25 15:36:52,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-02-25 15:36:52,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-02-25 15:36:52,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-02-25 15:36:52,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2019-02-25 15:36:52,163 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 8 [2019-02-25 15:36:52,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:36:52,163 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-02-25 15:36:52,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-02-25 15:36:52,163 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2019-02-25 15:36:52,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-02-25 15:36:52,164 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:36:52,164 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1] [2019-02-25 15:36:52,165 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:36:52,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:36:52,165 INFO L82 PathProgramCache]: Analyzing trace with hash -175395819, now seen corresponding path program 3 times [2019-02-25 15:36:52,165 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:36:52,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:52,166 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:36:52,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:52,167 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:36:52,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:36:52,306 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-25 15:36:52,307 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:52,307 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:36:52,307 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:36:52,307 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:36:52,307 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:52,308 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-25 15:36:52,325 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:36:52,326 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:36:52,354 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:36:52,355 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:36:52,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 5 conjunts are in the unsatisfiable core [2019-02-25 15:36:52,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:36:52,362 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-25 15:36:52,362 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:36:52,531 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-25 15:36:52,564 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:36:52,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2019-02-25 15:36:52,564 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:36:52,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-25 15:36:52,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-25 15:36:52,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-02-25 15:36:52,566 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 6 states. [2019-02-25 15:36:52,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:36:52,617 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2019-02-25 15:36:52,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:36:52,617 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-02-25 15:36:52,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:36:52,618 INFO L225 Difference]: With dead ends: 19 [2019-02-25 15:36:52,618 INFO L226 Difference]: Without dead ends: 13 [2019-02-25 15:36:52,619 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-25 15:36:52,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-02-25 15:36:52,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-02-25 15:36:52,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-02-25 15:36:52,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-02-25 15:36:52,622 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2019-02-25 15:36:52,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:36:52,623 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-02-25 15:36:52,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-25 15:36:52,623 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-02-25 15:36:52,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-02-25 15:36:52,624 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:36:52,624 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1] [2019-02-25 15:36:52,624 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:36:52,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:36:52,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1258544630, now seen corresponding path program 4 times [2019-02-25 15:36:52,624 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:36:52,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:52,625 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:36:52,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:52,625 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:36:52,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:36:52,754 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-25 15:36:52,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:52,755 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:36:52,755 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:36:52,756 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:36:52,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:52,756 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-25 15:36:52,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:36:52,765 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:36:52,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:36:52,782 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 6 conjunts are in the unsatisfiable core [2019-02-25 15:36:52,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:36:52,787 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-25 15:36:52,787 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:36:53,153 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-25 15:36:53,173 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:36:53,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2019-02-25 15:36:53,173 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:36:53,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-02-25 15:36:53,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-02-25 15:36:53,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-02-25 15:36:53,174 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 7 states. [2019-02-25 15:36:53,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:36:53,318 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2019-02-25 15:36:53,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:36:53,319 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2019-02-25 15:36:53,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:36:53,320 INFO L225 Difference]: With dead ends: 22 [2019-02-25 15:36:53,321 INFO L226 Difference]: Without dead ends: 15 [2019-02-25 15:36:53,321 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-02-25 15:36:53,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-02-25 15:36:53,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-02-25 15:36:53,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-02-25 15:36:53,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-02-25 15:36:53,325 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2019-02-25 15:36:53,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:36:53,326 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-02-25 15:36:53,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-02-25 15:36:53,326 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2019-02-25 15:36:53,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-02-25 15:36:53,326 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:36:53,326 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1] [2019-02-25 15:36:53,327 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:36:53,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:36:53,327 INFO L82 PathProgramCache]: Analyzing trace with hash -400886667, now seen corresponding path program 5 times [2019-02-25 15:36:53,327 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:36:53,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:53,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:36:53,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:53,328 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:36:53,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:36:53,722 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-25 15:36:53,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:53,722 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:36:53,722 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:36:53,723 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:36:53,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:53,723 INFO 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-25 15:36:53,732 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:36:53,732 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:36:53,755 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-02-25 15:36:53,756 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:36:53,756 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 7 conjunts are in the unsatisfiable core [2019-02-25 15:36:53,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:36:53,766 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-25 15:36:53,766 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:36:53,882 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-25 15:36:53,903 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:36:53,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2019-02-25 15:36:53,904 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:36:53,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:36:53,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:36:53,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:36:53,905 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 8 states. [2019-02-25 15:36:53,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:36:53,947 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2019-02-25 15:36:53,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:36:53,947 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-02-25 15:36:53,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:36:53,948 INFO L225 Difference]: With dead ends: 25 [2019-02-25 15:36:53,948 INFO L226 Difference]: Without dead ends: 17 [2019-02-25 15:36:53,949 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-25 15:36:53,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-02-25 15:36:53,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-02-25 15:36:53,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-02-25 15:36:53,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-02-25 15:36:53,953 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 14 [2019-02-25 15:36:53,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:36:53,954 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-02-25 15:36:53,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:36:53,954 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-02-25 15:36:53,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-02-25 15:36:53,954 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:36:53,955 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1] [2019-02-25 15:36:53,955 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:36:53,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:36:53,955 INFO L82 PathProgramCache]: Analyzing trace with hash -10778326, now seen corresponding path program 6 times [2019-02-25 15:36:53,955 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:36:53,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:53,956 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:36:53,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:53,956 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:36:53,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:36:54,054 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-25 15:36:54,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:54,054 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:36:54,054 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:36:54,054 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:36:54,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:54,055 INFO 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-25 15:36:54,064 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:36:54,064 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:36:54,078 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:36:54,078 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:36:54,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjunts are in the unsatisfiable core [2019-02-25 15:36:54,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:36:54,085 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-25 15:36:54,085 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:36:54,273 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-25 15:36:54,293 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:36:54,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2019-02-25 15:36:54,293 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:36:54,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-25 15:36:54,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-25 15:36:54,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-02-25 15:36:54,294 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 9 states. [2019-02-25 15:36:54,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:36:54,338 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2019-02-25 15:36:54,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-25 15:36:54,339 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2019-02-25 15:36:54,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:36:54,340 INFO L225 Difference]: With dead ends: 28 [2019-02-25 15:36:54,340 INFO L226 Difference]: Without dead ends: 19 [2019-02-25 15:36:54,341 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-02-25 15:36:54,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-02-25 15:36:54,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-02-25 15:36:54,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-02-25 15:36:54,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2019-02-25 15:36:54,344 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 16 [2019-02-25 15:36:54,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:36:54,345 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-02-25 15:36:54,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-25 15:36:54,345 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2019-02-25 15:36:54,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-02-25 15:36:54,346 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:36:54,346 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1] [2019-02-25 15:36:54,346 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:36:54,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:36:54,346 INFO L82 PathProgramCache]: Analyzing trace with hash 701707477, now seen corresponding path program 7 times [2019-02-25 15:36:54,346 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:36:54,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:54,347 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:36:54,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:54,348 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:36:54,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:36:54,459 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-25 15:36:54,460 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:54,460 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:36:54,460 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:36:54,461 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:36:54,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:54,461 INFO 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-25 15:36:54,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:36:54,472 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:36:54,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:36:54,487 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 9 conjunts are in the unsatisfiable core [2019-02-25 15:36:54,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:36:54,493 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-25 15:36:54,494 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:36:54,644 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-25 15:36:54,665 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:36:54,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2019-02-25 15:36:54,665 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:36:54,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:36:54,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:36:54,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-02-25 15:36:54,666 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 10 states. [2019-02-25 15:36:54,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:36:54,747 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2019-02-25 15:36:54,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-25 15:36:54,748 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2019-02-25 15:36:54,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:36:54,749 INFO L225 Difference]: With dead ends: 31 [2019-02-25 15:36:54,749 INFO L226 Difference]: Without dead ends: 21 [2019-02-25 15:36:54,750 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-02-25 15:36:54,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-02-25 15:36:54,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-02-25 15:36:54,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-02-25 15:36:54,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-02-25 15:36:54,755 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 18 [2019-02-25 15:36:54,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:36:54,755 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-02-25 15:36:54,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:36:54,755 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2019-02-25 15:36:54,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-02-25 15:36:54,756 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:36:54,756 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1] [2019-02-25 15:36:54,756 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:36:54,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:36:54,756 INFO L82 PathProgramCache]: Analyzing trace with hash -718063542, now seen corresponding path program 8 times [2019-02-25 15:36:54,756 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:36:54,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:54,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:36:54,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:54,758 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:36:54,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:36:54,880 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-25 15:36:54,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:54,881 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:36:54,881 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:36:54,881 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:36:54,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:54,881 INFO 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-25 15:36:54,898 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:36:54,898 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:36:54,916 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-02-25 15:36:54,916 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:36:54,917 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 10 conjunts are in the unsatisfiable core [2019-02-25 15:36:54,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:36:54,924 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-25 15:36:54,925 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:36:55,125 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-25 15:36:55,145 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:36:55,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2019-02-25 15:36:55,145 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:36:55,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-25 15:36:55,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-25 15:36:55,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-02-25 15:36:55,147 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 11 states. [2019-02-25 15:36:55,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:36:55,311 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2019-02-25 15:36:55,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-25 15:36:55,312 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2019-02-25 15:36:55,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:36:55,313 INFO L225 Difference]: With dead ends: 34 [2019-02-25 15:36:55,313 INFO L226 Difference]: Without dead ends: 23 [2019-02-25 15:36:55,313 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-02-25 15:36:55,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-02-25 15:36:55,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-02-25 15:36:55,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-02-25 15:36:55,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-02-25 15:36:55,319 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 20 [2019-02-25 15:36:55,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:36:55,319 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-02-25 15:36:55,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-25 15:36:55,319 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-02-25 15:36:55,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-02-25 15:36:55,320 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:36:55,320 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1] [2019-02-25 15:36:55,321 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:36:55,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:36:55,321 INFO L82 PathProgramCache]: Analyzing trace with hash -317821643, now seen corresponding path program 9 times [2019-02-25 15:36:55,321 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:36:55,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:55,322 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:36:55,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:55,322 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:36:55,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:36:55,550 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-25 15:36:55,550 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:55,550 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:36:55,551 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:36:55,551 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:36:55,551 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:55,551 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-25 15:36:55,560 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:36:55,560 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:36:55,595 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:36:55,595 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:36:55,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 11 conjunts are in the unsatisfiable core [2019-02-25 15:36:55,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:36:55,608 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-25 15:36:55,608 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:36:56,105 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-25 15:36:56,124 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:36:56,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2019-02-25 15:36:56,125 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:36:56,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-25 15:36:56,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-25 15:36:56,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-02-25 15:36:56,126 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 12 states. [2019-02-25 15:36:56,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:36:56,200 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2019-02-25 15:36:56,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-02-25 15:36:56,201 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2019-02-25 15:36:56,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:36:56,201 INFO L225 Difference]: With dead ends: 37 [2019-02-25 15:36:56,201 INFO L226 Difference]: Without dead ends: 25 [2019-02-25 15:36:56,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-02-25 15:36:56,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-02-25 15:36:56,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-02-25 15:36:56,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-02-25 15:36:56,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2019-02-25 15:36:56,206 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 22 [2019-02-25 15:36:56,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:36:56,207 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-02-25 15:36:56,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-25 15:36:56,207 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2019-02-25 15:36:56,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-02-25 15:36:56,208 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:36:56,208 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1] [2019-02-25 15:36:56,208 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:36:56,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:36:56,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1145646954, now seen corresponding path program 10 times [2019-02-25 15:36:56,209 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:36:56,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:56,210 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:36:56,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:56,210 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:36:56,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:36:56,371 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-25 15:36:56,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:56,372 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:36:56,372 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:36:56,372 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:36:56,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:56,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 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-25 15:36:56,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:36:56,393 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:36:56,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:36:56,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 12 conjunts are in the unsatisfiable core [2019-02-25 15:36:56,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:36:56,422 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-25 15:36:56,423 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:36:56,934 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-25 15:36:56,953 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:36:56,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2019-02-25 15:36:56,954 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:36:56,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-02-25 15:36:56,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-02-25 15:36:56,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-02-25 15:36:56,955 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 13 states. [2019-02-25 15:36:57,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:36:57,017 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2019-02-25 15:36:57,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-02-25 15:36:57,018 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2019-02-25 15:36:57,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:36:57,018 INFO L225 Difference]: With dead ends: 40 [2019-02-25 15:36:57,018 INFO L226 Difference]: Without dead ends: 27 [2019-02-25 15:36:57,019 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-25 15:36:57,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-02-25 15:36:57,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-02-25 15:36:57,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-02-25 15:36:57,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-02-25 15:36:57,024 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 24 [2019-02-25 15:36:57,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:36:57,025 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-02-25 15:36:57,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-02-25 15:36:57,025 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-02-25 15:36:57,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-02-25 15:36:57,026 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:36:57,026 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1] [2019-02-25 15:36:57,026 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:36:57,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:36:57,026 INFO L82 PathProgramCache]: Analyzing trace with hash 430349717, now seen corresponding path program 11 times [2019-02-25 15:36:57,026 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:36:57,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:57,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:36:57,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:57,028 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:36:57,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:36:57,374 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-25 15:36:57,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:57,375 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:36:57,375 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:36:57,375 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:36:57,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:57,375 INFO 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-25 15:36:57,384 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:36:57,384 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:36:57,412 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-02-25 15:36:57,412 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:36:57,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-25 15:36:57,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:36:57,421 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-25 15:36:57,421 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:36:57,985 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-25 15:36:58,005 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:36:58,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2019-02-25 15:36:58,006 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:36:58,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-02-25 15:36:58,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-02-25 15:36:58,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-02-25 15:36:58,007 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 14 states. [2019-02-25 15:36:58,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:36:58,057 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2019-02-25 15:36:58,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-02-25 15:36:58,058 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2019-02-25 15:36:58,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:36:58,058 INFO L225 Difference]: With dead ends: 43 [2019-02-25 15:36:58,059 INFO L226 Difference]: Without dead ends: 29 [2019-02-25 15:36:58,060 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-02-25 15:36:58,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-02-25 15:36:58,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-02-25 15:36:58,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-02-25 15:36:58,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-02-25 15:36:58,064 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 26 [2019-02-25 15:36:58,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:36:58,065 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-02-25 15:36:58,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-02-25 15:36:58,065 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-02-25 15:36:58,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-02-25 15:36:58,066 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:36:58,066 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1] [2019-02-25 15:36:58,066 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:36:58,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:36:58,066 INFO L82 PathProgramCache]: Analyzing trace with hash -454857078, now seen corresponding path program 12 times [2019-02-25 15:36:58,066 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:36:58,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:58,067 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:36:58,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:58,068 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:36:58,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:36:58,227 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-25 15:36:58,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:58,228 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:36:58,228 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:36:58,228 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:36:58,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:58,229 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-25 15:36:58,248 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:36:58,248 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:36:58,281 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:36:58,282 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:36:58,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-25 15:36:58,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:36:58,290 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-25 15:36:58,290 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:36:58,511 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-25 15:36:58,532 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:36:58,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2019-02-25 15:36:58,532 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:36:58,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-02-25 15:36:58,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-02-25 15:36:58,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-02-25 15:36:58,534 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 15 states. [2019-02-25 15:36:58,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:36:58,705 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2019-02-25 15:36:58,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-02-25 15:36:58,706 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2019-02-25 15:36:58,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:36:58,706 INFO L225 Difference]: With dead ends: 46 [2019-02-25 15:36:58,706 INFO L226 Difference]: Without dead ends: 31 [2019-02-25 15:36:58,708 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-02-25 15:36:58,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-02-25 15:36:58,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-02-25 15:36:58,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-02-25 15:36:58,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2019-02-25 15:36:58,712 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 28 [2019-02-25 15:36:58,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:36:58,712 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2019-02-25 15:36:58,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-02-25 15:36:58,713 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2019-02-25 15:36:58,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-02-25 15:36:58,713 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:36:58,713 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1] [2019-02-25 15:36:58,714 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:36:58,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:36:58,714 INFO L82 PathProgramCache]: Analyzing trace with hash -319437323, now seen corresponding path program 13 times [2019-02-25 15:36:58,714 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:36:58,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:58,715 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:36:58,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:58,715 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:36:58,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:36:58,946 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-25 15:36:58,946 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:58,946 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:36:58,947 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:36:58,947 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:36:58,947 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:58,947 INFO 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-25 15:36:58,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:36:58,959 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:36:58,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:36:58,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-25 15:36:58,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:36:58,992 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-25 15:36:58,993 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:36:59,343 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-25 15:36:59,363 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:36:59,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2019-02-25 15:36:59,363 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:36:59,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-02-25 15:36:59,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-02-25 15:36:59,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-02-25 15:36:59,364 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 16 states. [2019-02-25 15:36:59,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:36:59,427 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2019-02-25 15:36:59,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-02-25 15:36:59,428 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2019-02-25 15:36:59,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:36:59,429 INFO L225 Difference]: With dead ends: 49 [2019-02-25 15:36:59,429 INFO L226 Difference]: Without dead ends: 33 [2019-02-25 15:36:59,430 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-02-25 15:36:59,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-02-25 15:36:59,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-02-25 15:36:59,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-02-25 15:36:59,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2019-02-25 15:36:59,434 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 30 [2019-02-25 15:36:59,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:36:59,435 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2019-02-25 15:36:59,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-02-25 15:36:59,435 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2019-02-25 15:36:59,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-02-25 15:36:59,436 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:36:59,436 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1] [2019-02-25 15:36:59,436 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:36:59,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:36:59,436 INFO L82 PathProgramCache]: Analyzing trace with hash 969405866, now seen corresponding path program 14 times [2019-02-25 15:36:59,437 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:36:59,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:59,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:36:59,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:59,438 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:36:59,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:36:59,672 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-25 15:36:59,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:59,672 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:36:59,672 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:36:59,673 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:36:59,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:59,673 INFO 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-25 15:36:59,682 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:36:59,683 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:36:59,721 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-02-25 15:36:59,721 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:36:59,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 16 conjunts are in the unsatisfiable core [2019-02-25 15:36:59,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:36:59,731 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-25 15:36:59,731 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:37:00,098 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-25 15:37:00,118 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:37:00,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2019-02-25 15:37:00,119 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:37:00,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-02-25 15:37:00,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-02-25 15:37:00,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-02-25 15:37:00,120 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 17 states. [2019-02-25 15:37:00,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:37:00,191 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2019-02-25 15:37:00,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-02-25 15:37:00,192 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2019-02-25 15:37:00,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:37:00,193 INFO L225 Difference]: With dead ends: 52 [2019-02-25 15:37:00,193 INFO L226 Difference]: Without dead ends: 35 [2019-02-25 15:37:00,193 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-02-25 15:37:00,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-02-25 15:37:00,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-02-25 15:37:00,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-02-25 15:37:00,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2019-02-25 15:37:00,197 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 32 [2019-02-25 15:37:00,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:37:00,197 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2019-02-25 15:37:00,197 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-02-25 15:37:00,197 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2019-02-25 15:37:00,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-02-25 15:37:00,198 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:37:00,198 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1] [2019-02-25 15:37:00,199 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:37:00,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:37:00,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1714035115, now seen corresponding path program 15 times [2019-02-25 15:37:00,199 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:37:00,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:00,200 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:37:00,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:00,200 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:37:00,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:00,424 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-25 15:37:00,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:00,425 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:37:00,425 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:37:00,425 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:37:00,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:00,425 INFO 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-25 15:37:00,434 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:37:00,434 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:37:00,462 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:37:00,462 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:37:00,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 17 conjunts are in the unsatisfiable core [2019-02-25 15:37:00,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:37:00,471 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-25 15:37:00,471 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:37:00,789 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-25 15:37:00,808 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:37:00,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2019-02-25 15:37:00,809 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:37:00,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-02-25 15:37:00,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-02-25 15:37:00,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-02-25 15:37:00,810 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 18 states. [2019-02-25 15:37:00,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:37:00,937 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2019-02-25 15:37:00,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-02-25 15:37:00,938 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 34 [2019-02-25 15:37:00,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:37:00,939 INFO L225 Difference]: With dead ends: 55 [2019-02-25 15:37:00,939 INFO L226 Difference]: Without dead ends: 37 [2019-02-25 15:37:00,940 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-02-25 15:37:00,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-02-25 15:37:00,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-02-25 15:37:00,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-02-25 15:37:00,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2019-02-25 15:37:00,945 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 34 [2019-02-25 15:37:00,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:37:00,945 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2019-02-25 15:37:00,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-02-25 15:37:00,946 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2019-02-25 15:37:00,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-02-25 15:37:00,946 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:37:00,946 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1] [2019-02-25 15:37:00,947 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:37:00,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:37:00,947 INFO L82 PathProgramCache]: Analyzing trace with hash 272417994, now seen corresponding path program 16 times [2019-02-25 15:37:00,947 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:37:00,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:00,948 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:37:00,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:00,948 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:37:00,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:01,946 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-25 15:37:01,947 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:01,947 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:37:01,947 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:37:01,947 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:37:01,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:01,948 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-25 15:37:01,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:37:01,957 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:37:01,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:01,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 18 conjunts are in the unsatisfiable core [2019-02-25 15:37:01,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:37:01,990 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-25 15:37:01,990 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:37:02,542 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-25 15:37:02,560 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:37:02,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2019-02-25 15:37:02,561 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:37:02,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-02-25 15:37:02,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-02-25 15:37:02,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-02-25 15:37:02,562 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 19 states. [2019-02-25 15:37:02,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:37:02,632 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2019-02-25 15:37:02,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-02-25 15:37:02,632 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 36 [2019-02-25 15:37:02,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:37:02,632 INFO L225 Difference]: With dead ends: 58 [2019-02-25 15:37:02,632 INFO L226 Difference]: Without dead ends: 39 [2019-02-25 15:37:02,633 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-02-25 15:37:02,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-02-25 15:37:02,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-02-25 15:37:02,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-02-25 15:37:02,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2019-02-25 15:37:02,637 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 36 [2019-02-25 15:37:02,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:37:02,638 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2019-02-25 15:37:02,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-02-25 15:37:02,638 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2019-02-25 15:37:02,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-02-25 15:37:02,638 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:37:02,638 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1] [2019-02-25 15:37:02,639 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:37:02,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:37:02,639 INFO L82 PathProgramCache]: Analyzing trace with hash -392102219, now seen corresponding path program 17 times [2019-02-25 15:37:02,639 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:37:02,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:02,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:37:02,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:02,640 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:37:02,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:02,912 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-25 15:37:02,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:02,913 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:37:02,913 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:37:02,913 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:37:02,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:02,913 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-25 15:37:02,926 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:37:02,926 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:37:02,974 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-02-25 15:37:02,975 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:37:02,976 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 19 conjunts are in the unsatisfiable core [2019-02-25 15:37:02,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:37:02,991 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-25 15:37:02,991 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:37:03,732 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-25 15:37:03,754 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:37:03,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2019-02-25 15:37:03,754 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:37:03,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-02-25 15:37:03,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-02-25 15:37:03,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-02-25 15:37:03,755 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 20 states. [2019-02-25 15:37:03,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:37:03,826 INFO L93 Difference]: Finished difference Result 61 states and 64 transitions. [2019-02-25 15:37:03,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-02-25 15:37:03,827 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 38 [2019-02-25 15:37:03,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:37:03,827 INFO L225 Difference]: With dead ends: 61 [2019-02-25 15:37:03,828 INFO L226 Difference]: Without dead ends: 41 [2019-02-25 15:37:03,829 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-02-25 15:37:03,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-02-25 15:37:03,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-02-25 15:37:03,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-02-25 15:37:03,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2019-02-25 15:37:03,834 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 38 [2019-02-25 15:37:03,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:37:03,834 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2019-02-25 15:37:03,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-02-25 15:37:03,834 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2019-02-25 15:37:03,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-02-25 15:37:03,835 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:37:03,835 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1] [2019-02-25 15:37:03,835 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:37:03,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:37:03,836 INFO L82 PathProgramCache]: Analyzing trace with hash -536355862, now seen corresponding path program 18 times [2019-02-25 15:37:03,836 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:37:03,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:03,836 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:37:03,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:03,837 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:37:03,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:04,320 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-25 15:37:04,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:04,320 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:37:04,321 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:37:04,321 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:37:04,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:04,321 INFO 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-25 15:37:04,340 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:37:04,340 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:37:04,384 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:37:04,384 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:37:04,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 20 conjunts are in the unsatisfiable core [2019-02-25 15:37:04,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:37:04,393 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-25 15:37:04,394 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:37:04,888 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-25 15:37:04,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:37:04,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2019-02-25 15:37:04,910 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:37:04,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-02-25 15:37:04,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-02-25 15:37:04,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-02-25 15:37:04,911 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 21 states. [2019-02-25 15:37:05,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:37:05,080 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2019-02-25 15:37:05,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-02-25 15:37:05,080 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 40 [2019-02-25 15:37:05,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:37:05,081 INFO L225 Difference]: With dead ends: 64 [2019-02-25 15:37:05,081 INFO L226 Difference]: Without dead ends: 43 [2019-02-25 15:37:05,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-02-25 15:37:05,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-02-25 15:37:05,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-02-25 15:37:05,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-02-25 15:37:05,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2019-02-25 15:37:05,087 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 40 [2019-02-25 15:37:05,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:37:05,087 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2019-02-25 15:37:05,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-02-25 15:37:05,087 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2019-02-25 15:37:05,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-02-25 15:37:05,088 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:37:05,088 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1] [2019-02-25 15:37:05,088 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:37:05,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:37:05,089 INFO L82 PathProgramCache]: Analyzing trace with hash -684650731, now seen corresponding path program 19 times [2019-02-25 15:37:05,089 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:37:05,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:05,089 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:37:05,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:05,090 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:37:05,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:05,436 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-25 15:37:05,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:05,436 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:37:05,436 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:37:05,437 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:37:05,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:05,437 INFO 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-25 15:37:05,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:37:05,448 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:37:05,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:05,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 21 conjunts are in the unsatisfiable core [2019-02-25 15:37:05,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:37:05,486 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-25 15:37:05,486 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:37:06,002 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-25 15:37:06,022 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:37:06,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2019-02-25 15:37:06,023 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:37:06,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-02-25 15:37:06,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-02-25 15:37:06,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-02-25 15:37:06,024 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 22 states. [2019-02-25 15:37:06,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:37:06,091 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2019-02-25 15:37:06,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-02-25 15:37:06,092 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 42 [2019-02-25 15:37:06,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:37:06,093 INFO L225 Difference]: With dead ends: 67 [2019-02-25 15:37:06,093 INFO L226 Difference]: Without dead ends: 45 [2019-02-25 15:37:06,094 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-02-25 15:37:06,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-02-25 15:37:06,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-02-25 15:37:06,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-02-25 15:37:06,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2019-02-25 15:37:06,098 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 42 [2019-02-25 15:37:06,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:37:06,098 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2019-02-25 15:37:06,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-02-25 15:37:06,099 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2019-02-25 15:37:06,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-02-25 15:37:06,099 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:37:06,099 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1] [2019-02-25 15:37:06,100 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:37:06,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:37:06,100 INFO L82 PathProgramCache]: Analyzing trace with hash 728709898, now seen corresponding path program 20 times [2019-02-25 15:37:06,100 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:37:06,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:06,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:37:06,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:06,101 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:37:06,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:06,477 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-25 15:37:06,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:06,477 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:37:06,477 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:37:06,477 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:37:06,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:06,478 INFO 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-25 15:37:06,487 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:37:06,488 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:37:06,555 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-02-25 15:37:06,555 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:37:06,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 22 conjunts are in the unsatisfiable core [2019-02-25 15:37:06,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:37:06,563 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-25 15:37:06,563 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:37:07,072 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-25 15:37:07,092 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:37:07,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2019-02-25 15:37:07,092 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:37:07,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-02-25 15:37:07,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-02-25 15:37:07,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-02-25 15:37:07,093 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 23 states. [2019-02-25 15:37:07,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:37:07,172 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2019-02-25 15:37:07,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-02-25 15:37:07,172 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 44 [2019-02-25 15:37:07,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:37:07,173 INFO L225 Difference]: With dead ends: 70 [2019-02-25 15:37:07,174 INFO L226 Difference]: Without dead ends: 47 [2019-02-25 15:37:07,175 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-25 15:37:07,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-02-25 15:37:07,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-02-25 15:37:07,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-02-25 15:37:07,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2019-02-25 15:37:07,178 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 44 [2019-02-25 15:37:07,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:37:07,179 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2019-02-25 15:37:07,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-02-25 15:37:07,179 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2019-02-25 15:37:07,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-02-25 15:37:07,180 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:37:07,180 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1] [2019-02-25 15:37:07,180 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:37:07,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:37:07,180 INFO L82 PathProgramCache]: Analyzing trace with hash 954210165, now seen corresponding path program 21 times [2019-02-25 15:37:07,180 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:37:07,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:07,181 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:37:07,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:07,181 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:37:07,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:07,467 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-25 15:37:07,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:07,467 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:37:07,467 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:37:07,467 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:37:07,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:07,468 INFO 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-25 15:37:07,477 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:37:07,477 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:37:07,510 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:37:07,510 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:37:07,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 23 conjunts are in the unsatisfiable core [2019-02-25 15:37:07,513 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:37:07,521 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-25 15:37:07,521 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:37:08,325 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-25 15:37:08,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:37:08,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2019-02-25 15:37:08,345 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:37:08,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-02-25 15:37:08,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-02-25 15:37:08,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-02-25 15:37:08,346 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 24 states. [2019-02-25 15:37:08,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:37:08,458 INFO L93 Difference]: Finished difference Result 73 states and 76 transitions. [2019-02-25 15:37:08,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-02-25 15:37:08,461 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 46 [2019-02-25 15:37:08,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:37:08,461 INFO L225 Difference]: With dead ends: 73 [2019-02-25 15:37:08,462 INFO L226 Difference]: Without dead ends: 49 [2019-02-25 15:37:08,463 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-02-25 15:37:08,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-02-25 15:37:08,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-02-25 15:37:08,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-02-25 15:37:08,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2019-02-25 15:37:08,466 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 46 [2019-02-25 15:37:08,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:37:08,466 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2019-02-25 15:37:08,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-02-25 15:37:08,466 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2019-02-25 15:37:08,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-02-25 15:37:08,469 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:37:08,469 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1] [2019-02-25 15:37:08,469 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:37:08,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:37:08,469 INFO L82 PathProgramCache]: Analyzing trace with hash -549920214, now seen corresponding path program 22 times [2019-02-25 15:37:08,469 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:37:08,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:08,470 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:37:08,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:08,470 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:37:08,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:08,809 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-25 15:37:08,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:08,810 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:37:08,810 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:37:08,810 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:37:08,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:08,810 INFO 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-25 15:37:08,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:37:08,819 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:37:08,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:08,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 24 conjunts are in the unsatisfiable core [2019-02-25 15:37:08,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:37:08,867 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-25 15:37:08,867 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:37:09,571 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-25 15:37:09,589 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:37:09,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2019-02-25 15:37:09,590 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:37:09,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-02-25 15:37:09,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-02-25 15:37:09,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-02-25 15:37:09,592 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 25 states. [2019-02-25 15:37:09,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:37:09,750 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2019-02-25 15:37:09,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-02-25 15:37:09,752 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 48 [2019-02-25 15:37:09,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:37:09,753 INFO L225 Difference]: With dead ends: 76 [2019-02-25 15:37:09,753 INFO L226 Difference]: Without dead ends: 51 [2019-02-25 15:37:09,754 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-25 15:37:09,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-02-25 15:37:09,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-02-25 15:37:09,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-02-25 15:37:09,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2019-02-25 15:37:09,758 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 48 [2019-02-25 15:37:09,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:37:09,758 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2019-02-25 15:37:09,758 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-02-25 15:37:09,758 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2019-02-25 15:37:09,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-02-25 15:37:09,759 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:37:09,759 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1] [2019-02-25 15:37:09,759 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:37:09,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:37:09,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1451759573, now seen corresponding path program 23 times [2019-02-25 15:37:09,759 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:37:09,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:09,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:37:09,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:09,760 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:37:09,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:10,719 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-25 15:37:10,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:10,719 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:37:10,719 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:37:10,719 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:37:10,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:10,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 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-25 15:37:10,728 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:37:10,728 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:37:10,805 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-02-25 15:37:10,806 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:37:10,808 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 25 conjunts are in the unsatisfiable core [2019-02-25 15:37:10,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:37:10,818 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-25 15:37:10,818 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:37:11,429 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-25 15:37:11,456 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:37:11,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2019-02-25 15:37:11,457 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:37:11,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-02-25 15:37:11,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-02-25 15:37:11,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-02-25 15:37:11,458 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 26 states. [2019-02-25 15:37:11,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:37:11,550 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2019-02-25 15:37:11,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-02-25 15:37:11,551 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 50 [2019-02-25 15:37:11,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:37:11,551 INFO L225 Difference]: With dead ends: 79 [2019-02-25 15:37:11,551 INFO L226 Difference]: Without dead ends: 53 [2019-02-25 15:37:11,553 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-02-25 15:37:11,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-02-25 15:37:11,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-02-25 15:37:11,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-02-25 15:37:11,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2019-02-25 15:37:11,557 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 50 [2019-02-25 15:37:11,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:37:11,557 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2019-02-25 15:37:11,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-02-25 15:37:11,557 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2019-02-25 15:37:11,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-02-25 15:37:11,558 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:37:11,558 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1] [2019-02-25 15:37:11,558 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:37:11,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:37:11,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1297428150, now seen corresponding path program 24 times [2019-02-25 15:37:11,558 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:37:11,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:11,559 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:37:11,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:11,559 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:37:11,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:12,013 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-25 15:37:12,013 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:12,013 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:37:12,013 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:37:12,013 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:37:12,013 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:12,014 INFO 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-25 15:37:12,022 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:37:12,023 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:37:12,066 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:37:12,066 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:37:12,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 26 conjunts are in the unsatisfiable core [2019-02-25 15:37:12,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:37:12,076 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-25 15:37:12,076 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:37:13,209 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-25 15:37:13,228 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:37:13,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2019-02-25 15:37:13,228 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:37:13,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-02-25 15:37:13,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-02-25 15:37:13,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-02-25 15:37:13,229 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 27 states. [2019-02-25 15:37:13,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:37:13,365 INFO L93 Difference]: Finished difference Result 82 states and 85 transitions. [2019-02-25 15:37:13,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-02-25 15:37:13,366 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 52 [2019-02-25 15:37:13,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:37:13,367 INFO L225 Difference]: With dead ends: 82 [2019-02-25 15:37:13,367 INFO L226 Difference]: Without dead ends: 55 [2019-02-25 15:37:13,368 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-02-25 15:37:13,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-02-25 15:37:13,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-02-25 15:37:13,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-02-25 15:37:13,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2019-02-25 15:37:13,371 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 52 [2019-02-25 15:37:13,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:37:13,372 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2019-02-25 15:37:13,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-02-25 15:37:13,372 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2019-02-25 15:37:13,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-02-25 15:37:13,372 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:37:13,372 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1] [2019-02-25 15:37:13,373 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:37:13,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:37:13,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1904013259, now seen corresponding path program 25 times [2019-02-25 15:37:13,373 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:37:13,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:13,374 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:37:13,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:13,374 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:37:13,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:14,132 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-25 15:37:14,132 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:14,132 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:37:14,132 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:37:14,132 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:37:14,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:14,133 INFO 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-25 15:37:14,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:37:14,141 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:37:14,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:14,179 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 27 conjunts are in the unsatisfiable core [2019-02-25 15:37:14,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:37:14,189 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-25 15:37:14,189 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:37:15,805 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-25 15:37:15,826 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:37:15,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2019-02-25 15:37:15,826 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:37:15,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-02-25 15:37:15,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-02-25 15:37:15,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-02-25 15:37:15,828 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 28 states. [2019-02-25 15:37:15,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:37:15,936 INFO L93 Difference]: Finished difference Result 85 states and 88 transitions. [2019-02-25 15:37:15,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-02-25 15:37:15,936 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 54 [2019-02-25 15:37:15,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:37:15,937 INFO L225 Difference]: With dead ends: 85 [2019-02-25 15:37:15,937 INFO L226 Difference]: Without dead ends: 57 [2019-02-25 15:37:15,938 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-02-25 15:37:15,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-02-25 15:37:15,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-02-25 15:37:15,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-02-25 15:37:15,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2019-02-25 15:37:15,942 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 54 [2019-02-25 15:37:15,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:37:15,942 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2019-02-25 15:37:15,942 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-02-25 15:37:15,942 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2019-02-25 15:37:15,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-02-25 15:37:15,943 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:37:15,943 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1] [2019-02-25 15:37:15,943 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:37:15,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:37:15,943 INFO L82 PathProgramCache]: Analyzing trace with hash -2020931478, now seen corresponding path program 26 times [2019-02-25 15:37:15,944 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:37:15,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:15,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:37:15,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:15,945 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:37:15,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:16,462 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-25 15:37:16,462 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:16,462 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:37:16,462 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:37:16,462 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:37:16,462 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:16,462 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-25 15:37:16,472 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:37:16,472 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:37:16,573 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-02-25 15:37:16,574 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:37:16,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 28 conjunts are in the unsatisfiable core [2019-02-25 15:37:16,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:37:16,584 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-25 15:37:16,584 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:37:17,561 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-25 15:37:17,580 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:37:17,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2019-02-25 15:37:17,581 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:37:17,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-02-25 15:37:17,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-02-25 15:37:17,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-02-25 15:37:17,582 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 29 states. [2019-02-25 15:37:17,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:37:17,677 INFO L93 Difference]: Finished difference Result 88 states and 91 transitions. [2019-02-25 15:37:17,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-02-25 15:37:17,678 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 56 [2019-02-25 15:37:17,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:37:17,679 INFO L225 Difference]: With dead ends: 88 [2019-02-25 15:37:17,679 INFO L226 Difference]: Without dead ends: 59 [2019-02-25 15:37:17,681 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-02-25 15:37:17,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-02-25 15:37:17,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-02-25 15:37:17,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-02-25 15:37:17,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2019-02-25 15:37:17,683 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 56 [2019-02-25 15:37:17,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:37:17,684 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2019-02-25 15:37:17,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-02-25 15:37:17,684 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2019-02-25 15:37:17,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-02-25 15:37:17,684 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:37:17,684 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1] [2019-02-25 15:37:17,685 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:37:17,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:37:17,685 INFO L82 PathProgramCache]: Analyzing trace with hash -190119787, now seen corresponding path program 27 times [2019-02-25 15:37:17,685 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:37:17,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:17,686 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:37:17,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:17,686 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:37:17,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:18,326 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-25 15:37:18,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:18,326 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:37:18,326 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:37:18,326 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:37:18,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:18,327 INFO 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-25 15:37:18,335 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:37:18,335 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:37:18,376 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:37:18,376 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:37:18,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 29 conjunts are in the unsatisfiable core [2019-02-25 15:37:18,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:37:18,388 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-25 15:37:18,388 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:37:19,228 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-25 15:37:19,248 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:37:19,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2019-02-25 15:37:19,248 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:37:19,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-02-25 15:37:19,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-02-25 15:37:19,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-02-25 15:37:19,250 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 30 states. [2019-02-25 15:37:19,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:37:19,377 INFO L93 Difference]: Finished difference Result 91 states and 94 transitions. [2019-02-25 15:37:19,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-02-25 15:37:19,378 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 58 [2019-02-25 15:37:19,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:37:19,379 INFO L225 Difference]: With dead ends: 91 [2019-02-25 15:37:19,379 INFO L226 Difference]: Without dead ends: 61 [2019-02-25 15:37:19,379 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-02-25 15:37:19,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-02-25 15:37:19,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-02-25 15:37:19,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-02-25 15:37:19,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2019-02-25 15:37:19,382 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 58 [2019-02-25 15:37:19,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:37:19,382 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2019-02-25 15:37:19,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-02-25 15:37:19,382 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2019-02-25 15:37:19,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-02-25 15:37:19,383 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:37:19,383 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1] [2019-02-25 15:37:19,383 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:37:19,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:37:19,383 INFO L82 PathProgramCache]: Analyzing trace with hash -903903350, now seen corresponding path program 28 times [2019-02-25 15:37:19,384 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:37:19,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:19,384 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:37:19,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:19,385 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:37:19,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:19,775 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-25 15:37:19,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:19,776 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:37:19,776 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:37:19,776 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:37:19,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:19,776 INFO 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-25 15:37:19,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:37:19,788 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:37:19,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:19,840 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 30 conjunts are in the unsatisfiable core [2019-02-25 15:37:19,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:37:19,853 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-25 15:37:19,853 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:37:21,251 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-25 15:37:21,271 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:37:21,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 59 [2019-02-25 15:37:21,272 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:37:21,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-02-25 15:37:21,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-02-25 15:37:21,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-02-25 15:37:21,273 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 31 states. [2019-02-25 15:37:21,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:37:21,426 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2019-02-25 15:37:21,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-02-25 15:37:21,426 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 60 [2019-02-25 15:37:21,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:37:21,427 INFO L225 Difference]: With dead ends: 94 [2019-02-25 15:37:21,427 INFO L226 Difference]: Without dead ends: 63 [2019-02-25 15:37:21,428 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-02-25 15:37:21,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-02-25 15:37:21,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-02-25 15:37:21,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-02-25 15:37:21,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2019-02-25 15:37:21,431 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 60 [2019-02-25 15:37:21,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:37:21,431 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2019-02-25 15:37:21,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-02-25 15:37:21,431 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2019-02-25 15:37:21,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-02-25 15:37:21,432 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:37:21,432 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1] [2019-02-25 15:37:21,432 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:37:21,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:37:21,432 INFO L82 PathProgramCache]: Analyzing trace with hash -228988683, now seen corresponding path program 29 times [2019-02-25 15:37:21,432 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:37:21,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:21,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:37:21,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:21,433 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:37:21,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:21,862 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-25 15:37:21,862 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:21,862 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:37:21,863 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:37:21,863 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:37:21,863 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:21,863 INFO 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-25 15:37:21,872 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:37:21,872 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:37:22,031 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-02-25 15:37:22,032 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:37:22,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 31 conjunts are in the unsatisfiable core [2019-02-25 15:37:22,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:37:22,045 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-25 15:37:22,045 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:37:23,013 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-25 15:37:23,034 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:37:23,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2019-02-25 15:37:23,034 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:37:23,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-02-25 15:37:23,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-02-25 15:37:23,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-02-25 15:37:23,036 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 32 states. [2019-02-25 15:37:23,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:37:23,177 INFO L93 Difference]: Finished difference Result 97 states and 100 transitions. [2019-02-25 15:37:23,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-02-25 15:37:23,177 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 62 [2019-02-25 15:37:23,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:37:23,177 INFO L225 Difference]: With dead ends: 97 [2019-02-25 15:37:23,178 INFO L226 Difference]: Without dead ends: 65 [2019-02-25 15:37:23,179 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-02-25 15:37:23,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-02-25 15:37:23,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-02-25 15:37:23,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-02-25 15:37:23,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2019-02-25 15:37:23,182 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 62 [2019-02-25 15:37:23,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:37:23,182 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2019-02-25 15:37:23,182 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-02-25 15:37:23,182 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2019-02-25 15:37:23,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-02-25 15:37:23,183 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:37:23,183 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1] [2019-02-25 15:37:23,183 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:37:23,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:37:23,183 INFO L82 PathProgramCache]: Analyzing trace with hash -785494358, now seen corresponding path program 30 times [2019-02-25 15:37:23,183 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:37:23,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:23,184 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:37:23,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:23,184 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:37:23,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:23,826 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-25 15:37:23,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:23,826 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:37:23,827 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:37:23,827 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:37:23,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:23,827 INFO 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-25 15:37:23,837 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:37:23,837 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:37:23,880 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:37:23,880 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:37:23,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 32 conjunts are in the unsatisfiable core [2019-02-25 15:37:23,882 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:37:23,889 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-25 15:37:23,889 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:37:24,918 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-25 15:37:24,939 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:37:24,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2019-02-25 15:37:24,939 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:37:24,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-02-25 15:37:24,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-02-25 15:37:24,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-02-25 15:37:24,941 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 33 states. [2019-02-25 15:37:25,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:37:25,108 INFO L93 Difference]: Finished difference Result 100 states and 103 transitions. [2019-02-25 15:37:25,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-02-25 15:37:25,108 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 64 [2019-02-25 15:37:25,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:37:25,109 INFO L225 Difference]: With dead ends: 100 [2019-02-25 15:37:25,109 INFO L226 Difference]: Without dead ends: 67 [2019-02-25 15:37:25,110 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-02-25 15:37:25,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-02-25 15:37:25,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-02-25 15:37:25,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-02-25 15:37:25,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2019-02-25 15:37:25,114 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 64 [2019-02-25 15:37:25,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:37:25,114 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2019-02-25 15:37:25,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-02-25 15:37:25,114 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2019-02-25 15:37:25,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-02-25 15:37:25,114 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:37:25,115 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1] [2019-02-25 15:37:25,115 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:37:25,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:37:25,115 INFO L82 PathProgramCache]: Analyzing trace with hash -429274795, now seen corresponding path program 31 times [2019-02-25 15:37:25,115 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:37:25,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:25,116 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:37:25,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:25,116 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:37:25,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:25,645 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-25 15:37:25,645 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:25,645 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:37:25,645 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:37:25,645 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:37:25,646 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:25,646 INFO 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-25 15:37:25,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:37:25,654 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:37:25,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:25,704 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 33 conjunts are in the unsatisfiable core [2019-02-25 15:37:25,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:37:25,715 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-25 15:37:25,716 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:37:26,825 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-25 15:37:26,844 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:37:26,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2019-02-25 15:37:26,845 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:37:26,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-02-25 15:37:26,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-02-25 15:37:26,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-02-25 15:37:26,847 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 34 states. [2019-02-25 15:37:26,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:37:26,974 INFO L93 Difference]: Finished difference Result 103 states and 106 transitions. [2019-02-25 15:37:26,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-02-25 15:37:26,975 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 66 [2019-02-25 15:37:26,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:37:26,975 INFO L225 Difference]: With dead ends: 103 [2019-02-25 15:37:26,976 INFO L226 Difference]: Without dead ends: 69 [2019-02-25 15:37:26,977 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-02-25 15:37:26,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-02-25 15:37:26,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-02-25 15:37:26,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-02-25 15:37:26,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2019-02-25 15:37:26,980 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 66 [2019-02-25 15:37:26,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:37:26,980 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2019-02-25 15:37:26,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-02-25 15:37:26,980 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2019-02-25 15:37:26,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-02-25 15:37:26,981 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:37:26,981 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1, 1] [2019-02-25 15:37:26,981 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:37:26,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:37:26,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1040014794, now seen corresponding path program 32 times [2019-02-25 15:37:26,981 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:37:26,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:26,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:37:26,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:26,982 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:37:26,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:27,532 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-25 15:37:27,533 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:27,533 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:37:27,533 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:37:27,533 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:37:27,533 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:27,533 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-25 15:37:27,542 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:37:27,542 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:37:27,699 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-02-25 15:37:27,699 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:37:27,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 34 conjunts are in the unsatisfiable core [2019-02-25 15:37:27,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:37:27,712 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-25 15:37:27,712 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:37:29,186 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-25 15:37:29,206 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:37:29,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 67 [2019-02-25 15:37:29,206 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:37:29,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-02-25 15:37:29,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-02-25 15:37:29,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-02-25 15:37:29,208 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 35 states. [2019-02-25 15:37:29,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:37:29,353 INFO L93 Difference]: Finished difference Result 106 states and 109 transitions. [2019-02-25 15:37:29,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-02-25 15:37:29,354 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 68 [2019-02-25 15:37:29,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:37:29,354 INFO L225 Difference]: With dead ends: 106 [2019-02-25 15:37:29,355 INFO L226 Difference]: Without dead ends: 71 [2019-02-25 15:37:29,356 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-02-25 15:37:29,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-02-25 15:37:29,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-02-25 15:37:29,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-02-25 15:37:29,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2019-02-25 15:37:29,359 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 68 [2019-02-25 15:37:29,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:37:29,359 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2019-02-25 15:37:29,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-02-25 15:37:29,359 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2019-02-25 15:37:29,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-02-25 15:37:29,360 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:37:29,360 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1] [2019-02-25 15:37:29,360 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:37:29,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:37:29,360 INFO L82 PathProgramCache]: Analyzing trace with hash -986406475, now seen corresponding path program 33 times [2019-02-25 15:37:29,361 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:37:29,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:29,361 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:37:29,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:29,361 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:37:29,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:30,027 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-25 15:37:30,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:30,027 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:37:30,028 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:37:30,028 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:37:30,028 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:30,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 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-25 15:37:30,038 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:37:30,038 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:37:30,086 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:37:30,086 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:37:30,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 35 conjunts are in the unsatisfiable core [2019-02-25 15:37:30,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:37:30,099 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-25 15:37:30,100 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:37:31,468 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-25 15:37:31,486 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:37:31,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2019-02-25 15:37:31,487 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:37:31,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-02-25 15:37:31,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-02-25 15:37:31,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-02-25 15:37:31,488 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 36 states. [2019-02-25 15:37:31,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:37:31,652 INFO L93 Difference]: Finished difference Result 109 states and 112 transitions. [2019-02-25 15:37:31,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-02-25 15:37:31,652 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 70 [2019-02-25 15:37:31,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:37:31,653 INFO L225 Difference]: With dead ends: 109 [2019-02-25 15:37:31,653 INFO L226 Difference]: Without dead ends: 73 [2019-02-25 15:37:31,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-02-25 15:37:31,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-02-25 15:37:31,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-02-25 15:37:31,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-02-25 15:37:31,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2019-02-25 15:37:31,656 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 70 [2019-02-25 15:37:31,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:37:31,656 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2019-02-25 15:37:31,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-02-25 15:37:31,657 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2019-02-25 15:37:31,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-02-25 15:37:31,657 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:37:31,657 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1] [2019-02-25 15:37:31,658 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:37:31,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:37:31,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1548924138, now seen corresponding path program 34 times [2019-02-25 15:37:31,658 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:37:31,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:31,659 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:37:31,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:31,659 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:37:31,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:32,785 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-25 15:37:32,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:32,786 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:37:32,786 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:37:32,786 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:37:32,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:32,786 INFO 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-25 15:37:32,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:37:32,797 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:37:32,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:32,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 36 conjunts are in the unsatisfiable core [2019-02-25 15:37:32,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:37:32,857 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-25 15:37:32,857 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:37:34,371 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-25 15:37:34,389 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:37:34,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 71 [2019-02-25 15:37:34,390 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:37:34,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-02-25 15:37:34,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-02-25 15:37:34,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-02-25 15:37:34,391 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 37 states. [2019-02-25 15:37:34,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:37:34,639 INFO L93 Difference]: Finished difference Result 112 states and 115 transitions. [2019-02-25 15:37:34,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-02-25 15:37:34,640 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 72 [2019-02-25 15:37:34,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:37:34,640 INFO L225 Difference]: With dead ends: 112 [2019-02-25 15:37:34,641 INFO L226 Difference]: Without dead ends: 75 [2019-02-25 15:37:34,641 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-02-25 15:37:34,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-02-25 15:37:34,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-02-25 15:37:34,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-02-25 15:37:34,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2019-02-25 15:37:34,645 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 72 [2019-02-25 15:37:34,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:37:34,645 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2019-02-25 15:37:34,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-02-25 15:37:34,645 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2019-02-25 15:37:34,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-02-25 15:37:34,646 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:37:34,646 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 1, 1, 1, 1] [2019-02-25 15:37:34,646 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:37:34,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:37:34,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1198231019, now seen corresponding path program 35 times [2019-02-25 15:37:34,646 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:37:34,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:34,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:37:34,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:34,647 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:37:34,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:35,712 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-25 15:37:35,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:35,713 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:37:35,713 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:37:35,713 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:37:35,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:35,713 INFO 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-25 15:37:35,721 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:37:35,721 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:37:36,118 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2019-02-25 15:37:36,119 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:37:36,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 37 conjunts are in the unsatisfiable core [2019-02-25 15:37:36,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:37:36,133 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-25 15:37:36,133 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:37:37,560 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-25 15:37:37,580 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:37:37,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2019-02-25 15:37:37,581 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:37:37,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-02-25 15:37:37,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-02-25 15:37:37,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-02-25 15:37:37,582 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 38 states. [2019-02-25 15:37:37,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:37:37,708 INFO L93 Difference]: Finished difference Result 115 states and 118 transitions. [2019-02-25 15:37:37,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-02-25 15:37:37,709 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 74 [2019-02-25 15:37:37,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:37:37,710 INFO L225 Difference]: With dead ends: 115 [2019-02-25 15:37:37,710 INFO L226 Difference]: Without dead ends: 77 [2019-02-25 15:37:37,711 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-02-25 15:37:37,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-02-25 15:37:37,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-02-25 15:37:37,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-02-25 15:37:37,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2019-02-25 15:37:37,714 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 74 [2019-02-25 15:37:37,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:37:37,714 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2019-02-25 15:37:37,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-02-25 15:37:37,714 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2019-02-25 15:37:37,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-02-25 15:37:37,715 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:37:37,715 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 1, 1, 1, 1] [2019-02-25 15:37:37,715 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:37:37,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:37:37,715 INFO L82 PathProgramCache]: Analyzing trace with hash -2106305526, now seen corresponding path program 36 times [2019-02-25 15:37:37,715 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:37:37,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:37,716 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:37:37,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:37,716 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:37:37,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:38,332 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-25 15:37:38,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:38,333 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:37:38,333 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:37:38,333 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:37:38,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:38,333 INFO 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-25 15:37:38,343 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:37:38,343 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:37:38,414 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:37:38,415 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:37:38,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 38 conjunts are in the unsatisfiable core [2019-02-25 15:37:38,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:37:38,429 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-25 15:37:38,429 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:37:40,060 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-25 15:37:40,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:37:40,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 75 [2019-02-25 15:37:40,080 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:37:40,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-02-25 15:37:40,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-02-25 15:37:40,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-02-25 15:37:40,081 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 39 states. [2019-02-25 15:37:40,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:37:40,226 INFO L93 Difference]: Finished difference Result 118 states and 121 transitions. [2019-02-25 15:37:40,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-02-25 15:37:40,226 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 76 [2019-02-25 15:37:40,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:37:40,227 INFO L225 Difference]: With dead ends: 118 [2019-02-25 15:37:40,227 INFO L226 Difference]: Without dead ends: 79 [2019-02-25 15:37:40,228 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-02-25 15:37:40,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-02-25 15:37:40,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-02-25 15:37:40,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-02-25 15:37:40,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2019-02-25 15:37:40,231 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 76 [2019-02-25 15:37:40,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:37:40,231 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2019-02-25 15:37:40,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-02-25 15:37:40,232 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2019-02-25 15:37:40,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-02-25 15:37:40,232 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:37:40,232 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 1, 1, 1, 1] [2019-02-25 15:37:40,232 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:37:40,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:37:40,233 INFO L82 PathProgramCache]: Analyzing trace with hash -1075627403, now seen corresponding path program 37 times [2019-02-25 15:37:40,233 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:37:40,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:40,234 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:37:40,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:40,234 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:37:40,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:40,907 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-25 15:37:40,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:40,908 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:37:40,908 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:37:40,908 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:37:40,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:40,908 INFO 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-25 15:37:40,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:37:40,917 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:37:40,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:40,974 INFO L256 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 39 conjunts are in the unsatisfiable core [2019-02-25 15:37:40,975 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:37:40,988 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-25 15:37:40,988 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:37:42,506 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-25 15:37:42,525 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:37:42,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 77 [2019-02-25 15:37:42,525 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:37:42,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-02-25 15:37:42,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-02-25 15:37:42,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-02-25 15:37:42,527 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 40 states. [2019-02-25 15:37:42,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:37:42,670 INFO L93 Difference]: Finished difference Result 121 states and 124 transitions. [2019-02-25 15:37:42,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-02-25 15:37:42,671 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 78 [2019-02-25 15:37:42,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:37:42,672 INFO L225 Difference]: With dead ends: 121 [2019-02-25 15:37:42,672 INFO L226 Difference]: Without dead ends: 81 [2019-02-25 15:37:42,673 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-02-25 15:37:42,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-02-25 15:37:42,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-02-25 15:37:42,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-02-25 15:37:42,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2019-02-25 15:37:42,676 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 78 [2019-02-25 15:37:42,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:37:42,676 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2019-02-25 15:37:42,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-02-25 15:37:42,676 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2019-02-25 15:37:42,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-02-25 15:37:42,676 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:37:42,676 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 1, 1, 1, 1] [2019-02-25 15:37:42,677 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:37:42,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:37:42,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1898461994, now seen corresponding path program 38 times [2019-02-25 15:37:42,677 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:37:42,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:42,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:37:42,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:42,678 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:37:42,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:43,396 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-25 15:37:43,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:43,396 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:37:43,396 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:37:43,396 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:37:43,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:43,397 INFO 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-25 15:37:43,406 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:37:43,406 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:37:43,781 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-02-25 15:37:43,782 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:37:43,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 40 conjunts are in the unsatisfiable core [2019-02-25 15:37:43,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:37:43,799 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-25 15:37:43,799 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:37:45,700 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-25 15:37:45,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:37:45,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 79 [2019-02-25 15:37:45,721 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:37:45,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-02-25 15:37:45,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-02-25 15:37:45,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-02-25 15:37:45,722 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 41 states. [2019-02-25 15:37:45,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:37:45,874 INFO L93 Difference]: Finished difference Result 124 states and 127 transitions. [2019-02-25 15:37:45,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-02-25 15:37:45,875 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 80 [2019-02-25 15:37:45,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:37:45,875 INFO L225 Difference]: With dead ends: 124 [2019-02-25 15:37:45,876 INFO L226 Difference]: Without dead ends: 83 [2019-02-25 15:37:45,876 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-02-25 15:37:45,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-02-25 15:37:45,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-02-25 15:37:45,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-02-25 15:37:45,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2019-02-25 15:37:45,879 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 80 [2019-02-25 15:37:45,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:37:45,880 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2019-02-25 15:37:45,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-02-25 15:37:45,880 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2019-02-25 15:37:45,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-02-25 15:37:45,880 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:37:45,881 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 1, 1, 1, 1] [2019-02-25 15:37:45,881 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:37:45,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:37:45,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1341848277, now seen corresponding path program 39 times [2019-02-25 15:37:45,881 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:37:45,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:45,882 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:37:45,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:45,882 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:37:45,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:46,678 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-25 15:37:46,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:46,678 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:37:46,678 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:37:46,679 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:37:46,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:46,679 INFO 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-25 15:37:46,687 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:37:46,687 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:37:46,765 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:37:46,765 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:37:46,767 INFO L256 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 41 conjunts are in the unsatisfiable core [2019-02-25 15:37:46,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:37:46,779 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-25 15:37:46,779 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:37:48,479 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-25 15:37:48,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:37:48,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 81 [2019-02-25 15:37:48,498 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:37:48,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-02-25 15:37:48,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-02-25 15:37:48,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-02-25 15:37:48,499 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand 42 states. [2019-02-25 15:37:48,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:37:48,643 INFO L93 Difference]: Finished difference Result 127 states and 130 transitions. [2019-02-25 15:37:48,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-02-25 15:37:48,644 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 82 [2019-02-25 15:37:48,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:37:48,645 INFO L225 Difference]: With dead ends: 127 [2019-02-25 15:37:48,645 INFO L226 Difference]: Without dead ends: 85 [2019-02-25 15:37:48,646 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-02-25 15:37:48,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-02-25 15:37:48,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-02-25 15:37:48,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-02-25 15:37:48,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2019-02-25 15:37:48,648 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 82 [2019-02-25 15:37:48,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:37:48,648 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2019-02-25 15:37:48,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-02-25 15:37:48,649 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2019-02-25 15:37:48,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-02-25 15:37:48,649 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:37:48,649 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 1, 1, 1, 1] [2019-02-25 15:37:48,649 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:37:48,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:37:48,649 INFO L82 PathProgramCache]: Analyzing trace with hash -1280021942, now seen corresponding path program 40 times [2019-02-25 15:37:48,650 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:37:48,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:48,650 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:37:48,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:48,650 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:37:48,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:49,628 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-25 15:37:49,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:49,628 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:37:49,629 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:37:49,629 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:37:49,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:49,629 INFO 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-25 15:37:49,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:37:49,640 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:37:49,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:49,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 42 conjunts are in the unsatisfiable core [2019-02-25 15:37:49,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:37:49,710 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-25 15:37:49,710 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:37:51,565 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-25 15:37:51,584 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:37:51,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 83 [2019-02-25 15:37:51,584 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:37:51,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-02-25 15:37:51,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-02-25 15:37:51,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-02-25 15:37:51,585 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 43 states. [2019-02-25 15:37:51,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:37:51,738 INFO L93 Difference]: Finished difference Result 130 states and 133 transitions. [2019-02-25 15:37:51,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-02-25 15:37:51,738 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 84 [2019-02-25 15:37:51,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:37:51,739 INFO L225 Difference]: With dead ends: 130 [2019-02-25 15:37:51,739 INFO L226 Difference]: Without dead ends: 87 [2019-02-25 15:37:51,740 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-02-25 15:37:51,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-02-25 15:37:51,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-02-25 15:37:51,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-02-25 15:37:51,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2019-02-25 15:37:51,742 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 84 [2019-02-25 15:37:51,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:37:51,743 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2019-02-25 15:37:51,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-02-25 15:37:51,743 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2019-02-25 15:37:51,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-02-25 15:37:51,743 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:37:51,744 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 1, 1, 1, 1] [2019-02-25 15:37:51,744 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:37:51,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:37:51,744 INFO L82 PathProgramCache]: Analyzing trace with hash -214584523, now seen corresponding path program 41 times [2019-02-25 15:37:51,744 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:37:51,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:51,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:37:51,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:51,745 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:37:51,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:52,762 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-25 15:37:52,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:52,763 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:37:52,763 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:37:52,763 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:37:52,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:52,763 INFO 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-25 15:37:52,772 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:37:52,772 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:37:53,090 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-02-25 15:37:53,090 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:37:53,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 43 conjunts are in the unsatisfiable core [2019-02-25 15:37:53,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:37:53,109 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-25 15:37:53,109 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:37:55,154 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-25 15:37:55,175 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:37:55,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 85 [2019-02-25 15:37:55,175 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:37:55,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-02-25 15:37:55,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-02-25 15:37:55,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-02-25 15:37:55,177 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 44 states. [2019-02-25 15:37:55,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:37:55,342 INFO L93 Difference]: Finished difference Result 133 states and 136 transitions. [2019-02-25 15:37:55,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-02-25 15:37:55,342 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 86 [2019-02-25 15:37:55,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:37:55,343 INFO L225 Difference]: With dead ends: 133 [2019-02-25 15:37:55,343 INFO L226 Difference]: Without dead ends: 89 [2019-02-25 15:37:55,344 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-02-25 15:37:55,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-02-25 15:37:55,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-02-25 15:37:55,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-02-25 15:37:55,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2019-02-25 15:37:55,346 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 86 [2019-02-25 15:37:55,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:37:55,346 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2019-02-25 15:37:55,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-02-25 15:37:55,347 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2019-02-25 15:37:55,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-02-25 15:37:55,347 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:37:55,347 INFO L402 BasicCegarLoop]: trace histogram [42, 42, 1, 1, 1, 1] [2019-02-25 15:37:55,348 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:37:55,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:37:55,348 INFO L82 PathProgramCache]: Analyzing trace with hash -2170518, now seen corresponding path program 42 times [2019-02-25 15:37:55,348 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:37:55,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:55,349 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:37:55,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:55,349 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:37:55,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:56,224 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-25 15:37:56,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:56,224 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:37:56,225 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:37:56,225 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:37:56,225 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:56,225 INFO 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-25 15:37:56,234 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:37:56,234 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:37:56,290 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:37:56,291 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:37:56,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 44 conjunts are in the unsatisfiable core [2019-02-25 15:37:56,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:37:56,307 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-25 15:37:56,307 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:37:58,536 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-25 15:37:58,554 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:37:58,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 87 [2019-02-25 15:37:58,555 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:37:58,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-02-25 15:37:58,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-02-25 15:37:58,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-02-25 15:37:58,556 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand 45 states. [2019-02-25 15:37:58,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:37:58,729 INFO L93 Difference]: Finished difference Result 136 states and 139 transitions. [2019-02-25 15:37:58,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-02-25 15:37:58,729 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 88 [2019-02-25 15:37:58,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:37:58,730 INFO L225 Difference]: With dead ends: 136 [2019-02-25 15:37:58,730 INFO L226 Difference]: Without dead ends: 91 [2019-02-25 15:37:58,731 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-02-25 15:37:58,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-02-25 15:37:58,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-02-25 15:37:58,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-02-25 15:37:58,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2019-02-25 15:37:58,734 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 88 [2019-02-25 15:37:58,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:37:58,734 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2019-02-25 15:37:58,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-02-25 15:37:58,734 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2019-02-25 15:37:58,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-02-25 15:37:58,735 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:37:58,735 INFO L402 BasicCegarLoop]: trace histogram [43, 43, 1, 1, 1, 1] [2019-02-25 15:37:58,735 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:37:58,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:37:58,736 INFO L82 PathProgramCache]: Analyzing trace with hash -378707051, now seen corresponding path program 43 times [2019-02-25 15:37:58,736 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:37:58,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:58,736 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:37:58,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:58,737 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:37:58,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:38:04,964 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-25 15:38:04,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:04,964 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:38:04,964 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:38:04,965 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:38:04,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:04,965 INFO 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-25 15:38:04,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:38:04,975 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:38:05,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:38:05,036 INFO L256 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 45 conjunts are in the unsatisfiable core [2019-02-25 15:38:05,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:38:05,050 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-25 15:38:05,050 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:38:07,082 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-25 15:38:07,112 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:38:07,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 89 [2019-02-25 15:38:07,112 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:38:07,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-02-25 15:38:07,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-02-25 15:38:07,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-02-25 15:38:07,114 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand 46 states. [2019-02-25 15:38:07,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:38:07,438 INFO L93 Difference]: Finished difference Result 139 states and 142 transitions. [2019-02-25 15:38:07,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-02-25 15:38:07,438 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 90 [2019-02-25 15:38:07,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:38:07,439 INFO L225 Difference]: With dead ends: 139 [2019-02-25 15:38:07,439 INFO L226 Difference]: Without dead ends: 93 [2019-02-25 15:38:07,440 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-02-25 15:38:07,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-02-25 15:38:07,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-02-25 15:38:07,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-02-25 15:38:07,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2019-02-25 15:38:07,442 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 90 [2019-02-25 15:38:07,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:38:07,442 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2019-02-25 15:38:07,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-02-25 15:38:07,442 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2019-02-25 15:38:07,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-02-25 15:38:07,443 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:38:07,443 INFO L402 BasicCegarLoop]: trace histogram [44, 44, 1, 1, 1, 1] [2019-02-25 15:38:07,443 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:38:07,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:38:07,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1779588982, now seen corresponding path program 44 times [2019-02-25 15:38:07,443 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:38:07,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:07,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:38:07,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:07,444 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:38:07,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:38:08,303 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-25 15:38:08,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:08,303 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:38:08,303 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:38:08,303 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:38:08,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:08,304 INFO 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-25 15:38:08,312 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:38:08,313 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:38:08,669 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2019-02-25 15:38:08,669 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:38:08,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 46 conjunts are in the unsatisfiable core [2019-02-25 15:38:08,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:38:08,689 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-25 15:38:08,689 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:38:11,144 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-25 15:38:11,167 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:38:11,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 91 [2019-02-25 15:38:11,167 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:38:11,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-02-25 15:38:11,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-02-25 15:38:11,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-02-25 15:38:11,169 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand 47 states. [2019-02-25 15:38:12,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:38:12,541 INFO L93 Difference]: Finished difference Result 142 states and 145 transitions. [2019-02-25 15:38:12,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-02-25 15:38:12,541 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 92 [2019-02-25 15:38:12,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:38:12,542 INFO L225 Difference]: With dead ends: 142 [2019-02-25 15:38:12,542 INFO L226 Difference]: Without dead ends: 95 [2019-02-25 15:38:12,543 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-02-25 15:38:12,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-02-25 15:38:12,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-02-25 15:38:12,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-02-25 15:38:12,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2019-02-25 15:38:12,547 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 92 [2019-02-25 15:38:12,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:38:12,547 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2019-02-25 15:38:12,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-02-25 15:38:12,547 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2019-02-25 15:38:12,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-02-25 15:38:12,548 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:38:12,548 INFO L402 BasicCegarLoop]: trace histogram [45, 45, 1, 1, 1, 1] [2019-02-25 15:38:12,548 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:38:12,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:38:12,548 INFO L82 PathProgramCache]: Analyzing trace with hash -939783179, now seen corresponding path program 45 times [2019-02-25 15:38:12,548 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:38:12,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:12,549 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:38:12,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:12,550 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:38:12,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:38:13,477 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-25 15:38:13,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:13,477 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:38:13,477 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:38:13,478 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:38:13,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:13,478 INFO 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-25 15:38:13,487 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:38:13,487 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:38:13,550 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:38:13,550 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:38:13,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 47 conjunts are in the unsatisfiable core [2019-02-25 15:38:13,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:38:13,571 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-25 15:38:13,571 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:38:16,700 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-25 15:38:16,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:38:16,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 93 [2019-02-25 15:38:16,719 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:38:16,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-02-25 15:38:16,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-02-25 15:38:16,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-02-25 15:38:16,720 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand 48 states. [2019-02-25 15:38:17,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:38:17,003 INFO L93 Difference]: Finished difference Result 145 states and 148 transitions. [2019-02-25 15:38:17,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-02-25 15:38:17,004 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 94 [2019-02-25 15:38:17,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:38:17,004 INFO L225 Difference]: With dead ends: 145 [2019-02-25 15:38:17,004 INFO L226 Difference]: Without dead ends: 97 [2019-02-25 15:38:17,005 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-02-25 15:38:17,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-02-25 15:38:17,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-02-25 15:38:17,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-02-25 15:38:17,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2019-02-25 15:38:17,009 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 94 [2019-02-25 15:38:17,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:38:17,009 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2019-02-25 15:38:17,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-02-25 15:38:17,009 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2019-02-25 15:38:17,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-02-25 15:38:17,010 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:38:17,010 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1] [2019-02-25 15:38:17,010 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:38:17,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:38:17,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1599690838, now seen corresponding path program 46 times [2019-02-25 15:38:17,011 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:38:17,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:17,011 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:38:17,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:17,012 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:38:17,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:38:18,126 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-25 15:38:18,126 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:18,126 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:38:18,127 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:38:18,127 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:38:18,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:18,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 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-25 15:38:18,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:38:18,136 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:38:18,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:38:18,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 48 conjunts are in the unsatisfiable core [2019-02-25 15:38:18,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:38:18,213 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-25 15:38:18,214 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:38:21,045 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-25 15:38:21,064 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:38:21,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2019-02-25 15:38:21,064 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:38:21,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-02-25 15:38:21,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-02-25 15:38:21,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-02-25 15:38:21,066 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 49 states. [2019-02-25 15:38:21,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:38:21,234 INFO L93 Difference]: Finished difference Result 148 states and 151 transitions. [2019-02-25 15:38:21,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-02-25 15:38:21,235 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 96 [2019-02-25 15:38:21,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:38:21,236 INFO L225 Difference]: With dead ends: 148 [2019-02-25 15:38:21,236 INFO L226 Difference]: Without dead ends: 99 [2019-02-25 15:38:21,237 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-02-25 15:38:21,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-02-25 15:38:21,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-02-25 15:38:21,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-02-25 15:38:21,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2019-02-25 15:38:21,240 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 96 [2019-02-25 15:38:21,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:38:21,240 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2019-02-25 15:38:21,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-02-25 15:38:21,241 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2019-02-25 15:38:21,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-02-25 15:38:21,241 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:38:21,241 INFO L402 BasicCegarLoop]: trace histogram [47, 47, 1, 1, 1, 1] [2019-02-25 15:38:21,241 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:38:21,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:38:21,242 INFO L82 PathProgramCache]: Analyzing trace with hash 431729749, now seen corresponding path program 47 times [2019-02-25 15:38:21,242 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:38:21,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:21,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:38:21,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:21,243 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:38:21,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:38:22,837 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-25 15:38:22,837 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:22,837 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:38:22,837 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:38:22,837 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:38:22,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:22,838 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-25 15:38:22,846 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:38:22,846 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:38:23,329 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2019-02-25 15:38:23,329 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:38:23,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 49 conjunts are in the unsatisfiable core [2019-02-25 15:38:23,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:38:23,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-25 15:38:23,351 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:38:25,975 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-25 15:38:25,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:38:25,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2019-02-25 15:38:25,996 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:38:25,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-02-25 15:38:25,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-02-25 15:38:25,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-02-25 15:38:25,999 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 50 states. [2019-02-25 15:38:26,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:38:26,184 INFO L93 Difference]: Finished difference Result 151 states and 154 transitions. [2019-02-25 15:38:26,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-02-25 15:38:26,184 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 98 [2019-02-25 15:38:26,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:38:26,185 INFO L225 Difference]: With dead ends: 151 [2019-02-25 15:38:26,185 INFO L226 Difference]: Without dead ends: 101 [2019-02-25 15:38:26,186 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-02-25 15:38:26,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-02-25 15:38:26,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-02-25 15:38:26,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-02-25 15:38:26,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 102 transitions. [2019-02-25 15:38:26,194 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 102 transitions. Word has length 98 [2019-02-25 15:38:26,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:38:26,194 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 102 transitions. [2019-02-25 15:38:26,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-02-25 15:38:26,195 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 102 transitions. [2019-02-25 15:38:26,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-02-25 15:38:26,195 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:38:26,195 INFO L402 BasicCegarLoop]: trace histogram [48, 48, 1, 1, 1, 1] [2019-02-25 15:38:26,196 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:38:26,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:38:26,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1789921590, now seen corresponding path program 48 times [2019-02-25 15:38:26,196 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:38:26,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:26,197 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:38:26,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:26,197 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:38:26,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:38:27,198 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-25 15:38:27,198 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:27,198 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:38:27,198 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:38:27,198 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:38:27,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:27,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 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-25 15:38:27,210 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:38:27,210 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:38:27,281 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:38:27,281 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:38:27,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 50 conjunts are in the unsatisfiable core [2019-02-25 15:38:27,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:38:27,296 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-25 15:38:27,297 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:38:30,017 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-25 15:38:30,035 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:38:30,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 99 [2019-02-25 15:38:30,036 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:38:30,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-02-25 15:38:30,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-02-25 15:38:30,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-02-25 15:38:30,037 INFO L87 Difference]: Start difference. First operand 101 states and 102 transitions. Second operand 51 states. [2019-02-25 15:38:30,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:38:30,321 INFO L93 Difference]: Finished difference Result 154 states and 157 transitions. [2019-02-25 15:38:30,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-02-25 15:38:30,321 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 100 [2019-02-25 15:38:30,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:38:30,322 INFO L225 Difference]: With dead ends: 154 [2019-02-25 15:38:30,322 INFO L226 Difference]: Without dead ends: 103 [2019-02-25 15:38:30,323 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-25 15:38:30,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-02-25 15:38:30,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-02-25 15:38:30,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-02-25 15:38:30,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2019-02-25 15:38:30,326 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 100 [2019-02-25 15:38:30,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:38:30,326 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2019-02-25 15:38:30,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-02-25 15:38:30,326 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2019-02-25 15:38:30,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-02-25 15:38:30,327 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:38:30,327 INFO L402 BasicCegarLoop]: trace histogram [49, 49, 1, 1, 1, 1] [2019-02-25 15:38:30,327 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:38:30,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:38:30,327 INFO L82 PathProgramCache]: Analyzing trace with hash -16366411, now seen corresponding path program 49 times [2019-02-25 15:38:30,327 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:38:30,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:30,328 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:38:30,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:30,328 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:38:30,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:38:31,375 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-25 15:38:31,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:31,376 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:38:31,376 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:38:31,376 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:38:31,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:31,376 INFO 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-25 15:38:31,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:38:31,384 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:38:31,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:38:31,452 INFO L256 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 51 conjunts are in the unsatisfiable core [2019-02-25 15:38:31,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:38:31,464 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-25 15:38:31,464 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:38:34,036 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-25 15:38:34,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:38:34,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 101 [2019-02-25 15:38:34,055 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:38:34,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-02-25 15:38:34,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-02-25 15:38:34,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-02-25 15:38:34,057 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 52 states. [2019-02-25 15:38:34,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:38:34,305 INFO L93 Difference]: Finished difference Result 157 states and 160 transitions. [2019-02-25 15:38:34,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-02-25 15:38:34,305 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 102 [2019-02-25 15:38:34,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:38:34,306 INFO L225 Difference]: With dead ends: 157 [2019-02-25 15:38:34,306 INFO L226 Difference]: Without dead ends: 105 [2019-02-25 15:38:34,307 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-02-25 15:38:34,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-02-25 15:38:34,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-02-25 15:38:34,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-02-25 15:38:34,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2019-02-25 15:38:34,310 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 102 [2019-02-25 15:38:34,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:38:34,310 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2019-02-25 15:38:34,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-02-25 15:38:34,310 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2019-02-25 15:38:34,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-02-25 15:38:34,311 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:38:34,311 INFO L402 BasicCegarLoop]: trace histogram [50, 50, 1, 1, 1, 1] [2019-02-25 15:38:34,311 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:38:34,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:38:34,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1817211414, now seen corresponding path program 50 times [2019-02-25 15:38:34,311 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:38:34,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:34,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:38:34,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:34,312 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:38:34,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:38:35,867 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-25 15:38:35,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:35,867 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:38:35,867 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:38:35,867 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:38:35,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:35,867 INFO 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-25 15:38:35,877 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:38:35,877 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:38:37,034 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2019-02-25 15:38:37,034 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:38:37,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 52 conjunts are in the unsatisfiable core [2019-02-25 15:38:37,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:38:37,061 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-25 15:38:37,061 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:38:39,818 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-25 15:38:39,840 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:38:39,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 103 [2019-02-25 15:38:39,840 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:38:39,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-02-25 15:38:39,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-02-25 15:38:39,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-02-25 15:38:39,842 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand 53 states. [2019-02-25 15:38:40,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:38:40,682 INFO L93 Difference]: Finished difference Result 160 states and 163 transitions. [2019-02-25 15:38:40,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-02-25 15:38:40,683 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 104 [2019-02-25 15:38:40,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:38:40,683 INFO L225 Difference]: With dead ends: 160 [2019-02-25 15:38:40,684 INFO L226 Difference]: Without dead ends: 107 [2019-02-25 15:38:40,684 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-25 15:38:40,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-02-25 15:38:40,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-02-25 15:38:40,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-02-25 15:38:40,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2019-02-25 15:38:40,688 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 104 [2019-02-25 15:38:40,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:38:40,688 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2019-02-25 15:38:40,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-02-25 15:38:40,688 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2019-02-25 15:38:40,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-02-25 15:38:40,689 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:38:40,689 INFO L402 BasicCegarLoop]: trace histogram [51, 51, 1, 1, 1, 1] [2019-02-25 15:38:40,689 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:38:40,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:38:40,690 INFO L82 PathProgramCache]: Analyzing trace with hash -843721451, now seen corresponding path program 51 times [2019-02-25 15:38:40,690 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:38:40,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:40,690 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:38:40,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:40,691 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:38:40,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:38:41,905 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-25 15:38:41,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:41,906 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:38:41,906 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:38:41,906 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:38:41,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:41,906 INFO 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-25 15:38:41,917 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:38:41,918 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:38:41,988 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:38:41,988 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:38:41,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 53 conjunts are in the unsatisfiable core [2019-02-25 15:38:41,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:38:42,006 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-25 15:38:42,006 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:38:44,784 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-25 15:38:44,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:38:44,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 105 [2019-02-25 15:38:44,805 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:38:44,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-02-25 15:38:44,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-02-25 15:38:44,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-02-25 15:38:44,807 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand 54 states. [2019-02-25 15:38:45,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:38:45,057 INFO L93 Difference]: Finished difference Result 163 states and 166 transitions. [2019-02-25 15:38:45,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-02-25 15:38:45,058 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 106 [2019-02-25 15:38:45,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:38:45,058 INFO L225 Difference]: With dead ends: 163 [2019-02-25 15:38:45,058 INFO L226 Difference]: Without dead ends: 109 [2019-02-25 15:38:45,059 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-02-25 15:38:45,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-02-25 15:38:45,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-02-25 15:38:45,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-02-25 15:38:45,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2019-02-25 15:38:45,063 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 106 [2019-02-25 15:38:45,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:38:45,063 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2019-02-25 15:38:45,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-02-25 15:38:45,064 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2019-02-25 15:38:45,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-02-25 15:38:45,064 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:38:45,064 INFO L402 BasicCegarLoop]: trace histogram [52, 52, 1, 1, 1, 1] [2019-02-25 15:38:45,065 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:38:45,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:38:45,065 INFO L82 PathProgramCache]: Analyzing trace with hash -972329718, now seen corresponding path program 52 times [2019-02-25 15:38:45,065 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:38:45,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:45,066 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:38:45,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:45,066 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:38:45,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:38:46,440 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-25 15:38:46,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:46,440 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:38:46,440 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:38:46,440 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:38:46,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:46,441 INFO 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-25 15:38:46,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:38:46,450 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:38:46,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:38:46,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 54 conjunts are in the unsatisfiable core [2019-02-25 15:38:46,530 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:38:46,551 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-25 15:38:46,551 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:38:49,557 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-25 15:38:49,576 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:38:49,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 107 [2019-02-25 15:38:49,576 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:38:49,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-02-25 15:38:49,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-02-25 15:38:49,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-02-25 15:38:49,578 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand 55 states. [2019-02-25 15:38:49,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:38:49,817 INFO L93 Difference]: Finished difference Result 166 states and 169 transitions. [2019-02-25 15:38:49,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-02-25 15:38:49,818 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 108 [2019-02-25 15:38:49,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:38:49,818 INFO L225 Difference]: With dead ends: 166 [2019-02-25 15:38:49,819 INFO L226 Difference]: Without dead ends: 111 [2019-02-25 15:38:49,819 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-02-25 15:38:49,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-02-25 15:38:49,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-02-25 15:38:49,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-02-25 15:38:49,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2019-02-25 15:38:49,822 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 108 [2019-02-25 15:38:49,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:38:49,823 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2019-02-25 15:38:49,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-02-25 15:38:49,823 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2019-02-25 15:38:49,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-02-25 15:38:49,823 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:38:49,823 INFO L402 BasicCegarLoop]: trace histogram [53, 53, 1, 1, 1, 1] [2019-02-25 15:38:49,823 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:38:49,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:38:49,824 INFO L82 PathProgramCache]: Analyzing trace with hash -1323016843, now seen corresponding path program 53 times [2019-02-25 15:38:49,824 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:38:49,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:49,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:38:49,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:49,825 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:38:49,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:38:51,201 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-25 15:38:51,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:51,201 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:38:51,201 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:38:51,201 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:38:51,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:51,202 INFO 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-25 15:38:51,211 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:38:51,211 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:38:52,357 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2019-02-25 15:38:52,357 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:38:52,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 545 conjuncts, 55 conjunts are in the unsatisfiable core [2019-02-25 15:38:52,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:38:52,387 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-25 15:38:52,387 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:38:55,479 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-25 15:38:55,500 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:38:55,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 109 [2019-02-25 15:38:55,500 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:38:55,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-02-25 15:38:55,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-02-25 15:38:55,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-02-25 15:38:55,502 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand 56 states. [2019-02-25 15:38:55,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:38:55,835 INFO L93 Difference]: Finished difference Result 169 states and 172 transitions. [2019-02-25 15:38:55,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-02-25 15:38:55,835 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 110 [2019-02-25 15:38:55,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:38:55,835 INFO L225 Difference]: With dead ends: 169 [2019-02-25 15:38:55,836 INFO L226 Difference]: Without dead ends: 113 [2019-02-25 15:38:55,836 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-02-25 15:38:55,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-02-25 15:38:55,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-02-25 15:38:55,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-02-25 15:38:55,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 114 transitions. [2019-02-25 15:38:55,838 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 114 transitions. Word has length 110 [2019-02-25 15:38:55,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:38:55,839 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 114 transitions. [2019-02-25 15:38:55,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-02-25 15:38:55,839 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 114 transitions. [2019-02-25 15:38:55,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-02-25 15:38:55,839 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:38:55,839 INFO L402 BasicCegarLoop]: trace histogram [54, 54, 1, 1, 1, 1] [2019-02-25 15:38:55,839 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:38:55,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:38:55,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1054239702, now seen corresponding path program 54 times [2019-02-25 15:38:55,840 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:38:55,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:55,840 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:38:55,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:55,841 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:38:55,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:38:57,059 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-25 15:38:57,059 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:57,060 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:38:57,060 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:38:57,060 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:38:57,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:57,060 INFO 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-25 15:38:57,069 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:38:57,069 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:38:57,141 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:38:57,141 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:38:57,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 555 conjuncts, 56 conjunts are in the unsatisfiable core [2019-02-25 15:38:57,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:38:57,157 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-25 15:38:57,157 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:39:00,209 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-25 15:39:00,229 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:39:00,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 111 [2019-02-25 15:39:00,229 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:39:00,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-02-25 15:39:00,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-02-25 15:39:00,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-02-25 15:39:00,231 INFO L87 Difference]: Start difference. First operand 113 states and 114 transitions. Second operand 57 states. [2019-02-25 15:39:00,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:39:00,483 INFO L93 Difference]: Finished difference Result 172 states and 175 transitions. [2019-02-25 15:39:00,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-02-25 15:39:00,483 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 112 [2019-02-25 15:39:00,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:39:00,484 INFO L225 Difference]: With dead ends: 172 [2019-02-25 15:39:00,484 INFO L226 Difference]: Without dead ends: 115 [2019-02-25 15:39:00,486 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-02-25 15:39:00,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-02-25 15:39:00,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2019-02-25 15:39:00,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-02-25 15:39:00,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 116 transitions. [2019-02-25 15:39:00,489 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 116 transitions. Word has length 112 [2019-02-25 15:39:00,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:39:00,489 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 116 transitions. [2019-02-25 15:39:00,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-02-25 15:39:00,489 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 116 transitions. [2019-02-25 15:39:00,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-02-25 15:39:00,490 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:39:00,490 INFO L402 BasicCegarLoop]: trace histogram [55, 55, 1, 1, 1, 1] [2019-02-25 15:39:00,490 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:39:00,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:39:00,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1244388821, now seen corresponding path program 55 times [2019-02-25 15:39:00,491 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:39:00,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:39:00,491 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:39:00,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:39:00,492 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:39:00,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:39:01,828 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-25 15:39:01,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:39:01,829 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:39:01,829 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:39:01,829 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:39:01,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:39:01,829 INFO 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-25 15:39:01,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:39:01,838 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:39:01,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:39:01,917 INFO L256 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 57 conjunts are in the unsatisfiable core [2019-02-25 15:39:01,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:39:01,939 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-25 15:39:01,940 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:39:05,501 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-25 15:39:05,523 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:39:05,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 113 [2019-02-25 15:39:05,523 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:39:05,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-02-25 15:39:05,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-02-25 15:39:05,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-02-25 15:39:05,525 INFO L87 Difference]: Start difference. First operand 115 states and 116 transitions. Second operand 58 states. [2019-02-25 15:39:05,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:39:05,939 INFO L93 Difference]: Finished difference Result 175 states and 178 transitions. [2019-02-25 15:39:05,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-02-25 15:39:05,940 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 114 [2019-02-25 15:39:05,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:39:05,940 INFO L225 Difference]: With dead ends: 175 [2019-02-25 15:39:05,940 INFO L226 Difference]: Without dead ends: 117 [2019-02-25 15:39:05,941 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-02-25 15:39:05,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-02-25 15:39:05,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2019-02-25 15:39:05,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-02-25 15:39:05,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 118 transitions. [2019-02-25 15:39:05,944 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 118 transitions. Word has length 114 [2019-02-25 15:39:05,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:39:05,945 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 118 transitions. [2019-02-25 15:39:05,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-02-25 15:39:05,945 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 118 transitions. [2019-02-25 15:39:05,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-02-25 15:39:05,945 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:39:05,946 INFO L402 BasicCegarLoop]: trace histogram [56, 56, 1, 1, 1, 1] [2019-02-25 15:39:05,946 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:39:05,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:39:05,946 INFO L82 PathProgramCache]: Analyzing trace with hash -464518326, now seen corresponding path program 56 times [2019-02-25 15:39:05,946 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:39:05,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:39:05,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:39:05,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:39:05,947 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:39:05,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:39:07,184 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-25 15:39:07,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:39:07,184 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:39:07,185 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:39:07,185 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:39:07,185 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:39:07,185 INFO 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-25 15:39:07,193 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:39:07,194 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:39:08,040 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2019-02-25 15:39:08,040 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:39:08,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 58 conjunts are in the unsatisfiable core [2019-02-25 15:39:08,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:39:08,068 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-25 15:39:08,068 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:39:11,949 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-25 15:39:11,971 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:39:11,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 115 [2019-02-25 15:39:11,971 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:39:11,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-02-25 15:39:11,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-02-25 15:39:11,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-02-25 15:39:11,973 INFO L87 Difference]: Start difference. First operand 117 states and 118 transitions. Second operand 59 states. [2019-02-25 15:39:12,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:39:12,284 INFO L93 Difference]: Finished difference Result 178 states and 181 transitions. [2019-02-25 15:39:12,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-02-25 15:39:12,285 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 116 [2019-02-25 15:39:12,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:39:12,285 INFO L225 Difference]: With dead ends: 178 [2019-02-25 15:39:12,285 INFO L226 Difference]: Without dead ends: 119 [2019-02-25 15:39:12,286 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-02-25 15:39:12,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-02-25 15:39:12,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2019-02-25 15:39:12,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-02-25 15:39:12,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 120 transitions. [2019-02-25 15:39:12,288 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 120 transitions. Word has length 116 [2019-02-25 15:39:12,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:39:12,290 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 120 transitions. [2019-02-25 15:39:12,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-02-25 15:39:12,290 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2019-02-25 15:39:12,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-02-25 15:39:12,291 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:39:12,291 INFO L402 BasicCegarLoop]: trace histogram [57, 57, 1, 1, 1, 1] [2019-02-25 15:39:12,291 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:39:12,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:39:12,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1327912501, now seen corresponding path program 57 times [2019-02-25 15:39:12,291 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:39:12,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:39:12,292 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:39:12,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:39:12,292 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:39:12,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:39:13,626 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-25 15:39:13,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:39:13,626 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:39:13,626 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:39:13,626 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:39:13,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:39:13,627 INFO 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-25 15:39:13,637 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:39:13,637 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:39:13,713 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:39:13,713 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:39:13,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 585 conjuncts, 59 conjunts are in the unsatisfiable core [2019-02-25 15:39:13,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:39:13,738 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-25 15:39:13,738 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:39:17,604 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-25 15:39:17,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:39:17,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 117 [2019-02-25 15:39:17,624 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:39:17,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-02-25 15:39:17,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-02-25 15:39:17,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-02-25 15:39:17,625 INFO L87 Difference]: Start difference. First operand 119 states and 120 transitions. Second operand 60 states. [2019-02-25 15:39:17,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:39:17,903 INFO L93 Difference]: Finished difference Result 181 states and 184 transitions. [2019-02-25 15:39:17,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-02-25 15:39:17,903 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 118 [2019-02-25 15:39:17,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:39:17,904 INFO L225 Difference]: With dead ends: 181 [2019-02-25 15:39:17,904 INFO L226 Difference]: Without dead ends: 121 [2019-02-25 15:39:17,905 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-02-25 15:39:17,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-02-25 15:39:17,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2019-02-25 15:39:17,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-02-25 15:39:17,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 122 transitions. [2019-02-25 15:39:17,909 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 122 transitions. Word has length 118 [2019-02-25 15:39:17,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:39:17,910 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 122 transitions. [2019-02-25 15:39:17,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-02-25 15:39:17,910 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 122 transitions. [2019-02-25 15:39:17,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-02-25 15:39:17,910 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:39:17,911 INFO L402 BasicCegarLoop]: trace histogram [58, 58, 1, 1, 1, 1] [2019-02-25 15:39:17,911 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:39:17,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:39:17,911 INFO L82 PathProgramCache]: Analyzing trace with hash -1186678166, now seen corresponding path program 58 times [2019-02-25 15:39:17,911 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:39:17,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:39:17,912 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:39:17,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:39:17,912 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:39:17,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:39:19,222 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-25 15:39:19,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:39:19,222 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:39:19,223 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:39:19,223 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:39:19,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:39:19,223 INFO 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-25 15:39:19,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:39:19,234 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:39:19,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:39:19,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 595 conjuncts, 60 conjunts are in the unsatisfiable core [2019-02-25 15:39:19,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:39:19,330 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-25 15:39:19,330 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:39:23,090 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-25 15:39:23,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:39:23,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 119 [2019-02-25 15:39:23,109 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:39:23,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-02-25 15:39:23,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-02-25 15:39:23,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-02-25 15:39:23,110 INFO L87 Difference]: Start difference. First operand 121 states and 122 transitions. Second operand 61 states. [2019-02-25 15:39:23,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:39:23,467 INFO L93 Difference]: Finished difference Result 184 states and 187 transitions. [2019-02-25 15:39:23,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-02-25 15:39:23,467 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 120 [2019-02-25 15:39:23,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:39:23,468 INFO L225 Difference]: With dead ends: 184 [2019-02-25 15:39:23,468 INFO L226 Difference]: Without dead ends: 123 [2019-02-25 15:39:23,469 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-02-25 15:39:23,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-02-25 15:39:23,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2019-02-25 15:39:23,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-02-25 15:39:23,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 124 transitions. [2019-02-25 15:39:23,472 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 124 transitions. Word has length 120 [2019-02-25 15:39:23,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:39:23,472 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 124 transitions. [2019-02-25 15:39:23,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-02-25 15:39:23,472 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 124 transitions. [2019-02-25 15:39:23,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-02-25 15:39:23,473 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:39:23,473 INFO L402 BasicCegarLoop]: trace histogram [59, 59, 1, 1, 1, 1] [2019-02-25 15:39:23,473 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:39:23,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:39:23,474 INFO L82 PathProgramCache]: Analyzing trace with hash 737003157, now seen corresponding path program 59 times [2019-02-25 15:39:23,474 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:39:23,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:39:23,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:39:23,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:39:23,475 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:39:23,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:39:25,058 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-25 15:39:25,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:39:25,059 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:39:25,059 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:39:25,059 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:39:25,059 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:39:25,059 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-25 15:39:25,069 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:39:25,069 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:39:26,106 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2019-02-25 15:39:26,106 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:39:26,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 605 conjuncts, 61 conjunts are in the unsatisfiable core [2019-02-25 15:39:26,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:39:26,143 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-25 15:39:26,144 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:39:29,879 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-25 15:39:29,901 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:39:29,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 121 [2019-02-25 15:39:29,902 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:39:29,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-02-25 15:39:29,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-02-25 15:39:29,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2019-02-25 15:39:29,903 INFO L87 Difference]: Start difference. First operand 123 states and 124 transitions. Second operand 62 states. [2019-02-25 15:39:30,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:39:30,234 INFO L93 Difference]: Finished difference Result 187 states and 190 transitions. [2019-02-25 15:39:30,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-02-25 15:39:30,234 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 122 [2019-02-25 15:39:30,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:39:30,235 INFO L225 Difference]: With dead ends: 187 [2019-02-25 15:39:30,235 INFO L226 Difference]: Without dead ends: 125 [2019-02-25 15:39:30,236 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2019-02-25 15:39:30,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-02-25 15:39:30,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2019-02-25 15:39:30,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-02-25 15:39:30,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 126 transitions. [2019-02-25 15:39:30,240 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 126 transitions. Word has length 122 [2019-02-25 15:39:30,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:39:30,240 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 126 transitions. [2019-02-25 15:39:30,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-02-25 15:39:30,240 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 126 transitions. [2019-02-25 15:39:30,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-02-25 15:39:30,241 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:39:30,241 INFO L402 BasicCegarLoop]: trace histogram [60, 60, 1, 1, 1, 1] [2019-02-25 15:39:30,241 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:39:30,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:39:30,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1414379914, now seen corresponding path program 60 times [2019-02-25 15:39:30,242 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:39:30,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:39:30,242 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:39:30,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:39:30,243 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:39:30,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:39:32,217 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-25 15:39:32,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:39:32,218 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:39:32,218 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:39:32,218 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:39:32,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:39:32,218 INFO 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-25 15:39:32,246 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:39:32,246 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:39:32,328 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:39:32,328 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:39:32,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 615 conjuncts, 62 conjunts are in the unsatisfiable core [2019-02-25 15:39:32,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:39:32,350 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-25 15:39:32,350 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:39:36,127 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-25 15:39:36,146 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:39:36,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 123 [2019-02-25 15:39:36,147 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:39:36,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-02-25 15:39:36,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-02-25 15:39:36,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2019-02-25 15:39:36,148 INFO L87 Difference]: Start difference. First operand 125 states and 126 transitions. Second operand 63 states. [2019-02-25 15:39:36,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:39:36,516 INFO L93 Difference]: Finished difference Result 190 states and 193 transitions. [2019-02-25 15:39:36,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-02-25 15:39:36,516 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 124 [2019-02-25 15:39:36,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:39:36,517 INFO L225 Difference]: With dead ends: 190 [2019-02-25 15:39:36,517 INFO L226 Difference]: Without dead ends: 127 [2019-02-25 15:39:36,517 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2019-02-25 15:39:36,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-02-25 15:39:36,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2019-02-25 15:39:36,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-02-25 15:39:36,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2019-02-25 15:39:36,521 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 124 [2019-02-25 15:39:36,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:39:36,521 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2019-02-25 15:39:36,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-02-25 15:39:36,521 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2019-02-25 15:39:36,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-02-25 15:39:36,521 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:39:36,521 INFO L402 BasicCegarLoop]: trace histogram [61, 61, 1, 1, 1, 1] [2019-02-25 15:39:36,522 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:39:36,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:39:36,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1579405579, now seen corresponding path program 61 times [2019-02-25 15:39:36,522 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:39:36,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:39:36,522 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:39:36,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:39:36,523 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:39:36,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:39:37,978 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-25 15:39:37,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:39:37,978 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:39:37,979 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:39:37,979 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:39:37,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:39:37,979 INFO 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-25 15:39:37,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:39:37,988 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:39:38,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:39:38,078 INFO L256 TraceCheckSpWp]: Trace formula consists of 625 conjuncts, 63 conjunts are in the unsatisfiable core [2019-02-25 15:39:38,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:39:38,096 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-25 15:39:38,096 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:39:42,273 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-25 15:39:42,292 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:39:42,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 125 [2019-02-25 15:39:42,293 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:39:42,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-02-25 15:39:42,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-02-25 15:39:42,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2019-02-25 15:39:42,294 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand 64 states. [2019-02-25 15:39:42,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:39:42,644 INFO L93 Difference]: Finished difference Result 193 states and 196 transitions. [2019-02-25 15:39:42,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-02-25 15:39:42,644 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 126 [2019-02-25 15:39:42,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:39:42,645 INFO L225 Difference]: With dead ends: 193 [2019-02-25 15:39:42,645 INFO L226 Difference]: Without dead ends: 129 [2019-02-25 15:39:42,646 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-25 15:39:42,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-02-25 15:39:42,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2019-02-25 15:39:42,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-02-25 15:39:42,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 130 transitions. [2019-02-25 15:39:42,649 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 130 transitions. Word has length 126 [2019-02-25 15:39:42,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:39:42,649 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 130 transitions. [2019-02-25 15:39:42,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-02-25 15:39:42,649 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 130 transitions. [2019-02-25 15:39:42,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-02-25 15:39:42,650 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:39:42,650 INFO L402 BasicCegarLoop]: trace histogram [62, 62, 1, 1, 1, 1] [2019-02-25 15:39:42,650 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:39:42,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:39:42,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1271856982, now seen corresponding path program 62 times [2019-02-25 15:39:42,650 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:39:42,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:39:42,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:39:42,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:39:42,651 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:39:42,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:39:44,156 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-25 15:39:44,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:39:44,157 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:39:44,157 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:39:44,157 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:39:44,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:39:44,157 INFO 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-25 15:39:44,166 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:39:44,167 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:39:45,160 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2019-02-25 15:39:45,160 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:39:45,165 INFO L256 TraceCheckSpWp]: Trace formula consists of 635 conjuncts, 64 conjunts are in the unsatisfiable core [2019-02-25 15:39:45,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:39:45,182 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-25 15:39:45,182 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:39:49,526 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-25 15:39:49,549 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:39:49,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 127 [2019-02-25 15:39:49,549 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:39:49,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-02-25 15:39:49,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-02-25 15:39:49,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2019-02-25 15:39:49,551 INFO L87 Difference]: Start difference. First operand 129 states and 130 transitions. Second operand 65 states. [2019-02-25 15:39:49,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:39:49,920 INFO L93 Difference]: Finished difference Result 196 states and 199 transitions. [2019-02-25 15:39:49,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-02-25 15:39:49,921 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 128 [2019-02-25 15:39:49,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:39:49,921 INFO L225 Difference]: With dead ends: 196 [2019-02-25 15:39:49,921 INFO L226 Difference]: Without dead ends: 131 [2019-02-25 15:39:49,923 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2019-02-25 15:39:49,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-02-25 15:39:49,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2019-02-25 15:39:49,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-02-25 15:39:49,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 132 transitions. [2019-02-25 15:39:49,926 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 132 transitions. Word has length 128 [2019-02-25 15:39:49,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:39:49,926 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 132 transitions. [2019-02-25 15:39:49,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-02-25 15:39:49,926 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 132 transitions. [2019-02-25 15:39:49,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-02-25 15:39:49,927 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:39:49,927 INFO L402 BasicCegarLoop]: trace histogram [63, 63, 1, 1, 1, 1] [2019-02-25 15:39:49,927 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:39:49,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:39:49,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1741393749, now seen corresponding path program 63 times [2019-02-25 15:39:49,927 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:39:49,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:39:49,928 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:39:49,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:39:49,928 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:39:49,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:39:51,448 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-25 15:39:51,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:39:51,448 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:39:51,448 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:39:51,448 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:39:51,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:39:51,448 INFO 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-25 15:39:51,465 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:39:51,466 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:39:51,551 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:39:51,551 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:39:51,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 645 conjuncts, 65 conjunts are in the unsatisfiable core [2019-02-25 15:39:51,554 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:39:51,570 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-25 15:39:51,570 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:39:55,979 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-25 15:39:55,998 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:39:55,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 129 [2019-02-25 15:39:55,998 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:39:55,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-02-25 15:39:55,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-02-25 15:39:56,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2019-02-25 15:39:56,000 INFO L87 Difference]: Start difference. First operand 131 states and 132 transitions. Second operand 66 states. [2019-02-25 15:39:56,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:39:56,384 INFO L93 Difference]: Finished difference Result 199 states and 202 transitions. [2019-02-25 15:39:56,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-02-25 15:39:56,384 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 130 [2019-02-25 15:39:56,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:39:56,385 INFO L225 Difference]: With dead ends: 199 [2019-02-25 15:39:56,385 INFO L226 Difference]: Without dead ends: 133 [2019-02-25 15:39:56,386 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2019-02-25 15:39:56,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-02-25 15:39:56,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2019-02-25 15:39:56,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-02-25 15:39:56,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 134 transitions. [2019-02-25 15:39:56,389 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 134 transitions. Word has length 130 [2019-02-25 15:39:56,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:39:56,389 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 134 transitions. [2019-02-25 15:39:56,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-02-25 15:39:56,389 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 134 transitions. [2019-02-25 15:39:56,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-02-25 15:39:56,390 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:39:56,390 INFO L402 BasicCegarLoop]: trace histogram [64, 64, 1, 1, 1, 1] [2019-02-25 15:39:56,390 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:39:56,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:39:56,390 INFO L82 PathProgramCache]: Analyzing trace with hash 573870026, now seen corresponding path program 64 times [2019-02-25 15:39:56,391 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:39:56,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:39:56,391 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:39:56,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:39:56,391 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:39:56,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:39:58,269 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-25 15:39:58,269 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:39:58,269 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:39:58,270 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:39:58,270 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:39:58,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:39:58,270 INFO 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-25 15:39:58,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:39:58,280 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:39:58,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:39:58,371 INFO L256 TraceCheckSpWp]: Trace formula consists of 655 conjuncts, 66 conjunts are in the unsatisfiable core [2019-02-25 15:39:58,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:39:58,398 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-25 15:39:58,398 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:40:03,081 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-25 15:40:03,100 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:40:03,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 131 [2019-02-25 15:40:03,101 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:40:03,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-02-25 15:40:03,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-02-25 15:40:03,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2019-02-25 15:40:03,102 INFO L87 Difference]: Start difference. First operand 133 states and 134 transitions. Second operand 67 states. [2019-02-25 15:40:03,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:40:03,539 INFO L93 Difference]: Finished difference Result 202 states and 205 transitions. [2019-02-25 15:40:03,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-02-25 15:40:03,539 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 132 [2019-02-25 15:40:03,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:40:03,540 INFO L225 Difference]: With dead ends: 202 [2019-02-25 15:40:03,540 INFO L226 Difference]: Without dead ends: 135 [2019-02-25 15:40:03,541 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2019-02-25 15:40:03,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-02-25 15:40:03,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2019-02-25 15:40:03,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-02-25 15:40:03,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 136 transitions. [2019-02-25 15:40:03,544 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 136 transitions. Word has length 132 [2019-02-25 15:40:03,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:40:03,545 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 136 transitions. [2019-02-25 15:40:03,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-02-25 15:40:03,545 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 136 transitions. [2019-02-25 15:40:03,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-02-25 15:40:03,546 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:40:03,546 INFO L402 BasicCegarLoop]: trace histogram [65, 65, 1, 1, 1, 1] [2019-02-25 15:40:03,546 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:40:03,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:40:03,546 INFO L82 PathProgramCache]: Analyzing trace with hash -904534091, now seen corresponding path program 65 times [2019-02-25 15:40:03,546 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:40:03,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:40:03,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:40:03,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:40:03,547 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:40:03,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:40:05,187 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-25 15:40:05,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:40:05,188 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:40:05,188 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:40:05,188 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:40:05,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:40:05,188 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-25 15:40:05,196 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:40:05,196 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:40:08,232 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2019-02-25 15:40:08,233 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:40:08,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 665 conjuncts, 67 conjunts are in the unsatisfiable core [2019-02-25 15:40:08,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:40:08,273 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-25 15:40:08,273 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:40:14,837 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-25 15:40:14,859 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:40:14,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 133 [2019-02-25 15:40:14,859 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:40:14,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-02-25 15:40:14,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-02-25 15:40:14,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2019-02-25 15:40:14,861 INFO L87 Difference]: Start difference. First operand 135 states and 136 transitions. Second operand 68 states. [2019-02-25 15:40:15,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:40:15,209 INFO L93 Difference]: Finished difference Result 205 states and 208 transitions. [2019-02-25 15:40:15,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-02-25 15:40:15,210 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 134 [2019-02-25 15:40:15,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:40:15,211 INFO L225 Difference]: With dead ends: 205 [2019-02-25 15:40:15,211 INFO L226 Difference]: Without dead ends: 137 [2019-02-25 15:40:15,211 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2019-02-25 15:40:15,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-02-25 15:40:15,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2019-02-25 15:40:15,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-02-25 15:40:15,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 138 transitions. [2019-02-25 15:40:15,215 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 138 transitions. Word has length 134 [2019-02-25 15:40:15,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:40:15,215 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 138 transitions. [2019-02-25 15:40:15,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-02-25 15:40:15,216 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 138 transitions. [2019-02-25 15:40:15,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-02-25 15:40:15,216 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:40:15,216 INFO L402 BasicCegarLoop]: trace histogram [66, 66, 1, 1, 1, 1] [2019-02-25 15:40:15,217 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:40:15,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:40:15,217 INFO L82 PathProgramCache]: Analyzing trace with hash -1843501334, now seen corresponding path program 66 times [2019-02-25 15:40:15,217 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:40:15,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:40:15,218 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:40:15,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:40:15,218 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:40:15,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:40:16,846 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-25 15:40:16,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:40:16,847 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:40:16,847 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:40:16,847 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:40:16,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:40:16,847 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-25 15:40:16,858 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:40:16,859 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:40:16,945 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:40:16,945 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:40:16,948 INFO L256 TraceCheckSpWp]: Trace formula consists of 675 conjuncts, 68 conjunts are in the unsatisfiable core [2019-02-25 15:40:16,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:40:16,967 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-25 15:40:16,967 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:40:21,773 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-25 15:40:21,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:40:21,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 135 [2019-02-25 15:40:21,792 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:40:21,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-02-25 15:40:21,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-02-25 15:40:21,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2019-02-25 15:40:21,793 INFO L87 Difference]: Start difference. First operand 137 states and 138 transitions. Second operand 69 states. [2019-02-25 15:40:22,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:40:22,244 INFO L93 Difference]: Finished difference Result 208 states and 211 transitions. [2019-02-25 15:40:22,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-02-25 15:40:22,244 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 136 [2019-02-25 15:40:22,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:40:22,244 INFO L225 Difference]: With dead ends: 208 [2019-02-25 15:40:22,245 INFO L226 Difference]: Without dead ends: 139 [2019-02-25 15:40:22,245 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2019-02-25 15:40:22,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-02-25 15:40:22,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2019-02-25 15:40:22,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-02-25 15:40:22,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 140 transitions. [2019-02-25 15:40:22,248 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 140 transitions. Word has length 136 [2019-02-25 15:40:22,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:40:22,248 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 140 transitions. [2019-02-25 15:40:22,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-02-25 15:40:22,248 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 140 transitions. [2019-02-25 15:40:22,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-02-25 15:40:22,249 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:40:22,249 INFO L402 BasicCegarLoop]: trace histogram [67, 67, 1, 1, 1, 1] [2019-02-25 15:40:22,249 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:40:22,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:40:22,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1251293205, now seen corresponding path program 67 times [2019-02-25 15:40:22,250 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:40:22,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:40:22,250 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:40:22,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:40:22,250 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:40:22,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:40:24,114 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-25 15:40:24,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:40:24,115 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:40:24,115 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:40:24,115 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:40:24,115 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:40:24,115 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-25 15:40:24,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:40:24,123 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:40:24,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:40:24,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 685 conjuncts, 69 conjunts are in the unsatisfiable core [2019-02-25 15:40:24,213 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:40:24,230 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-25 15:40:24,230 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:40:29,175 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-25 15:40:29,193 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:40:29,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 137 [2019-02-25 15:40:29,194 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:40:29,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-02-25 15:40:29,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-02-25 15:40:29,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2019-02-25 15:40:29,195 INFO L87 Difference]: Start difference. First operand 139 states and 140 transitions. Second operand 70 states. [2019-02-25 15:40:29,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:40:29,660 INFO L93 Difference]: Finished difference Result 211 states and 214 transitions. [2019-02-25 15:40:29,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-02-25 15:40:29,660 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 138 [2019-02-25 15:40:29,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:40:29,661 INFO L225 Difference]: With dead ends: 211 [2019-02-25 15:40:29,661 INFO L226 Difference]: Without dead ends: 141 [2019-02-25 15:40:29,662 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2019-02-25 15:40:29,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-02-25 15:40:29,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2019-02-25 15:40:29,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-02-25 15:40:29,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 142 transitions. [2019-02-25 15:40:29,664 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 142 transitions. Word has length 138 [2019-02-25 15:40:29,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:40:29,664 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 142 transitions. [2019-02-25 15:40:29,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-02-25 15:40:29,664 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 142 transitions. [2019-02-25 15:40:29,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-02-25 15:40:29,665 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:40:29,665 INFO L402 BasicCegarLoop]: trace histogram [68, 68, 1, 1, 1, 1] [2019-02-25 15:40:29,665 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:40:29,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:40:29,665 INFO L82 PathProgramCache]: Analyzing trace with hash 36996618, now seen corresponding path program 68 times [2019-02-25 15:40:29,665 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:40:29,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:40:29,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:40:29,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:40:29,666 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:40:29,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:40:31,360 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-25 15:40:31,361 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:40:31,361 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:40:31,361 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:40:31,361 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:40:31,361 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:40:31,361 INFO 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-25 15:40:31,369 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:40:31,369 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:40:34,541 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2019-02-25 15:40:34,542 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:40:34,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 695 conjuncts, 70 conjunts are in the unsatisfiable core [2019-02-25 15:40:34,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:40:34,574 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-25 15:40:34,575 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:40:39,916 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-25 15:40:39,939 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:40:39,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 139 [2019-02-25 15:40:39,939 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:40:39,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-02-25 15:40:39,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-02-25 15:40:39,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2019-02-25 15:40:39,941 INFO L87 Difference]: Start difference. First operand 141 states and 142 transitions. Second operand 71 states. [2019-02-25 15:40:40,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:40:40,441 INFO L93 Difference]: Finished difference Result 214 states and 217 transitions. [2019-02-25 15:40:40,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-02-25 15:40:40,441 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 140 [2019-02-25 15:40:40,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:40:40,442 INFO L225 Difference]: With dead ends: 214 [2019-02-25 15:40:40,442 INFO L226 Difference]: Without dead ends: 143 [2019-02-25 15:40:40,442 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2019-02-25 15:40:40,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-02-25 15:40:40,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2019-02-25 15:40:40,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-02-25 15:40:40,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 144 transitions. [2019-02-25 15:40:40,445 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 144 transitions. Word has length 140 [2019-02-25 15:40:40,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:40:40,445 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 144 transitions. [2019-02-25 15:40:40,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-02-25 15:40:40,445 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 144 transitions. [2019-02-25 15:40:40,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-02-25 15:40:40,446 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:40:40,446 INFO L402 BasicCegarLoop]: trace histogram [69, 69, 1, 1, 1, 1] [2019-02-25 15:40:40,446 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:40:40,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:40:40,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1084457077, now seen corresponding path program 69 times [2019-02-25 15:40:40,446 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:40:40,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:40:40,447 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:40:40,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:40:40,447 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:40:40,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:40:42,171 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-25 15:40:42,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:40:42,172 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:40:42,172 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:40:42,172 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:40:42,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:40:42,172 INFO 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-25 15:40:42,180 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:40:42,180 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:40:42,269 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:40:42,269 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:40:42,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 705 conjuncts, 71 conjunts are in the unsatisfiable core [2019-02-25 15:40:42,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:40:42,299 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-25 15:40:42,299 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:40:47,402 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-25 15:40:47,421 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:40:47,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 141 [2019-02-25 15:40:47,421 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:40:47,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-02-25 15:40:47,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-02-25 15:40:47,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2019-02-25 15:40:47,423 INFO L87 Difference]: Start difference. First operand 143 states and 144 transitions. Second operand 72 states. [2019-02-25 15:40:47,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:40:47,903 INFO L93 Difference]: Finished difference Result 217 states and 220 transitions. [2019-02-25 15:40:47,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-02-25 15:40:47,904 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 142 [2019-02-25 15:40:47,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:40:47,904 INFO L225 Difference]: With dead ends: 217 [2019-02-25 15:40:47,904 INFO L226 Difference]: Without dead ends: 145 [2019-02-25 15:40:47,906 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2019-02-25 15:40:47,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-02-25 15:40:47,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2019-02-25 15:40:47,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-02-25 15:40:47,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 146 transitions. [2019-02-25 15:40:47,909 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 146 transitions. Word has length 142 [2019-02-25 15:40:47,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:40:47,910 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 146 transitions. [2019-02-25 15:40:47,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-02-25 15:40:47,910 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 146 transitions. [2019-02-25 15:40:47,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-02-25 15:40:47,911 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:40:47,911 INFO L402 BasicCegarLoop]: trace histogram [70, 70, 1, 1, 1, 1] [2019-02-25 15:40:47,911 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:40:47,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:40:47,912 INFO L82 PathProgramCache]: Analyzing trace with hash -616764118, now seen corresponding path program 70 times [2019-02-25 15:40:47,912 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:40:47,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:40:47,912 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:40:47,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:40:47,912 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:40:47,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:40:49,900 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-25 15:40:49,901 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:40:49,901 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:40:49,901 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:40:49,901 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:40:49,901 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:40:49,901 INFO 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-25 15:40:49,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:40:49,910 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:40:50,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:40:50,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 715 conjuncts, 72 conjunts are in the unsatisfiable core [2019-02-25 15:40:50,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:40:50,025 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-25 15:40:50,025 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:40:55,366 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-25 15:40:55,385 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:40:55,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 143 [2019-02-25 15:40:55,385 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:40:55,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-02-25 15:40:55,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-02-25 15:40:55,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2019-02-25 15:40:55,387 INFO L87 Difference]: Start difference. First operand 145 states and 146 transitions. Second operand 73 states. [2019-02-25 15:40:55,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:40:55,783 INFO L93 Difference]: Finished difference Result 220 states and 223 transitions. [2019-02-25 15:40:55,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-02-25 15:40:55,784 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 144 [2019-02-25 15:40:55,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:40:55,784 INFO L225 Difference]: With dead ends: 220 [2019-02-25 15:40:55,785 INFO L226 Difference]: Without dead ends: 147 [2019-02-25 15:40:55,785 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2019-02-25 15:40:55,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-02-25 15:40:55,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2019-02-25 15:40:55,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-02-25 15:40:55,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 148 transitions. [2019-02-25 15:40:55,789 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 148 transitions. Word has length 144 [2019-02-25 15:40:55,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:40:55,789 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 148 transitions. [2019-02-25 15:40:55,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-02-25 15:40:55,790 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 148 transitions. [2019-02-25 15:40:55,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-02-25 15:40:55,790 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:40:55,791 INFO L402 BasicCegarLoop]: trace histogram [71, 71, 1, 1, 1, 1] [2019-02-25 15:40:55,791 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:40:55,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:40:55,791 INFO L82 PathProgramCache]: Analyzing trace with hash 2031796437, now seen corresponding path program 71 times [2019-02-25 15:40:55,791 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:40:55,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:40:55,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:40:55,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:40:55,792 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:40:55,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:40:57,854 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-25 15:40:57,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:40:57,855 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:40:57,855 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:40:57,855 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:40:57,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:40:57,855 INFO 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-25 15:40:57,863 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:40:57,864 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:41:00,445 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 37 check-sat command(s) [2019-02-25 15:41:00,445 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:41:00,459 INFO L256 TraceCheckSpWp]: Trace formula consists of 725 conjuncts, 73 conjunts are in the unsatisfiable core [2019-02-25 15:41:00,461 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:41:00,480 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-25 15:41:00,480 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:41:06,073 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-25 15:41:06,096 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:41:06,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 145 [2019-02-25 15:41:06,096 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:41:06,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-02-25 15:41:06,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-02-25 15:41:06,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2019-02-25 15:41:06,098 INFO L87 Difference]: Start difference. First operand 147 states and 148 transitions. Second operand 74 states. [2019-02-25 15:41:06,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:41:06,665 INFO L93 Difference]: Finished difference Result 223 states and 226 transitions. [2019-02-25 15:41:06,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-02-25 15:41:06,666 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 146 [2019-02-25 15:41:06,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:41:06,666 INFO L225 Difference]: With dead ends: 223 [2019-02-25 15:41:06,666 INFO L226 Difference]: Without dead ends: 149 [2019-02-25 15:41:06,667 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-25 15:41:06,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-02-25 15:41:06,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2019-02-25 15:41:06,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-02-25 15:41:06,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 150 transitions. [2019-02-25 15:41:06,672 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 150 transitions. Word has length 146 [2019-02-25 15:41:06,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:41:06,672 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 150 transitions. [2019-02-25 15:41:06,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-02-25 15:41:06,672 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 150 transitions. [2019-02-25 15:41:06,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-02-25 15:41:06,673 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:41:06,673 INFO L402 BasicCegarLoop]: trace histogram [72, 72, 1, 1, 1, 1] [2019-02-25 15:41:06,674 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:41:06,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:41:06,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1350409290, now seen corresponding path program 72 times [2019-02-25 15:41:06,674 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:41:06,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:41:06,675 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:41:06,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:41:06,675 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:41:06,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:41:08,830 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-25 15:41:08,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:41:08,831 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:41:08,831 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:41:08,831 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:41:08,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:41:08,831 INFO 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-25 15:41:08,839 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:41:08,839 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:41:08,935 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:41:08,936 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:41:08,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 735 conjuncts, 74 conjunts are in the unsatisfiable core [2019-02-25 15:41:08,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:41:08,965 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-25 15:41:08,965 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:41:14,650 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-25 15:41:14,668 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:41:14,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 147 [2019-02-25 15:41:14,668 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:41:14,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-02-25 15:41:14,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-02-25 15:41:14,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2019-02-25 15:41:14,670 INFO L87 Difference]: Start difference. First operand 149 states and 150 transitions. Second operand 75 states. [2019-02-25 15:41:15,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:41:15,164 INFO L93 Difference]: Finished difference Result 226 states and 229 transitions. [2019-02-25 15:41:15,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-02-25 15:41:15,164 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 148 [2019-02-25 15:41:15,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:41:15,165 INFO L225 Difference]: With dead ends: 226 [2019-02-25 15:41:15,165 INFO L226 Difference]: Without dead ends: 151 [2019-02-25 15:41:15,166 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2019-02-25 15:41:15,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-02-25 15:41:15,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2019-02-25 15:41:15,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-02-25 15:41:15,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 152 transitions. [2019-02-25 15:41:15,169 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 152 transitions. Word has length 148 [2019-02-25 15:41:15,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:41:15,170 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 152 transitions. [2019-02-25 15:41:15,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-02-25 15:41:15,170 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 152 transitions. [2019-02-25 15:41:15,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-02-25 15:41:15,171 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:41:15,171 INFO L402 BasicCegarLoop]: trace histogram [73, 73, 1, 1, 1, 1] [2019-02-25 15:41:15,171 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:41:15,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:41:15,171 INFO L82 PathProgramCache]: Analyzing trace with hash -699074251, now seen corresponding path program 73 times [2019-02-25 15:41:15,172 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:41:15,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:41:15,172 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:41:15,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:41:15,172 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:41:15,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:41:17,225 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-25 15:41:17,225 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:41:17,225 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:41:17,225 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:41:17,225 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:41:17,225 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:41:17,226 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-25 15:41:17,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:41:17,235 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:41:17,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:41:17,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 745 conjuncts, 75 conjunts are in the unsatisfiable core [2019-02-25 15:41:17,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:41:17,363 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-25 15:41:17,363 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:41:23,350 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-25 15:41:23,369 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:41:23,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 149 [2019-02-25 15:41:23,369 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:41:23,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-02-25 15:41:23,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-02-25 15:41:23,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2019-02-25 15:41:23,371 INFO L87 Difference]: Start difference. First operand 151 states and 152 transitions. Second operand 76 states. [2019-02-25 15:41:23,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:41:23,868 INFO L93 Difference]: Finished difference Result 229 states and 232 transitions. [2019-02-25 15:41:23,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-02-25 15:41:23,868 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 150 [2019-02-25 15:41:23,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:41:23,869 INFO L225 Difference]: With dead ends: 229 [2019-02-25 15:41:23,869 INFO L226 Difference]: Without dead ends: 153 [2019-02-25 15:41:23,870 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2019-02-25 15:41:23,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-02-25 15:41:23,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2019-02-25 15:41:23,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-02-25 15:41:23,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 154 transitions. [2019-02-25 15:41:23,873 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 154 transitions. Word has length 150 [2019-02-25 15:41:23,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:41:23,873 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 154 transitions. [2019-02-25 15:41:23,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-02-25 15:41:23,873 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 154 transitions. [2019-02-25 15:41:23,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-02-25 15:41:23,874 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:41:23,874 INFO L402 BasicCegarLoop]: trace histogram [74, 74, 1, 1, 1, 1] [2019-02-25 15:41:23,874 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:41:23,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:41:23,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1078160534, now seen corresponding path program 74 times [2019-02-25 15:41:23,874 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:41:23,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:41:23,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:41:23,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:41:23,875 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:41:23,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:41:25,972 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-25 15:41:25,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:41:25,973 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:41:25,973 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:41:25,973 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:41:25,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:41:25,973 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-25 15:41:25,981 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:41:25,981 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:41:28,091 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2019-02-25 15:41:28,091 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:41:28,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 755 conjuncts, 76 conjunts are in the unsatisfiable core [2019-02-25 15:41:28,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:41:28,120 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-25 15:41:28,120 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:41:34,492 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-25 15:41:34,515 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:41:34,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 151 [2019-02-25 15:41:34,515 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:41:34,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-02-25 15:41:34,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-02-25 15:41:34,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2019-02-25 15:41:34,517 INFO L87 Difference]: Start difference. First operand 153 states and 154 transitions. Second operand 77 states. [2019-02-25 15:41:35,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:41:35,077 INFO L93 Difference]: Finished difference Result 232 states and 235 transitions. [2019-02-25 15:41:35,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-02-25 15:41:35,078 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 152 [2019-02-25 15:41:35,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:41:35,078 INFO L225 Difference]: With dead ends: 232 [2019-02-25 15:41:35,078 INFO L226 Difference]: Without dead ends: 155 [2019-02-25 15:41:35,079 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2019-02-25 15:41:35,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-02-25 15:41:35,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2019-02-25 15:41:35,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-02-25 15:41:35,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 156 transitions. [2019-02-25 15:41:35,082 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 156 transitions. Word has length 152 [2019-02-25 15:41:35,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:41:35,082 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 156 transitions. [2019-02-25 15:41:35,082 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-02-25 15:41:35,082 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 156 transitions. [2019-02-25 15:41:35,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-02-25 15:41:35,083 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:41:35,083 INFO L402 BasicCegarLoop]: trace histogram [75, 75, 1, 1, 1, 1] [2019-02-25 15:41:35,083 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:41:35,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:41:35,084 INFO L82 PathProgramCache]: Analyzing trace with hash -265541227, now seen corresponding path program 75 times [2019-02-25 15:41:35,084 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:41:35,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:41:35,084 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:41:35,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:41:35,085 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:41:35,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:41:37,216 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-25 15:41:37,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:41:37,216 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:41:37,216 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:41:37,216 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:41:37,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:41:37,216 INFO 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-25 15:41:37,224 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:41:37,224 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:41:37,327 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:41:37,328 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:41:37,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 765 conjuncts, 77 conjunts are in the unsatisfiable core [2019-02-25 15:41:37,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:41:37,379 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-25 15:41:37,380 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:41:43,613 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-25 15:41:43,631 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:41:43,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 153 [2019-02-25 15:41:43,632 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:41:43,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-02-25 15:41:43,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-02-25 15:41:43,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2019-02-25 15:41:43,633 INFO L87 Difference]: Start difference. First operand 155 states and 156 transitions. Second operand 78 states. [2019-02-25 15:41:44,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:41:44,317 INFO L93 Difference]: Finished difference Result 235 states and 238 transitions. [2019-02-25 15:41:44,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-02-25 15:41:44,318 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 154 [2019-02-25 15:41:44,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:41:44,318 INFO L225 Difference]: With dead ends: 235 [2019-02-25 15:41:44,318 INFO L226 Difference]: Without dead ends: 157 [2019-02-25 15:41:44,319 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2019-02-25 15:41:44,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-02-25 15:41:44,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2019-02-25 15:41:44,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-02-25 15:41:44,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 158 transitions. [2019-02-25 15:41:44,322 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 158 transitions. Word has length 154 [2019-02-25 15:41:44,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:41:44,322 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 158 transitions. [2019-02-25 15:41:44,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-02-25 15:41:44,322 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 158 transitions. [2019-02-25 15:41:44,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-02-25 15:41:44,323 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:41:44,323 INFO L402 BasicCegarLoop]: trace histogram [76, 76, 1, 1, 1, 1] [2019-02-25 15:41:44,323 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:41:44,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:41:44,323 INFO L82 PathProgramCache]: Analyzing trace with hash 289395338, now seen corresponding path program 76 times [2019-02-25 15:41:44,323 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:41:44,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:41:44,324 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:41:44,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:41:44,324 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:41:44,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:41:46,514 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-25 15:41:46,515 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:41:46,515 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:41:46,515 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:41:46,515 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:41:46,515 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:41:46,515 INFO 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-25 15:41:46,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:41:46,523 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:41:46,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:41:46,623 INFO L256 TraceCheckSpWp]: Trace formula consists of 775 conjuncts, 78 conjunts are in the unsatisfiable core [2019-02-25 15:41:46,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:41:46,646 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-25 15:41:46,646 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:41:52,953 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-25 15:41:52,972 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:41:52,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 155 [2019-02-25 15:41:52,972 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:41:52,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-02-25 15:41:52,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-02-25 15:41:52,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2019-02-25 15:41:52,974 INFO L87 Difference]: Start difference. First operand 157 states and 158 transitions. Second operand 79 states. [2019-02-25 15:41:53,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:41:53,529 INFO L93 Difference]: Finished difference Result 238 states and 241 transitions. [2019-02-25 15:41:53,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-02-25 15:41:53,529 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 156 [2019-02-25 15:41:53,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:41:53,531 INFO L225 Difference]: With dead ends: 238 [2019-02-25 15:41:53,531 INFO L226 Difference]: Without dead ends: 159 [2019-02-25 15:41:53,532 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2019-02-25 15:41:53,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-02-25 15:41:53,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2019-02-25 15:41:53,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-02-25 15:41:53,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 160 transitions. [2019-02-25 15:41:53,547 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 160 transitions. Word has length 156 [2019-02-25 15:41:53,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:41:53,548 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 160 transitions. [2019-02-25 15:41:53,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-02-25 15:41:53,548 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 160 transitions. [2019-02-25 15:41:53,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-02-25 15:41:53,549 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:41:53,549 INFO L402 BasicCegarLoop]: trace histogram [77, 77, 1, 1, 1, 1] [2019-02-25 15:41:53,549 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:41:53,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:41:53,549 INFO L82 PathProgramCache]: Analyzing trace with hash -1275440651, now seen corresponding path program 77 times [2019-02-25 15:41:53,549 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:41:53,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:41:53,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:41:53,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:41:53,550 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:41:53,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:41:56,015 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-25 15:41:56,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:41:56,015 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:41:56,015 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:41:56,015 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:41:56,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:41:56,015 INFO 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-25 15:41:56,024 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:41:56,024 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:42:00,264 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2019-02-25 15:42:00,264 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:42:00,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 785 conjuncts, 79 conjunts are in the unsatisfiable core [2019-02-25 15:42:00,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:42:00,303 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-25 15:42:00,304 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:42:06,729 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-25 15:42:06,754 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:42:06,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 157 [2019-02-25 15:42:06,754 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:42:06,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-02-25 15:42:06,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-02-25 15:42:06,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2019-02-25 15:42:06,756 INFO L87 Difference]: Start difference. First operand 159 states and 160 transitions. Second operand 80 states. [2019-02-25 15:42:07,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:42:07,413 INFO L93 Difference]: Finished difference Result 241 states and 244 transitions. [2019-02-25 15:42:07,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-02-25 15:42:07,414 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 158 [2019-02-25 15:42:07,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:42:07,415 INFO L225 Difference]: With dead ends: 241 [2019-02-25 15:42:07,415 INFO L226 Difference]: Without dead ends: 161 [2019-02-25 15:42:07,416 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-25 15:42:07,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-02-25 15:42:07,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2019-02-25 15:42:07,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-02-25 15:42:07,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 162 transitions. [2019-02-25 15:42:07,420 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 162 transitions. Word has length 158 [2019-02-25 15:42:07,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:42:07,420 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 162 transitions. [2019-02-25 15:42:07,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-02-25 15:42:07,420 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 162 transitions. [2019-02-25 15:42:07,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-02-25 15:42:07,421 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:42:07,421 INFO L402 BasicCegarLoop]: trace histogram [78, 78, 1, 1, 1, 1] [2019-02-25 15:42:07,421 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:42:07,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:42:07,422 INFO L82 PathProgramCache]: Analyzing trace with hash 399333802, now seen corresponding path program 78 times [2019-02-25 15:42:07,422 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:42:07,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:42:07,422 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:42:07,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:42:07,423 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:42:07,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:42:09,602 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-25 15:42:09,602 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:42:09,602 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:42:09,603 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:42:09,603 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:42:09,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:42:09,603 INFO 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-25 15:42:09,611 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:42:09,611 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:42:09,715 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:42:09,715 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:42:09,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 795 conjuncts, 80 conjunts are in the unsatisfiable core [2019-02-25 15:42:09,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:42:09,741 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-25 15:42:09,741 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:42:16,601 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-25 15:42:16,620 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:42:16,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 159 [2019-02-25 15:42:16,621 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:42:16,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-02-25 15:42:16,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-02-25 15:42:16,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2019-02-25 15:42:16,623 INFO L87 Difference]: Start difference. First operand 161 states and 162 transitions. Second operand 81 states. [2019-02-25 15:42:17,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:42:17,366 INFO L93 Difference]: Finished difference Result 244 states and 247 transitions. [2019-02-25 15:42:17,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-02-25 15:42:17,366 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 160 [2019-02-25 15:42:17,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:42:17,367 INFO L225 Difference]: With dead ends: 244 [2019-02-25 15:42:17,367 INFO L226 Difference]: Without dead ends: 163 [2019-02-25 15:42:17,368 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2019-02-25 15:42:17,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-02-25 15:42:17,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2019-02-25 15:42:17,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-02-25 15:42:17,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 164 transitions. [2019-02-25 15:42:17,372 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 164 transitions. Word has length 160 [2019-02-25 15:42:17,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:42:17,372 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 164 transitions. [2019-02-25 15:42:17,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-02-25 15:42:17,373 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 164 transitions. [2019-02-25 15:42:17,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-02-25 15:42:17,373 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:42:17,374 INFO L402 BasicCegarLoop]: trace histogram [79, 79, 1, 1, 1, 1] [2019-02-25 15:42:17,374 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:42:17,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:42:17,374 INFO L82 PathProgramCache]: Analyzing trace with hash 77165141, now seen corresponding path program 79 times [2019-02-25 15:42:17,374 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:42:17,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:42:17,375 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:42:17,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:42:17,375 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:42:17,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:42:19,753 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-25 15:42:19,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:42:19,753 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:42:19,753 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:42:19,754 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:42:19,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:42:19,754 INFO 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-25 15:42:19,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:42:19,762 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:42:19,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:42:19,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 805 conjuncts, 81 conjunts are in the unsatisfiable core [2019-02-25 15:42:19,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:42:19,900 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-25 15:42:19,900 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:42:26,947 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-25 15:42:26,966 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:42:26,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 161 [2019-02-25 15:42:26,966 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:42:26,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-02-25 15:42:26,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-02-25 15:42:26,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2019-02-25 15:42:26,968 INFO L87 Difference]: Start difference. First operand 163 states and 164 transitions. Second operand 82 states. [2019-02-25 15:42:27,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:42:27,720 INFO L93 Difference]: Finished difference Result 247 states and 250 transitions. [2019-02-25 15:42:27,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-02-25 15:42:27,721 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 162 [2019-02-25 15:42:27,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:42:27,721 INFO L225 Difference]: With dead ends: 247 [2019-02-25 15:42:27,721 INFO L226 Difference]: Without dead ends: 165 [2019-02-25 15:42:27,722 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2019-02-25 15:42:27,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-02-25 15:42:27,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2019-02-25 15:42:27,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-02-25 15:42:27,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 166 transitions. [2019-02-25 15:42:27,725 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 166 transitions. Word has length 162 [2019-02-25 15:42:27,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:42:27,725 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 166 transitions. [2019-02-25 15:42:27,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-02-25 15:42:27,726 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 166 transitions. [2019-02-25 15:42:27,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-02-25 15:42:27,726 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:42:27,726 INFO L402 BasicCegarLoop]: trace histogram [80, 80, 1, 1, 1, 1] [2019-02-25 15:42:27,726 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:42:27,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:42:27,727 INFO L82 PathProgramCache]: Analyzing trace with hash -257218358, now seen corresponding path program 80 times [2019-02-25 15:42:27,727 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:42:27,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:42:27,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:42:27,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:42:27,727 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:42:27,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:42:30,194 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-25 15:42:30,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:42:30,195 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:42:30,195 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:42:30,195 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:42:30,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:42:30,195 INFO 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-25 15:42:30,203 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:42:30,203 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:42:33,090 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 41 check-sat command(s) [2019-02-25 15:42:33,090 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:42:33,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 815 conjuncts, 82 conjunts are in the unsatisfiable core [2019-02-25 15:42:33,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:42:33,121 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-25 15:42:33,121 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:42:39,979 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-25 15:42:40,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:42:40,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 163 [2019-02-25 15:42:40,003 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:42:40,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-02-25 15:42:40,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-02-25 15:42:40,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2019-02-25 15:42:40,005 INFO L87 Difference]: Start difference. First operand 165 states and 166 transitions. Second operand 83 states. [2019-02-25 15:42:40,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:42:40,746 INFO L93 Difference]: Finished difference Result 250 states and 253 transitions. [2019-02-25 15:42:40,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-02-25 15:42:40,746 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 164 [2019-02-25 15:42:40,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:42:40,747 INFO L225 Difference]: With dead ends: 250 [2019-02-25 15:42:40,747 INFO L226 Difference]: Without dead ends: 167 [2019-02-25 15:42:40,748 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2019-02-25 15:42:40,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-02-25 15:42:40,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2019-02-25 15:42:40,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-02-25 15:42:40,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 168 transitions. [2019-02-25 15:42:40,752 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 168 transitions. Word has length 164 [2019-02-25 15:42:40,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:42:40,752 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 168 transitions. [2019-02-25 15:42:40,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-02-25 15:42:40,752 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 168 transitions. [2019-02-25 15:42:40,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-02-25 15:42:40,753 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:42:40,753 INFO L402 BasicCegarLoop]: trace histogram [81, 81, 1, 1, 1, 1] [2019-02-25 15:42:40,753 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:42:40,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:42:40,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1516473013, now seen corresponding path program 81 times [2019-02-25 15:42:40,754 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:42:40,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:42:40,754 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:42:40,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:42:40,754 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:42:40,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:42:43,292 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-25 15:42:43,292 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:42:43,292 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:42:43,293 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:42:43,293 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:42:43,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:42:43,293 INFO 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-25 15:42:43,301 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:42:43,301 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:42:43,409 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:42:43,410 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:42:43,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 825 conjuncts, 83 conjunts are in the unsatisfiable core [2019-02-25 15:42:43,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:42:43,436 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-25 15:42:43,437 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:42:50,595 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-25 15:42:50,614 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:42:50,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 165 [2019-02-25 15:42:50,614 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:42:50,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-02-25 15:42:50,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-02-25 15:42:50,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2019-02-25 15:42:50,615 INFO L87 Difference]: Start difference. First operand 167 states and 168 transitions. Second operand 84 states. [2019-02-25 15:42:51,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:42:51,266 INFO L93 Difference]: Finished difference Result 253 states and 256 transitions. [2019-02-25 15:42:51,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-02-25 15:42:51,266 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 166 [2019-02-25 15:42:51,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:42:51,267 INFO L225 Difference]: With dead ends: 253 [2019-02-25 15:42:51,267 INFO L226 Difference]: Without dead ends: 169 [2019-02-25 15:42:51,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2019-02-25 15:42:51,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-02-25 15:42:51,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2019-02-25 15:42:51,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-02-25 15:42:51,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 170 transitions. [2019-02-25 15:42:51,271 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 170 transitions. Word has length 166 [2019-02-25 15:42:51,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:42:51,271 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 170 transitions. [2019-02-25 15:42:51,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-02-25 15:42:51,271 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 170 transitions. [2019-02-25 15:42:51,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-02-25 15:42:51,272 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:42:51,272 INFO L402 BasicCegarLoop]: trace histogram [82, 82, 1, 1, 1, 1] [2019-02-25 15:42:51,272 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:42:51,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:42:51,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1671380970, now seen corresponding path program 82 times [2019-02-25 15:42:51,272 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:42:51,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:42:51,273 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:42:51,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:42:51,273 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:42:51,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:42:53,701 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-25 15:42:53,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:42:53,701 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:42:53,701 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:42:53,702 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:42:53,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:42:53,702 INFO 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-25 15:42:53,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:42:53,712 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:42:53,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:42:53,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 835 conjuncts, 84 conjunts are in the unsatisfiable core [2019-02-25 15:42:53,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:42:53,846 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-25 15:42:53,846 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:43:01,528 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-25 15:43:01,546 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:43:01,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 167 [2019-02-25 15:43:01,547 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:43:01,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-02-25 15:43:01,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-02-25 15:43:01,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2019-02-25 15:43:01,548 INFO L87 Difference]: Start difference. First operand 169 states and 170 transitions. Second operand 85 states. [2019-02-25 15:43:02,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:43:02,329 INFO L93 Difference]: Finished difference Result 256 states and 259 transitions. [2019-02-25 15:43:02,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-02-25 15:43:02,329 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 168 [2019-02-25 15:43:02,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:43:02,330 INFO L225 Difference]: With dead ends: 256 [2019-02-25 15:43:02,330 INFO L226 Difference]: Without dead ends: 171 [2019-02-25 15:43:02,331 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-25 15:43:02,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-02-25 15:43:02,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2019-02-25 15:43:02,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-02-25 15:43:02,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 172 transitions. [2019-02-25 15:43:02,334 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 172 transitions. Word has length 168 [2019-02-25 15:43:02,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:43:02,334 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 172 transitions. [2019-02-25 15:43:02,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-02-25 15:43:02,334 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 172 transitions. [2019-02-25 15:43:02,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-02-25 15:43:02,334 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:43:02,334 INFO L402 BasicCegarLoop]: trace histogram [83, 83, 1, 1, 1, 1] [2019-02-25 15:43:02,335 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:43:02,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:43:02,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1664260885, now seen corresponding path program 83 times [2019-02-25 15:43:02,335 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:43:02,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:43:02,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:43:02,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:43:02,336 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:43:02,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:43:04,796 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-25 15:43:04,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:43:04,796 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:43:04,796 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:43:04,796 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:43:04,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:43:04,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 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-25 15:43:04,804 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:43:04,805 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:43:13,333 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 43 check-sat command(s) [2019-02-25 15:43:13,333 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:43:13,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 845 conjuncts, 85 conjunts are in the unsatisfiable core [2019-02-25 15:43:13,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:43:13,383 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-25 15:43:13,383 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:43:20,910 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-25 15:43:20,935 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:43:20,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 169 [2019-02-25 15:43:20,935 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:43:20,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-02-25 15:43:20,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-02-25 15:43:20,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2019-02-25 15:43:20,937 INFO L87 Difference]: Start difference. First operand 171 states and 172 transitions. Second operand 86 states. [2019-02-25 15:43:21,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:43:21,776 INFO L93 Difference]: Finished difference Result 259 states and 262 transitions. [2019-02-25 15:43:21,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-02-25 15:43:21,776 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 170 [2019-02-25 15:43:21,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:43:21,777 INFO L225 Difference]: With dead ends: 259 [2019-02-25 15:43:21,777 INFO L226 Difference]: Without dead ends: 173 [2019-02-25 15:43:21,778 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2019-02-25 15:43:21,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-02-25 15:43:21,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2019-02-25 15:43:21,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-02-25 15:43:21,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 174 transitions. [2019-02-25 15:43:21,781 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 174 transitions. Word has length 170 [2019-02-25 15:43:21,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:43:21,781 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 174 transitions. [2019-02-25 15:43:21,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-02-25 15:43:21,781 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 174 transitions. [2019-02-25 15:43:21,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-02-25 15:43:21,782 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:43:21,782 INFO L402 BasicCegarLoop]: trace histogram [84, 84, 1, 1, 1, 1] [2019-02-25 15:43:21,783 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:43:21,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:43:21,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1123000074, now seen corresponding path program 84 times [2019-02-25 15:43:21,783 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:43:21,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:43:21,784 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:43:21,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:43:21,784 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:43:21,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:43:24,435 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-25 15:43:24,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:43:24,435 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:43:24,435 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:43:24,435 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:43:24,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:43:24,436 INFO 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-25 15:43:24,443 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:43:24,443 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:43:24,557 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:43:24,557 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:43:24,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 855 conjuncts, 86 conjunts are in the unsatisfiable core [2019-02-25 15:43:24,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:43:24,585 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-25 15:43:24,585 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:43:32,501 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-25 15:43:32,521 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:43:32,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 171 [2019-02-25 15:43:32,522 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:43:32,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-02-25 15:43:32,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-02-25 15:43:32,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2019-02-25 15:43:32,523 INFO L87 Difference]: Start difference. First operand 173 states and 174 transitions. Second operand 87 states. [2019-02-25 15:43:33,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:43:33,419 INFO L93 Difference]: Finished difference Result 262 states and 265 transitions. [2019-02-25 15:43:33,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-02-25 15:43:33,419 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 172 [2019-02-25 15:43:33,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:43:33,420 INFO L225 Difference]: With dead ends: 262 [2019-02-25 15:43:33,420 INFO L226 Difference]: Without dead ends: 175 [2019-02-25 15:43:33,421 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2019-02-25 15:43:33,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-02-25 15:43:33,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2019-02-25 15:43:33,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-02-25 15:43:33,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 176 transitions. [2019-02-25 15:43:33,425 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 176 transitions. Word has length 172 [2019-02-25 15:43:33,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:43:33,425 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 176 transitions. [2019-02-25 15:43:33,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-02-25 15:43:33,426 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 176 transitions. [2019-02-25 15:43:33,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-02-25 15:43:33,426 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:43:33,427 INFO L402 BasicCegarLoop]: trace histogram [85, 85, 1, 1, 1, 1] [2019-02-25 15:43:33,427 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:43:33,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:43:33,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1570725003, now seen corresponding path program 85 times [2019-02-25 15:43:33,427 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:43:33,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:43:33,428 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:43:33,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:43:33,428 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:43:33,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:43:36,025 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-25 15:43:36,025 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:43:36,025 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:43:36,026 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:43:36,026 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:43:36,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:43:36,026 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-25 15:43:36,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:43:36,036 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:43:36,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:43:36,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 865 conjuncts, 87 conjunts are in the unsatisfiable core [2019-02-25 15:43:36,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:43:36,178 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-25 15:43:36,178 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:43:44,115 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-25 15:43:44,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:43:44,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 173 [2019-02-25 15:43:44,134 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:43:44,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-02-25 15:43:44,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-02-25 15:43:44,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2019-02-25 15:43:44,136 INFO L87 Difference]: Start difference. First operand 175 states and 176 transitions. Second operand 88 states. [2019-02-25 15:43:45,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:43:45,023 INFO L93 Difference]: Finished difference Result 265 states and 268 transitions. [2019-02-25 15:43:45,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-02-25 15:43:45,023 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 174 [2019-02-25 15:43:45,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:43:45,024 INFO L225 Difference]: With dead ends: 265 [2019-02-25 15:43:45,024 INFO L226 Difference]: Without dead ends: 177 [2019-02-25 15:43:45,025 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2019-02-25 15:43:45,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-02-25 15:43:45,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2019-02-25 15:43:45,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-02-25 15:43:45,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 178 transitions. [2019-02-25 15:43:45,028 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 178 transitions. Word has length 174 [2019-02-25 15:43:45,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:43:45,028 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 178 transitions. [2019-02-25 15:43:45,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-02-25 15:43:45,029 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 178 transitions. [2019-02-25 15:43:45,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-02-25 15:43:45,029 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:43:45,030 INFO L402 BasicCegarLoop]: trace histogram [86, 86, 1, 1, 1, 1] [2019-02-25 15:43:45,030 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:43:45,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:43:45,030 INFO L82 PathProgramCache]: Analyzing trace with hash -882751958, now seen corresponding path program 86 times [2019-02-25 15:43:45,030 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:43:45,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:43:45,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:43:45,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:43:45,031 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:43:45,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:43:47,923 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-25 15:43:47,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:43:47,923 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:43:47,924 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:43:47,924 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:43:47,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:43:47,924 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-25 15:43:47,932 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:43:47,932 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:43:56,860 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) [2019-02-25 15:43:56,861 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:43:56,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 875 conjuncts, 88 conjunts are in the unsatisfiable core [2019-02-25 15:43:56,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:43:56,936 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-25 15:43:56,936 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:44:05,122 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-25 15:44:05,146 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:44:05,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 175 [2019-02-25 15:44:05,147 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:44:05,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-02-25 15:44:05,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-02-25 15:44:05,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2019-02-25 15:44:05,150 INFO L87 Difference]: Start difference. First operand 177 states and 178 transitions. Second operand 89 states. [2019-02-25 15:44:05,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:44:05,935 INFO L93 Difference]: Finished difference Result 268 states and 271 transitions. [2019-02-25 15:44:05,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-02-25 15:44:05,935 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 176 [2019-02-25 15:44:05,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:44:05,936 INFO L225 Difference]: With dead ends: 268 [2019-02-25 15:44:05,937 INFO L226 Difference]: Without dead ends: 179 [2019-02-25 15:44:05,938 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 438 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2019-02-25 15:44:05,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-02-25 15:44:05,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2019-02-25 15:44:05,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-02-25 15:44:05,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 180 transitions. [2019-02-25 15:44:05,941 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 180 transitions. Word has length 176 [2019-02-25 15:44:05,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:44:05,941 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 180 transitions. [2019-02-25 15:44:05,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-02-25 15:44:05,941 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 180 transitions. [2019-02-25 15:44:05,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-02-25 15:44:05,942 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:44:05,942 INFO L402 BasicCegarLoop]: trace histogram [87, 87, 1, 1, 1, 1] [2019-02-25 15:44:05,942 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:44:05,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:44:05,942 INFO L82 PathProgramCache]: Analyzing trace with hash 281519061, now seen corresponding path program 87 times [2019-02-25 15:44:05,942 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:44:05,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:44:05,943 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:44:05,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:44:05,943 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:44:05,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:44:09,009 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-25 15:44:09,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:44:09,010 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:44:09,010 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:44:09,010 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:44:09,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:44:09,011 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-25 15:44:09,020 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:44:09,020 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:44:09,135 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:44:09,136 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:44:09,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 885 conjuncts, 89 conjunts are in the unsatisfiable core [2019-02-25 15:44:09,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:44:09,165 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-25 15:44:09,165 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:44:17,345 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-25 15:44:17,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:44:17,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 177 [2019-02-25 15:44:17,365 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:44:17,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-02-25 15:44:17,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-02-25 15:44:17,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2019-02-25 15:44:17,367 INFO L87 Difference]: Start difference. First operand 179 states and 180 transitions. Second operand 90 states. [2019-02-25 15:44:18,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:44:18,311 INFO L93 Difference]: Finished difference Result 271 states and 274 transitions. [2019-02-25 15:44:18,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-02-25 15:44:18,311 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 178 [2019-02-25 15:44:18,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:44:18,312 INFO L225 Difference]: With dead ends: 271 [2019-02-25 15:44:18,312 INFO L226 Difference]: Without dead ends: 181 [2019-02-25 15:44:18,313 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 443 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2019-02-25 15:44:18,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-02-25 15:44:18,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2019-02-25 15:44:18,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-02-25 15:44:18,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 182 transitions. [2019-02-25 15:44:18,316 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 182 transitions. Word has length 178 [2019-02-25 15:44:18,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:44:18,316 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 182 transitions. [2019-02-25 15:44:18,316 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-02-25 15:44:18,316 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 182 transitions. [2019-02-25 15:44:18,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-02-25 15:44:18,317 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:44:18,317 INFO L402 BasicCegarLoop]: trace histogram [88, 88, 1, 1, 1, 1] [2019-02-25 15:44:18,317 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:44:18,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:44:18,317 INFO L82 PathProgramCache]: Analyzing trace with hash 71120202, now seen corresponding path program 88 times [2019-02-25 15:44:18,317 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:44:18,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:44:18,318 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:44:18,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:44:18,318 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:44:18,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:44:21,124 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-25 15:44:21,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:44:21,125 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:44:21,125 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:44:21,125 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:44:21,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:44:21,125 INFO 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-25 15:44:21,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:44:21,134 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:44:21,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:44:21,252 INFO L256 TraceCheckSpWp]: Trace formula consists of 895 conjuncts, 90 conjunts are in the unsatisfiable core [2019-02-25 15:44:21,254 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:44:21,279 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-25 15:44:21,279 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:44:29,938 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-25 15:44:29,956 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:44:29,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90, 90] total 179 [2019-02-25 15:44:29,957 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:44:29,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-02-25 15:44:29,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-02-25 15:44:29,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2019-02-25 15:44:29,959 INFO L87 Difference]: Start difference. First operand 181 states and 182 transitions. Second operand 91 states. [2019-02-25 15:44:30,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:44:30,750 INFO L93 Difference]: Finished difference Result 274 states and 277 transitions. [2019-02-25 15:44:30,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-02-25 15:44:30,750 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 180 [2019-02-25 15:44:30,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:44:30,751 INFO L225 Difference]: With dead ends: 274 [2019-02-25 15:44:30,751 INFO L226 Difference]: Without dead ends: 183 [2019-02-25 15:44:30,752 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2019-02-25 15:44:30,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-02-25 15:44:30,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2019-02-25 15:44:30,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-02-25 15:44:30,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 184 transitions. [2019-02-25 15:44:30,755 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 184 transitions. Word has length 180 [2019-02-25 15:44:30,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:44:30,755 INFO L480 AbstractCegarLoop]: Abstraction has 183 states and 184 transitions. [2019-02-25 15:44:30,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-02-25 15:44:30,755 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 184 transitions. [2019-02-25 15:44:30,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-02-25 15:44:30,756 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:44:30,756 INFO L402 BasicCegarLoop]: trace histogram [89, 89, 1, 1, 1, 1] [2019-02-25 15:44:30,756 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:44:30,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:44:30,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1128162251, now seen corresponding path program 89 times [2019-02-25 15:44:30,756 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:44:30,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:44:30,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:44:30,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:44:30,757 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:44:30,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:44:34,002 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-25 15:44:34,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:44:34,003 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:44:34,003 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:44:34,003 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:44:34,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:44:34,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 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-25 15:44:34,011 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:44:34,011 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:44:38,658 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2019-02-25 15:44:38,658 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:44:38,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 905 conjuncts, 91 conjunts are in the unsatisfiable core [2019-02-25 15:44:38,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:44:38,692 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-25 15:44:38,692 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:44:46,997 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-25 15:44:47,022 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:44:47,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 181 [2019-02-25 15:44:47,022 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:44:47,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-02-25 15:44:47,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-02-25 15:44:47,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2019-02-25 15:44:47,024 INFO L87 Difference]: Start difference. First operand 183 states and 184 transitions. Second operand 92 states. [2019-02-25 15:44:47,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:44:47,831 INFO L93 Difference]: Finished difference Result 277 states and 280 transitions. [2019-02-25 15:44:47,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-02-25 15:44:47,831 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 182 [2019-02-25 15:44:47,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:44:47,832 INFO L225 Difference]: With dead ends: 277 [2019-02-25 15:44:47,832 INFO L226 Difference]: Without dead ends: 185 [2019-02-25 15:44:47,833 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-25 15:44:47,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-02-25 15:44:47,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2019-02-25 15:44:47,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-02-25 15:44:47,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 186 transitions. [2019-02-25 15:44:47,836 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 186 transitions. Word has length 182 [2019-02-25 15:44:47,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:44:47,837 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 186 transitions. [2019-02-25 15:44:47,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-02-25 15:44:47,837 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 186 transitions. [2019-02-25 15:44:47,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-02-25 15:44:47,838 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:44:47,838 INFO L402 BasicCegarLoop]: trace histogram [90, 90, 1, 1, 1, 1] [2019-02-25 15:44:47,838 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:44:47,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:44:47,839 INFO L82 PathProgramCache]: Analyzing trace with hash 524708970, now seen corresponding path program 90 times [2019-02-25 15:44:47,839 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:44:47,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:44:47,839 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:44:47,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:44:47,840 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:44:47,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:44:51,014 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-25 15:44:51,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:44:51,015 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:44:51,015 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:44:51,015 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:44:51,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:44:51,015 INFO 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-25 15:44:51,024 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:44:51,024 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:44:51,142 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:44:51,142 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:44:51,145 INFO L256 TraceCheckSpWp]: Trace formula consists of 915 conjuncts, 92 conjunts are in the unsatisfiable core [2019-02-25 15:44:51,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:44:51,173 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-25 15:44:51,173 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:45:00,255 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-25 15:45:00,275 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:45:00,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92, 92] total 183 [2019-02-25 15:45:00,276 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:45:00,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-02-25 15:45:00,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-02-25 15:45:00,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2019-02-25 15:45:00,278 INFO L87 Difference]: Start difference. First operand 185 states and 186 transitions. Second operand 93 states. [2019-02-25 15:45:01,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:45:01,158 INFO L93 Difference]: Finished difference Result 280 states and 283 transitions. [2019-02-25 15:45:01,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-02-25 15:45:01,158 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 184 [2019-02-25 15:45:01,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:45:01,159 INFO L225 Difference]: With dead ends: 280 [2019-02-25 15:45:01,159 INFO L226 Difference]: Without dead ends: 187 [2019-02-25 15:45:01,160 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2019-02-25 15:45:01,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-02-25 15:45:01,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2019-02-25 15:45:01,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-02-25 15:45:01,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 188 transitions. [2019-02-25 15:45:01,164 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 188 transitions. Word has length 184 [2019-02-25 15:45:01,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:45:01,164 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 188 transitions. [2019-02-25 15:45:01,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-02-25 15:45:01,164 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 188 transitions. [2019-02-25 15:45:01,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-02-25 15:45:01,165 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:45:01,166 INFO L402 BasicCegarLoop]: trace histogram [91, 91, 1, 1, 1, 1] [2019-02-25 15:45:01,166 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:45:01,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:45:01,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1781042325, now seen corresponding path program 91 times [2019-02-25 15:45:01,166 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:45:01,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:45:01,167 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:45:01,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:45:01,167 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:45:01,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:45:04,692 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-25 15:45:04,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:45:04,692 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:45:04,692 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:45:04,692 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:45:04,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:45:04,692 INFO 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-25 15:45:04,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:45:04,705 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:45:04,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:45:04,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 925 conjuncts, 93 conjunts are in the unsatisfiable core [2019-02-25 15:45:04,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:45:04,859 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-25 15:45:04,859 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:45:13,670 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-25 15:45:13,689 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:45:13,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 185 [2019-02-25 15:45:13,690 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:45:13,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-02-25 15:45:13,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-02-25 15:45:13,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2019-02-25 15:45:13,692 INFO L87 Difference]: Start difference. First operand 187 states and 188 transitions. Second operand 94 states. [2019-02-25 15:45:14,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:45:14,810 INFO L93 Difference]: Finished difference Result 283 states and 286 transitions. [2019-02-25 15:45:14,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-02-25 15:45:14,810 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 186 [2019-02-25 15:45:14,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:45:14,811 INFO L225 Difference]: With dead ends: 283 [2019-02-25 15:45:14,811 INFO L226 Difference]: Without dead ends: 189 [2019-02-25 15:45:14,812 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 463 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2019-02-25 15:45:14,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-02-25 15:45:14,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2019-02-25 15:45:14,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-02-25 15:45:14,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 190 transitions. [2019-02-25 15:45:14,816 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 190 transitions. Word has length 186 [2019-02-25 15:45:14,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:45:14,816 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 190 transitions. [2019-02-25 15:45:14,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-02-25 15:45:14,816 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 190 transitions. [2019-02-25 15:45:14,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-02-25 15:45:14,817 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:45:14,817 INFO L402 BasicCegarLoop]: trace histogram [92, 92, 1, 1, 1, 1] [2019-02-25 15:45:14,818 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:45:14,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:45:14,818 INFO L82 PathProgramCache]: Analyzing trace with hash -658248822, now seen corresponding path program 92 times [2019-02-25 15:45:14,818 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:45:14,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:45:14,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:45:14,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:45:14,819 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:45:14,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:45:17,862 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-25 15:45:17,862 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:45:17,862 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:45:17,863 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:45:17,863 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:45:17,863 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:45:17,863 INFO 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-25 15:45:17,873 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:45:17,873 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:45:22,811 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 47 check-sat command(s) [2019-02-25 15:45:22,811 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:45:22,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 935 conjuncts, 94 conjunts are in the unsatisfiable core [2019-02-25 15:45:22,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:45:22,846 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-25 15:45:22,846 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:45:32,033 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-25 15:45:32,059 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:45:32,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94, 94] total 187 [2019-02-25 15:45:32,059 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:45:32,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-02-25 15:45:32,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-02-25 15:45:32,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2019-02-25 15:45:32,061 INFO L87 Difference]: Start difference. First operand 189 states and 190 transitions. Second operand 95 states. [2019-02-25 15:45:33,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:45:33,035 INFO L93 Difference]: Finished difference Result 286 states and 289 transitions. [2019-02-25 15:45:33,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-02-25 15:45:33,036 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 188 [2019-02-25 15:45:33,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:45:33,037 INFO L225 Difference]: With dead ends: 286 [2019-02-25 15:45:33,037 INFO L226 Difference]: Without dead ends: 191 [2019-02-25 15:45:33,039 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 468 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2019-02-25 15:45:33,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-02-25 15:45:33,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2019-02-25 15:45:33,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-02-25 15:45:33,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 192 transitions. [2019-02-25 15:45:33,042 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 192 transitions. Word has length 188 [2019-02-25 15:45:33,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:45:33,043 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 192 transitions. [2019-02-25 15:45:33,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-02-25 15:45:33,043 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 192 transitions. [2019-02-25 15:45:33,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-02-25 15:45:33,043 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:45:33,044 INFO L402 BasicCegarLoop]: trace histogram [93, 93, 1, 1, 1, 1] [2019-02-25 15:45:33,044 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:45:33,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:45:33,044 INFO L82 PathProgramCache]: Analyzing trace with hash 844526837, now seen corresponding path program 93 times [2019-02-25 15:45:33,044 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:45:33,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:45:33,044 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:45:33,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:45:33,045 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:45:33,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:45:36,507 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-25 15:45:36,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:45:36,507 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:45:36,507 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:45:36,508 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:45:36,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:45:36,508 INFO 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-25 15:45:36,516 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:45:36,516 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:45:36,639 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:45:36,640 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:45:36,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 945 conjuncts, 95 conjunts are in the unsatisfiable core [2019-02-25 15:45:36,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:45:36,670 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-25 15:45:36,670 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:45:46,261 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-25 15:45:46,279 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:45:46,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 189 [2019-02-25 15:45:46,280 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:45:46,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-02-25 15:45:46,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-02-25 15:45:46,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2019-02-25 15:45:46,282 INFO L87 Difference]: Start difference. First operand 191 states and 192 transitions. Second operand 96 states. [2019-02-25 15:45:47,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:45:47,457 INFO L93 Difference]: Finished difference Result 289 states and 292 transitions. [2019-02-25 15:45:47,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-02-25 15:45:47,458 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 190 [2019-02-25 15:45:47,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:45:47,459 INFO L225 Difference]: With dead ends: 289 [2019-02-25 15:45:47,459 INFO L226 Difference]: Without dead ends: 193 [2019-02-25 15:45:47,460 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 473 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2019-02-25 15:45:47,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-02-25 15:45:47,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2019-02-25 15:45:47,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-02-25 15:45:47,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 194 transitions. [2019-02-25 15:45:47,463 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 194 transitions. Word has length 190 [2019-02-25 15:45:47,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:45:47,463 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 194 transitions. [2019-02-25 15:45:47,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-02-25 15:45:47,464 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 194 transitions. [2019-02-25 15:45:47,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-02-25 15:45:47,464 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:45:47,464 INFO L402 BasicCegarLoop]: trace histogram [94, 94, 1, 1, 1, 1] [2019-02-25 15:45:47,464 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:45:47,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:45:47,465 INFO L82 PathProgramCache]: Analyzing trace with hash -679759190, now seen corresponding path program 94 times [2019-02-25 15:45:47,465 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:45:47,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:45:47,465 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:45:47,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:45:47,465 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:45:47,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:45:50,826 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-25 15:45:50,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:45:50,826 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:45:50,827 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:45:50,827 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:45:50,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:45:50,827 INFO 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-25 15:45:50,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:45:50,836 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:45:50,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:45:50,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 955 conjuncts, 96 conjunts are in the unsatisfiable core [2019-02-25 15:45:50,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:45:50,991 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-25 15:45:50,992 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:46:00,695 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-25 15:46:00,716 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:46:00,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 191 [2019-02-25 15:46:00,716 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:46:00,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-02-25 15:46:00,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-02-25 15:46:00,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2019-02-25 15:46:00,718 INFO L87 Difference]: Start difference. First operand 193 states and 194 transitions. Second operand 97 states. [2019-02-25 15:46:01,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:46:01,943 INFO L93 Difference]: Finished difference Result 292 states and 295 transitions. [2019-02-25 15:46:01,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-02-25 15:46:01,943 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 192 [2019-02-25 15:46:01,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:46:01,944 INFO L225 Difference]: With dead ends: 292 [2019-02-25 15:46:01,944 INFO L226 Difference]: Without dead ends: 195 [2019-02-25 15:46:01,945 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 478 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2019-02-25 15:46:01,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-02-25 15:46:01,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2019-02-25 15:46:01,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-02-25 15:46:01,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 196 transitions. [2019-02-25 15:46:01,949 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 196 transitions. Word has length 192 [2019-02-25 15:46:01,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:46:01,949 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 196 transitions. [2019-02-25 15:46:01,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-02-25 15:46:01,949 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 196 transitions. [2019-02-25 15:46:01,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-02-25 15:46:01,950 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:46:01,950 INFO L402 BasicCegarLoop]: trace histogram [95, 95, 1, 1, 1, 1] [2019-02-25 15:46:01,951 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:46:01,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:46:01,951 INFO L82 PathProgramCache]: Analyzing trace with hash 606426453, now seen corresponding path program 95 times [2019-02-25 15:46:01,951 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:46:01,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:46:01,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:46:01,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:46:01,952 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:46:01,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:46:05,143 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-25 15:46:05,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:46:05,143 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:46:05,144 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:46:05,144 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:46:05,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:46:05,144 INFO 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-25 15:46:05,152 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:46:05,152 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:46:10,943 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 49 check-sat command(s) [2019-02-25 15:46:10,943 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:46:10,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 965 conjuncts, 97 conjunts are in the unsatisfiable core [2019-02-25 15:46:10,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:46:10,980 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-25 15:46:10,980 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:46:20,560 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-25 15:46:20,589 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:46:20,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 193 [2019-02-25 15:46:20,589 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:46:20,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-02-25 15:46:20,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-02-25 15:46:20,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2019-02-25 15:46:20,592 INFO L87 Difference]: Start difference. First operand 195 states and 196 transitions. Second operand 98 states. [2019-02-25 15:46:21,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:46:21,942 INFO L93 Difference]: Finished difference Result 295 states and 298 transitions. [2019-02-25 15:46:21,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-02-25 15:46:21,943 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 194 [2019-02-25 15:46:21,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:46:21,943 INFO L225 Difference]: With dead ends: 295 [2019-02-25 15:46:21,944 INFO L226 Difference]: Without dead ends: 197 [2019-02-25 15:46:21,945 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 483 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2019-02-25 15:46:21,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-02-25 15:46:21,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2019-02-25 15:46:21,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-02-25 15:46:21,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 198 transitions. [2019-02-25 15:46:21,949 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 198 transitions. Word has length 194 [2019-02-25 15:46:21,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:46:21,949 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 198 transitions. [2019-02-25 15:46:21,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-02-25 15:46:21,949 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 198 transitions. [2019-02-25 15:46:21,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-02-25 15:46:21,950 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:46:21,950 INFO L402 BasicCegarLoop]: trace histogram [96, 96, 1, 1, 1, 1] [2019-02-25 15:46:21,951 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:46:21,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:46:21,951 INFO L82 PathProgramCache]: Analyzing trace with hash 213107146, now seen corresponding path program 96 times [2019-02-25 15:46:21,951 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:46:21,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:46:21,952 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:46:21,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:46:21,952 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:46:21,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:46:25,386 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-25 15:46:25,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:46:25,386 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:46:25,386 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:46:25,386 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:46:25,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:46:25,386 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-25 15:46:25,395 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:46:25,396 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:46:25,524 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:46:25,524 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:46:25,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 975 conjuncts, 98 conjunts are in the unsatisfiable core [2019-02-25 15:46:25,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:46:25,558 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-25 15:46:25,558 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:46:35,704 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-25 15:46:35,723 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:46:35,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 195 [2019-02-25 15:46:35,723 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:46:35,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-02-25 15:46:35,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-02-25 15:46:35,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2019-02-25 15:46:35,726 INFO L87 Difference]: Start difference. First operand 197 states and 198 transitions. Second operand 99 states. [2019-02-25 15:46:37,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:46:37,067 INFO L93 Difference]: Finished difference Result 298 states and 301 transitions. [2019-02-25 15:46:37,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-02-25 15:46:37,067 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 196 [2019-02-25 15:46:37,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:46:37,068 INFO L225 Difference]: With dead ends: 298 [2019-02-25 15:46:37,068 INFO L226 Difference]: Without dead ends: 199 [2019-02-25 15:46:37,069 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 488 GetRequests, 294 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2019-02-25 15:46:37,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-02-25 15:46:37,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2019-02-25 15:46:37,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-02-25 15:46:37,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 200 transitions. [2019-02-25 15:46:37,072 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 200 transitions. Word has length 196 [2019-02-25 15:46:37,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:46:37,072 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 200 transitions. [2019-02-25 15:46:37,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-02-25 15:46:37,072 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 200 transitions. [2019-02-25 15:46:37,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-02-25 15:46:37,072 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:46:37,073 INFO L402 BasicCegarLoop]: trace histogram [97, 97, 1, 1, 1, 1] [2019-02-25 15:46:37,073 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:46:37,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:46:37,073 INFO L82 PathProgramCache]: Analyzing trace with hash -470864459, now seen corresponding path program 97 times [2019-02-25 15:46:37,073 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:46:37,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:46:37,074 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:46:37,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:46:37,074 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:46:37,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:46:40,468 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-25 15:46:40,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:46:40,468 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:46:40,468 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:46:40,468 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:46:40,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:46:40,468 INFO 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-25 15:46:40,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:46:40,476 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:46:40,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:46:40,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 985 conjuncts, 99 conjunts are in the unsatisfiable core [2019-02-25 15:46:40,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:46:40,639 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-25 15:46:40,639 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:46:50,907 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-25 15:46:50,926 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:46:50,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 197 [2019-02-25 15:46:50,926 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:46:50,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-02-25 15:46:50,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-02-25 15:46:50,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2019-02-25 15:46:50,928 INFO L87 Difference]: Start difference. First operand 199 states and 200 transitions. Second operand 100 states. [2019-02-25 15:46:51,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:46:51,966 INFO L93 Difference]: Finished difference Result 301 states and 304 transitions. [2019-02-25 15:46:51,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-02-25 15:46:51,967 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 198 [2019-02-25 15:46:51,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:46:51,968 INFO L225 Difference]: With dead ends: 301 [2019-02-25 15:46:51,968 INFO L226 Difference]: Without dead ends: 201 [2019-02-25 15:46:51,969 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 493 GetRequests, 297 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2019-02-25 15:46:51,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-02-25 15:46:51,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2019-02-25 15:46:51,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-02-25 15:46:51,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 202 transitions. [2019-02-25 15:46:51,972 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 202 transitions. Word has length 198 [2019-02-25 15:46:51,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:46:51,972 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 202 transitions. [2019-02-25 15:46:51,972 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-02-25 15:46:51,972 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 202 transitions. [2019-02-25 15:46:51,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-02-25 15:46:51,973 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:46:51,973 INFO L402 BasicCegarLoop]: trace histogram [98, 98, 1, 1, 1, 1] [2019-02-25 15:46:51,973 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:46:51,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:46:51,973 INFO L82 PathProgramCache]: Analyzing trace with hash 338827498, now seen corresponding path program 98 times [2019-02-25 15:46:51,973 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:46:51,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:46:51,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:46:51,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:46:51,974 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:46:52,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:46:55,400 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-25 15:46:55,400 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:46:55,400 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:46:55,400 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:46:55,400 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:46:55,400 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:46:55,400 INFO 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-25 15:46:55,409 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:46:55,409 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:47:09,797 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 50 check-sat command(s) [2019-02-25 15:47:09,797 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:47:09,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 995 conjuncts, 100 conjunts are in the unsatisfiable core [2019-02-25 15:47:09,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:47:09,865 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-25 15:47:09,865 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:47:20,278 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-25 15:47:20,305 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:47:20,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100, 100] total 199 [2019-02-25 15:47:20,305 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:47:20,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-02-25 15:47:20,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-02-25 15:47:20,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2019-02-25 15:47:20,308 INFO L87 Difference]: Start difference. First operand 201 states and 202 transitions. Second operand 101 states. [2019-02-25 15:47:21,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:47:21,742 INFO L93 Difference]: Finished difference Result 304 states and 307 transitions. [2019-02-25 15:47:21,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-02-25 15:47:21,742 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 200 [2019-02-25 15:47:21,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:47:21,743 INFO L225 Difference]: With dead ends: 304 [2019-02-25 15:47:21,743 INFO L226 Difference]: Without dead ends: 203 [2019-02-25 15:47:21,744 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 498 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2019-02-25 15:47:21,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-02-25 15:47:21,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2019-02-25 15:47:21,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-02-25 15:47:21,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 204 transitions. [2019-02-25 15:47:21,747 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 204 transitions. Word has length 200 [2019-02-25 15:47:21,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:47:21,747 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 204 transitions. [2019-02-25 15:47:21,747 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-02-25 15:47:21,747 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 204 transitions. [2019-02-25 15:47:21,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-02-25 15:47:21,748 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:47:21,748 INFO L402 BasicCegarLoop]: trace histogram [99, 99, 1, 1, 1, 1] [2019-02-25 15:47:21,748 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:47:21,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:47:21,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1267596821, now seen corresponding path program 99 times [2019-02-25 15:47:21,748 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:47:21,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:47:21,749 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:47:21,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:47:21,749 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:47:21,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:47:25,444 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-25 15:47:25,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:47:25,445 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:47:25,445 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:47:25,445 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:47:25,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:47:25,445 INFO 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-25 15:47:25,453 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:47:25,453 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:47:25,587 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:47:25,587 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:47:25,590 INFO L256 TraceCheckSpWp]: Trace formula consists of 1005 conjuncts, 101 conjunts are in the unsatisfiable core [2019-02-25 15:47:25,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:47:25,623 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-25 15:47:25,623 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:47:36,347 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-25 15:47:36,366 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:47:36,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101, 101] total 201 [2019-02-25 15:47:36,366 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:47:36,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-02-25 15:47:36,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-02-25 15:47:36,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2019-02-25 15:47:36,368 INFO L87 Difference]: Start difference. First operand 203 states and 204 transitions. Second operand 102 states. [2019-02-25 15:47:37,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:47:37,844 INFO L93 Difference]: Finished difference Result 307 states and 310 transitions. [2019-02-25 15:47:37,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-02-25 15:47:37,844 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 202 [2019-02-25 15:47:37,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:47:37,845 INFO L225 Difference]: With dead ends: 307 [2019-02-25 15:47:37,845 INFO L226 Difference]: Without dead ends: 205 [2019-02-25 15:47:37,846 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 503 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2019-02-25 15:47:37,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-02-25 15:47:37,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2019-02-25 15:47:37,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-02-25 15:47:37,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 206 transitions. [2019-02-25 15:47:37,849 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 206 transitions. Word has length 202 [2019-02-25 15:47:37,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:47:37,849 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 206 transitions. [2019-02-25 15:47:37,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-02-25 15:47:37,850 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 206 transitions. [2019-02-25 15:47:37,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-02-25 15:47:37,850 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:47:37,850 INFO L402 BasicCegarLoop]: trace histogram [100, 100, 1, 1, 1, 1] [2019-02-25 15:47:37,850 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:47:37,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:47:37,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1807960054, now seen corresponding path program 100 times [2019-02-25 15:47:37,851 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:47:37,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:47:37,851 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:47:37,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:47:37,852 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:47:37,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:47:41,346 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-25 15:47:41,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:47:41,346 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:47:41,346 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:47:41,346 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:47:41,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:47:41,346 INFO 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-25 15:47:41,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:47:41,355 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:47:41,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:47:41,490 INFO L256 TraceCheckSpWp]: Trace formula consists of 1015 conjuncts, 102 conjunts are in the unsatisfiable core [2019-02-25 15:47:41,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:47:41,541 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-25 15:47:41,541 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:47:52,304 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-25 15:47:52,324 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:47:52,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 102, 102] total 203 [2019-02-25 15:47:52,324 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:47:52,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-02-25 15:47:52,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-02-25 15:47:52,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2019-02-25 15:47:52,328 INFO L87 Difference]: Start difference. First operand 205 states and 206 transitions. Second operand 103 states. [2019-02-25 15:47:53,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:47:53,766 INFO L93 Difference]: Finished difference Result 310 states and 313 transitions. [2019-02-25 15:47:53,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-02-25 15:47:53,767 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 204 [2019-02-25 15:47:53,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:47:53,768 INFO L225 Difference]: With dead ends: 310 [2019-02-25 15:47:53,768 INFO L226 Difference]: Without dead ends: 207 [2019-02-25 15:47:53,770 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 508 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2019-02-25 15:47:53,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-02-25 15:47:53,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2019-02-25 15:47:53,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2019-02-25 15:47:53,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 208 transitions. [2019-02-25 15:47:53,774 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 208 transitions. Word has length 204 [2019-02-25 15:47:53,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:47:53,774 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 208 transitions. [2019-02-25 15:47:53,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-02-25 15:47:53,775 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 208 transitions. [2019-02-25 15:47:53,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-02-25 15:47:53,776 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:47:53,776 INFO L402 BasicCegarLoop]: trace histogram [101, 101, 1, 1, 1, 1] [2019-02-25 15:47:53,776 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:47:53,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:47:53,776 INFO L82 PathProgramCache]: Analyzing trace with hash 173786741, now seen corresponding path program 101 times [2019-02-25 15:47:53,776 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:47:53,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:47:53,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:47:53,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:47:53,777 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:47:53,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:47:57,498 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-25 15:47:57,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:47:57,499 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:47:57,499 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:47:57,499 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:47:57,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:47:57,499 INFO 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-25 15:47:57,507 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:47:57,507 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:48:15,629 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2019-02-25 15:48:15,629 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:48:15,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 1025 conjuncts, 103 conjunts are in the unsatisfiable core [2019-02-25 15:48:15,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:48:15,713 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-25 15:48:15,714 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:48:26,653 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-25 15:48:26,681 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:48:26,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 103, 103] total 205 [2019-02-25 15:48:26,682 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:48:26,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-02-25 15:48:26,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-02-25 15:48:26,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2019-02-25 15:48:26,686 INFO L87 Difference]: Start difference. First operand 207 states and 208 transitions. Second operand 104 states. [2019-02-25 15:48:28,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:48:28,306 INFO L93 Difference]: Finished difference Result 313 states and 316 transitions. [2019-02-25 15:48:28,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-02-25 15:48:28,306 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 206 [2019-02-25 15:48:28,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:48:28,307 INFO L225 Difference]: With dead ends: 313 [2019-02-25 15:48:28,308 INFO L226 Difference]: Without dead ends: 209 [2019-02-25 15:48:28,310 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 513 GetRequests, 309 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2019-02-25 15:48:28,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-02-25 15:48:28,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2019-02-25 15:48:28,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-02-25 15:48:28,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 210 transitions. [2019-02-25 15:48:28,314 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 210 transitions. Word has length 206 [2019-02-25 15:48:28,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:48:28,314 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 210 transitions. [2019-02-25 15:48:28,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-02-25 15:48:28,314 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 210 transitions. [2019-02-25 15:48:28,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-02-25 15:48:28,315 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:48:28,315 INFO L402 BasicCegarLoop]: trace histogram [102, 102, 1, 1, 1, 1] [2019-02-25 15:48:28,315 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:48:28,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:48:28,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1650876630, now seen corresponding path program 102 times [2019-02-25 15:48:28,316 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:48:28,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:48:28,316 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:48:28,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:48:28,317 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:48:28,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:48:32,240 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-25 15:48:32,240 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:48:32,241 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:48:32,241 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:48:32,241 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:48:32,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:48:32,241 INFO 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-25 15:48:32,249 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:48:32,249 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:48:32,385 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:48:32,386 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:48:32,389 INFO L256 TraceCheckSpWp]: Trace formula consists of 1035 conjuncts, 104 conjunts are in the unsatisfiable core [2019-02-25 15:48:32,390 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:48:32,423 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-25 15:48:32,423 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:48:43,835 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-25 15:48:43,854 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:48:43,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104, 104, 104] total 207 [2019-02-25 15:48:43,855 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:48:43,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-02-25 15:48:43,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-02-25 15:48:43,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2019-02-25 15:48:43,858 INFO L87 Difference]: Start difference. First operand 209 states and 210 transitions. Second operand 105 states. [2019-02-25 15:48:45,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:48:45,215 INFO L93 Difference]: Finished difference Result 316 states and 319 transitions. [2019-02-25 15:48:45,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-02-25 15:48:45,216 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 208 [2019-02-25 15:48:45,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:48:45,216 INFO L225 Difference]: With dead ends: 316 [2019-02-25 15:48:45,217 INFO L226 Difference]: Without dead ends: 211 [2019-02-25 15:48:45,218 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 518 GetRequests, 312 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2019-02-25 15:48:45,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-02-25 15:48:45,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2019-02-25 15:48:45,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-02-25 15:48:45,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 212 transitions. [2019-02-25 15:48:45,223 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 212 transitions. Word has length 208 [2019-02-25 15:48:45,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:48:45,224 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 212 transitions. [2019-02-25 15:48:45,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-02-25 15:48:45,224 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 212 transitions. [2019-02-25 15:48:45,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-02-25 15:48:45,225 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:48:45,225 INFO L402 BasicCegarLoop]: trace histogram [103, 103, 1, 1, 1, 1] [2019-02-25 15:48:45,226 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:48:45,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:48:45,226 INFO L82 PathProgramCache]: Analyzing trace with hash 1160939221, now seen corresponding path program 103 times [2019-02-25 15:48:45,226 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:48:45,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:48:45,227 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:48:45,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:48:45,227 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:48:45,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:48:49,071 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-25 15:48:49,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:48:49,071 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:48:49,071 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:48:49,072 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:48:49,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:48:49,072 INFO 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-25 15:48:49,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:48:49,082 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:48:49,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:48:49,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 1045 conjuncts, 105 conjunts are in the unsatisfiable core [2019-02-25 15:48:49,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:48:49,264 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-25 15:48:49,264 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:49:00,673 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-25 15:49:00,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:49:00,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105, 105, 105] total 209 [2019-02-25 15:49:00,692 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:49:00,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-02-25 15:49:00,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-02-25 15:49:00,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2019-02-25 15:49:00,695 INFO L87 Difference]: Start difference. First operand 211 states and 212 transitions. Second operand 106 states. [2019-02-25 15:49:02,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:49:02,267 INFO L93 Difference]: Finished difference Result 319 states and 322 transitions. [2019-02-25 15:49:02,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-02-25 15:49:02,268 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 210 [2019-02-25 15:49:02,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:49:02,269 INFO L225 Difference]: With dead ends: 319 [2019-02-25 15:49:02,269 INFO L226 Difference]: Without dead ends: 213 [2019-02-25 15:49:02,271 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 523 GetRequests, 315 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.0s TimeCoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2019-02-25 15:49:02,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-02-25 15:49:02,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2019-02-25 15:49:02,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-02-25 15:49:02,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 214 transitions. [2019-02-25 15:49:02,275 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 214 transitions. Word has length 210 [2019-02-25 15:49:02,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:49:02,275 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 214 transitions. [2019-02-25 15:49:02,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-02-25 15:49:02,275 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 214 transitions. [2019-02-25 15:49:02,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-02-25 15:49:02,276 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:49:02,276 INFO L402 BasicCegarLoop]: trace histogram [104, 104, 1, 1, 1, 1] [2019-02-25 15:49:02,276 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:49:02,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:49:02,277 INFO L82 PathProgramCache]: Analyzing trace with hash 193908298, now seen corresponding path program 104 times [2019-02-25 15:49:02,277 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:49:02,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:49:02,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:49:02,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:49:02,277 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:49:02,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:49:06,530 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-25 15:49:06,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:49:06,530 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:49:06,531 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:49:06,531 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:49:06,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:49:06,531 INFO 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-25 15:49:06,548 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:49:06,548 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:49:14,732 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 53 check-sat command(s) [2019-02-25 15:49:14,733 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:49:14,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 1055 conjuncts, 106 conjunts are in the unsatisfiable core [2019-02-25 15:49:14,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:49:14,776 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-25 15:49:14,776 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:49:26,579 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-25 15:49:26,607 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:49:26,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106, 106, 106] total 211 [2019-02-25 15:49:26,608 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:49:26,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-02-25 15:49:26,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-02-25 15:49:26,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2019-02-25 15:49:26,611 INFO L87 Difference]: Start difference. First operand 213 states and 214 transitions. Second operand 107 states. [2019-02-25 15:49:27,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:49:27,889 INFO L93 Difference]: Finished difference Result 322 states and 325 transitions. [2019-02-25 15:49:27,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-02-25 15:49:27,889 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 212 [2019-02-25 15:49:27,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:49:27,890 INFO L225 Difference]: With dead ends: 322 [2019-02-25 15:49:27,890 INFO L226 Difference]: Without dead ends: 215 [2019-02-25 15:49:27,892 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-25 15:49:27,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-02-25 15:49:27,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2019-02-25 15:49:27,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2019-02-25 15:49:27,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 216 transitions. [2019-02-25 15:49:27,896 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 216 transitions. Word has length 212 [2019-02-25 15:49:27,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:49:27,896 INFO L480 AbstractCegarLoop]: Abstraction has 215 states and 216 transitions. [2019-02-25 15:49:27,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-02-25 15:49:27,896 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 216 transitions. [2019-02-25 15:49:27,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-02-25 15:49:27,897 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:49:27,897 INFO L402 BasicCegarLoop]: trace histogram [105, 105, 1, 1, 1, 1] [2019-02-25 15:49:27,898 INFO L423 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:49:27,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:49:27,898 INFO L82 PathProgramCache]: Analyzing trace with hash 913063733, now seen corresponding path program 105 times [2019-02-25 15:49:27,898 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:49:27,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:49:27,899 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:49:27,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:49:27,899 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:49:27,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat