java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/array3.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b7bd044-m [2019-01-20 09:57:21,517 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-20 09:57:21,519 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-20 09:57:21,532 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-20 09:57:21,533 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-20 09:57:21,534 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-20 09:57:21,535 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-20 09:57:21,537 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-20 09:57:21,538 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-20 09:57:21,539 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-20 09:57:21,540 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-20 09:57:21,540 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-20 09:57:21,541 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-20 09:57:21,542 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-20 09:57:21,543 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-20 09:57:21,544 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-20 09:57:21,545 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-20 09:57:21,547 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-20 09:57:21,549 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-20 09:57:21,550 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-20 09:57:21,551 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-20 09:57:21,552 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-20 09:57:21,555 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-20 09:57:21,555 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-20 09:57:21,555 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-20 09:57:21,556 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-20 09:57:21,557 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-20 09:57:21,558 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-20 09:57:21,559 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-20 09:57:21,560 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-20 09:57:21,560 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-20 09:57:21,561 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-20 09:57:21,561 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-20 09:57:21,561 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-20 09:57:21,562 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-20 09:57:21,563 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-20 09:57:21,563 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-01-20 09:57:21,588 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-20 09:57:21,589 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-20 09:57:21,591 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-20 09:57:21,591 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-20 09:57:21,592 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-20 09:57:21,592 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-20 09:57:21,592 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-20 09:57:21,592 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-20 09:57:21,593 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-20 09:57:21,593 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-20 09:57:21,593 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-20 09:57:21,593 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-20 09:57:21,593 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-20 09:57:21,594 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-20 09:57:21,594 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-20 09:57:21,594 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-20 09:57:21,596 INFO L133 SettingsManager]: * Use SBE=true [2019-01-20 09:57:21,596 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-20 09:57:21,596 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-20 09:57:21,596 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-20 09:57:21,596 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-20 09:57:21,597 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-20 09:57:21,597 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-20 09:57:21,598 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-20 09:57:21,598 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-20 09:57:21,598 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-20 09:57:21,598 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-20 09:57:21,598 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-20 09:57:21,599 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-20 09:57:21,599 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-20 09:57:21,599 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-20 09:57:21,599 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-20 09:57:21,599 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-20 09:57:21,599 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-20 09:57:21,600 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-20 09:57:21,600 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-20 09:57:21,600 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-20 09:57:21,601 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-20 09:57:21,601 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-20 09:57:21,601 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-20 09:57:21,648 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-20 09:57:21,662 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-20 09:57:21,668 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-20 09:57:21,669 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-20 09:57:21,670 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-20 09:57:21,671 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-01-20 09:57:21,672 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array3.i_4.bpl' [2019-01-20 09:57:21,727 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-20 09:57:21,729 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-20 09:57:21,731 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-20 09:57:21,731 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-20 09:57:21,731 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-20 09:57:21,748 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 20.01 09:57:21" (1/1) ... [2019-01-20 09:57:21,761 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 20.01 09:57:21" (1/1) ... [2019-01-20 09:57:21,772 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-20 09:57:21,773 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-20 09:57:21,773 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-20 09:57:21,773 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-20 09:57:21,785 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 09:57:21" (1/1) ... [2019-01-20 09:57:21,786 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 09:57:21" (1/1) ... [2019-01-20 09:57:21,787 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 09:57:21" (1/1) ... [2019-01-20 09:57:21,787 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 09:57:21" (1/1) ... [2019-01-20 09:57:21,791 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 09:57:21" (1/1) ... [2019-01-20 09:57:21,794 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 09:57:21" (1/1) ... [2019-01-20 09:57:21,795 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 09:57:21" (1/1) ... [2019-01-20 09:57:21,796 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-20 09:57:21,797 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-20 09:57:21,797 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-20 09:57:21,798 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-20 09:57:21,798 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 09:57:21" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-20 09:57:21,874 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-20 09:57:21,874 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-20 09:57:22,163 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-20 09:57:22,164 INFO L286 CfgBuilder]: Removed 2 assue(true) statements. [2019-01-20 09:57:22,165 INFO L202 PluginConnector]: Adding new model array3.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 09:57:22 BoogieIcfgContainer [2019-01-20 09:57:22,165 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-20 09:57:22,166 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-20 09:57:22,167 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-20 09:57:22,170 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-20 09:57:22,170 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 09:57:21" (1/2) ... [2019-01-20 09:57:22,171 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@267c676c and model type array3.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 09:57:22, skipping insertion in model container [2019-01-20 09:57:22,171 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 09:57:22" (2/2) ... [2019-01-20 09:57:22,173 INFO L112 eAbstractionObserver]: Analyzing ICFG array3.i_4.bpl [2019-01-20 09:57:22,183 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-20 09:57:22,190 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-20 09:57:22,204 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-20 09:57:22,234 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-20 09:57:22,235 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-20 09:57:22,235 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-20 09:57:22,235 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-20 09:57:22,235 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-20 09:57:22,235 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-20 09:57:22,236 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-20 09:57:22,236 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-20 09:57:22,250 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2019-01-20 09:57:22,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 09:57:22,256 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:22,257 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 09:57:22,260 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:22,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:22,266 INFO L82 PathProgramCache]: Analyzing trace with hash 928714, now seen corresponding path program 1 times [2019-01-20 09:57:22,268 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:22,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:22,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:22,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:22,308 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:22,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:22,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:22,386 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-20 09:57:22,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-20 09:57:22,387 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 09:57:22,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-20 09:57:22,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-20 09:57:22,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-20 09:57:22,404 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2019-01-20 09:57:22,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:22,504 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2019-01-20 09:57:22,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-20 09:57:22,506 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-01-20 09:57:22,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:22,516 INFO L225 Difference]: With dead ends: 12 [2019-01-20 09:57:22,517 INFO L226 Difference]: Without dead ends: 7 [2019-01-20 09:57:22,520 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-01-20 09:57:22,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-01-20 09:57:22,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-01-20 09:57:22,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-20 09:57:22,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-01-20 09:57:22,551 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 4 [2019-01-20 09:57:22,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:22,551 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-01-20 09:57:22,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-20 09:57:22,552 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2019-01-20 09:57:22,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 09:57:22,552 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:22,552 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 09:57:22,553 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:22,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:22,553 INFO L82 PathProgramCache]: Analyzing trace with hash 894131125, now seen corresponding path program 1 times [2019-01-20 09:57:22,553 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:22,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:22,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:22,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:22,555 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:22,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:22,714 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 09:57:22,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:22,715 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:22,717 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 09:57:22,719 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [12], [14], [16] [2019-01-20 09:57:22,771 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 09:57:22,772 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 09:57:23,006 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 09:57:23,007 INFO L272 AbstractInterpreter]: Visited 6 different actions 18 times. Merged at 4 different actions 9 times. Never widened. Performed 198 root evaluator evaluations with a maximum evaluation depth of 6. Performed 198 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 09:57:23,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:23,018 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 09:57:23,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:23,019 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:23,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:23,043 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:57:23,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:23,073 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:23,101 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 09:57:23,101 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:23,157 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 09:57:23,178 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:23,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2019-01-20 09:57:23,179 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:23,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-20 09:57:23,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-20 09:57:23,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-20 09:57:23,180 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 4 states. [2019-01-20 09:57:23,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:23,263 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2019-01-20 09:57:23,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-20 09:57:23,263 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-01-20 09:57:23,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:23,264 INFO L225 Difference]: With dead ends: 13 [2019-01-20 09:57:23,264 INFO L226 Difference]: Without dead ends: 9 [2019-01-20 09:57:23,265 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-20 09:57:23,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-01-20 09:57:23,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-01-20 09:57:23,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-20 09:57:23,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-01-20 09:57:23,269 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2019-01-20 09:57:23,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:23,269 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-01-20 09:57:23,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-20 09:57:23,269 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2019-01-20 09:57:23,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-20 09:57:23,270 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:23,270 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2019-01-20 09:57:23,270 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:23,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:23,270 INFO L82 PathProgramCache]: Analyzing trace with hash 315556586, now seen corresponding path program 2 times [2019-01-20 09:57:23,270 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:23,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:23,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:23,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:23,272 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:23,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:23,345 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-20 09:57:23,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:23,345 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:23,345 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:23,346 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:23,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:23,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 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:23,355 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:57:23,355 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:57:23,383 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-20 09:57:23,384 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:57:23,386 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:23,391 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-20 09:57:23,391 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:23,529 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-20 09:57:23,559 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:23,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2019-01-20 09:57:23,559 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:23,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-20 09:57:23,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-20 09:57:23,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-20 09:57:23,561 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 5 states. [2019-01-20 09:57:23,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:23,770 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2019-01-20 09:57:23,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-20 09:57:23,770 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-01-20 09:57:23,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:23,771 INFO L225 Difference]: With dead ends: 16 [2019-01-20 09:57:23,771 INFO L226 Difference]: Without dead ends: 11 [2019-01-20 09:57:23,772 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-20 09:57:23,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-01-20 09:57:23,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-01-20 09:57:23,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-20 09:57:23,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2019-01-20 09:57:23,775 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 8 [2019-01-20 09:57:23,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:23,776 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-01-20 09:57:23,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-20 09:57:23,776 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2019-01-20 09:57:23,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-20 09:57:23,777 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:23,777 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1] [2019-01-20 09:57:23,777 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:23,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:23,778 INFO L82 PathProgramCache]: Analyzing trace with hash -175395819, now seen corresponding path program 3 times [2019-01-20 09:57:23,778 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:23,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:23,779 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:57:23,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:23,780 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:23,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:23,935 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-20 09:57:23,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:23,936 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:23,937 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:23,937 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:23,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:23,938 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:23,949 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 09:57:23,949 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 09:57:23,980 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 09:57:23,981 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:57:23,982 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:23,987 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-20 09:57:23,988 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:24,155 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-20 09:57:24,187 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:24,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2019-01-20 09:57:24,187 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:24,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-20 09:57:24,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-20 09:57:24,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-20 09:57:24,188 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 6 states. [2019-01-20 09:57:24,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:24,254 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2019-01-20 09:57:24,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 09:57:24,255 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-01-20 09:57:24,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:24,256 INFO L225 Difference]: With dead ends: 19 [2019-01-20 09:57:24,256 INFO L226 Difference]: Without dead ends: 13 [2019-01-20 09:57:24,257 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-01-20 09:57:24,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-01-20 09:57:24,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-01-20 09:57:24,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-20 09:57:24,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-01-20 09:57:24,260 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2019-01-20 09:57:24,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:24,261 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-01-20 09:57:24,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-20 09:57:24,261 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-01-20 09:57:24,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-20 09:57:24,261 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:24,261 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1] [2019-01-20 09:57:24,262 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:24,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:24,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1258544630, now seen corresponding path program 4 times [2019-01-20 09:57:24,262 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:24,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:24,263 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:57:24,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:24,263 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:24,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:24,401 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-01-20 09:57:24,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:24,402 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:24,402 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:24,403 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:24,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:24,403 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:24,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:24,412 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:57:24,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:24,426 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:24,437 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-01-20 09:57:24,437 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:24,567 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-01-20 09:57:24,588 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:24,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2019-01-20 09:57:24,589 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:24,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-20 09:57:24,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-20 09:57:24,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-20 09:57:24,590 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 7 states. [2019-01-20 09:57:24,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:24,695 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2019-01-20 09:57:24,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 09:57:24,696 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2019-01-20 09:57:24,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:24,697 INFO L225 Difference]: With dead ends: 22 [2019-01-20 09:57:24,697 INFO L226 Difference]: Without dead ends: 15 [2019-01-20 09:57:24,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-20 09:57:24,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-01-20 09:57:24,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-01-20 09:57:24,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-20 09:57:24,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-01-20 09:57:24,706 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2019-01-20 09:57:24,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:24,706 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-01-20 09:57:24,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-20 09:57:24,706 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2019-01-20 09:57:24,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-20 09:57:24,707 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:24,707 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1] [2019-01-20 09:57:24,707 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:24,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:24,708 INFO L82 PathProgramCache]: Analyzing trace with hash -400886667, now seen corresponding path program 5 times [2019-01-20 09:57:24,709 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:24,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:24,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:24,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:24,710 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:24,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:24,977 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-20 09:57:24,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:24,978 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:24,978 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:24,979 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:24,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:24,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 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:24,989 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:57:24,989 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:57:25,024 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-20 09:57:25,024 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:57:25,026 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:25,033 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-20 09:57:25,033 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:25,194 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-20 09:57:25,212 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:25,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2019-01-20 09:57:25,213 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:25,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 09:57:25,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 09:57:25,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-01-20 09:57:25,214 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 8 states. [2019-01-20 09:57:25,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:25,255 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2019-01-20 09:57:25,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 09:57:25,257 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-01-20 09:57:25,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:25,259 INFO L225 Difference]: With dead ends: 25 [2019-01-20 09:57:25,259 INFO L226 Difference]: Without dead ends: 17 [2019-01-20 09:57:25,260 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-01-20 09:57:25,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-20 09:57:25,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-01-20 09:57:25,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-20 09:57:25,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-01-20 09:57:25,264 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 14 [2019-01-20 09:57:25,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:25,264 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-01-20 09:57:25,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 09:57:25,265 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-01-20 09:57:25,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-20 09:57:25,265 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:25,265 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1] [2019-01-20 09:57:25,266 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:25,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:25,266 INFO L82 PathProgramCache]: Analyzing trace with hash -10778326, now seen corresponding path program 6 times [2019-01-20 09:57:25,266 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:25,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:25,267 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:57:25,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:25,267 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:25,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:25,359 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-01-20 09:57:25,360 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:25,360 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:25,360 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:25,360 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:25,360 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:25,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 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:25,370 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 09:57:25,371 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 09:57:25,400 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 09:57:25,400 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:57:25,402 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:25,408 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-01-20 09:57:25,408 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:25,667 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-01-20 09:57:25,687 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:25,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2019-01-20 09:57:25,687 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:25,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-20 09:57:25,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-20 09:57:25,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-01-20 09:57:25,688 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 9 states. [2019-01-20 09:57:25,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:25,765 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2019-01-20 09:57:25,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 09:57:25,766 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2019-01-20 09:57:25,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:25,766 INFO L225 Difference]: With dead ends: 28 [2019-01-20 09:57:25,766 INFO L226 Difference]: Without dead ends: 19 [2019-01-20 09:57:25,767 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-01-20 09:57:25,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-01-20 09:57:25,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-01-20 09:57:25,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-20 09:57:25,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2019-01-20 09:57:25,772 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 16 [2019-01-20 09:57:25,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:25,772 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-01-20 09:57:25,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-20 09:57:25,772 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2019-01-20 09:57:25,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-20 09:57:25,773 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:25,773 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1] [2019-01-20 09:57:25,773 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:25,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:25,774 INFO L82 PathProgramCache]: Analyzing trace with hash 701707477, now seen corresponding path program 7 times [2019-01-20 09:57:25,774 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:25,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:25,775 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:57:25,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:25,775 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:25,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:25,907 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-01-20 09:57:25,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:25,908 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:25,908 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:25,908 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:25,909 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:25,909 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:25,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:25,917 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:57:25,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:25,946 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:25,952 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-01-20 09:57:25,952 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:26,167 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-01-20 09:57:26,186 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:26,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2019-01-20 09:57:26,186 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:26,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 09:57:26,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 09:57:26,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-01-20 09:57:26,188 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 10 states. [2019-01-20 09:57:26,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:26,231 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2019-01-20 09:57:26,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-20 09:57:26,233 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2019-01-20 09:57:26,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:26,234 INFO L225 Difference]: With dead ends: 31 [2019-01-20 09:57:26,234 INFO L226 Difference]: Without dead ends: 21 [2019-01-20 09:57:26,235 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-01-20 09:57:26,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-01-20 09:57:26,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-01-20 09:57:26,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-20 09:57:26,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-01-20 09:57:26,239 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 18 [2019-01-20 09:57:26,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:26,240 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-01-20 09:57:26,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 09:57:26,240 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2019-01-20 09:57:26,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-20 09:57:26,241 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:26,241 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1] [2019-01-20 09:57:26,241 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:26,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:26,241 INFO L82 PathProgramCache]: Analyzing trace with hash -718063542, now seen corresponding path program 8 times [2019-01-20 09:57:26,241 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:26,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:26,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:26,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:26,243 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:26,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:26,365 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-01-20 09:57:26,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:26,365 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:26,366 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:26,366 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:26,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:26,366 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:26,383 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:57:26,383 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:57:26,404 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-01-20 09:57:26,404 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:57:26,407 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:26,415 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-01-20 09:57:26,415 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:26,642 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-01-20 09:57:26,663 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:26,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2019-01-20 09:57:26,664 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:26,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-20 09:57:26,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-20 09:57:26,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-01-20 09:57:26,665 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 11 states. [2019-01-20 09:57:26,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:26,822 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2019-01-20 09:57:26,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-20 09:57:26,823 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2019-01-20 09:57:26,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:26,824 INFO L225 Difference]: With dead ends: 34 [2019-01-20 09:57:26,824 INFO L226 Difference]: Without dead ends: 23 [2019-01-20 09:57:26,824 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-01-20 09:57:26,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-01-20 09:57:26,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-01-20 09:57:26,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-20 09:57:26,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-01-20 09:57:26,828 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 20 [2019-01-20 09:57:26,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:26,829 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-01-20 09:57:26,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-20 09:57:26,829 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-01-20 09:57:26,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-20 09:57:26,830 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:26,830 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1] [2019-01-20 09:57:26,830 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:26,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:26,831 INFO L82 PathProgramCache]: Analyzing trace with hash -317821643, now seen corresponding path program 9 times [2019-01-20 09:57:26,831 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:26,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:26,832 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:57:26,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:26,832 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:26,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:27,057 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-01-20 09:57:27,057 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:27,128 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:27,128 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:27,128 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:27,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:27,128 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:27,137 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 09:57:27,138 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 09:57:27,188 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 09:57:27,188 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:57:27,191 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:27,197 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-01-20 09:57:27,198 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:27,795 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-01-20 09:57:27,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:27,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2019-01-20 09:57:27,814 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:27,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-20 09:57:27,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-20 09:57:27,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-01-20 09:57:27,816 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 12 states. [2019-01-20 09:57:27,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:27,886 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2019-01-20 09:57:27,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-20 09:57:27,894 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2019-01-20 09:57:27,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:27,895 INFO L225 Difference]: With dead ends: 37 [2019-01-20 09:57:27,895 INFO L226 Difference]: Without dead ends: 25 [2019-01-20 09:57:27,896 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-01-20 09:57:27,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-01-20 09:57:27,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-01-20 09:57:27,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-20 09:57:27,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2019-01-20 09:57:27,902 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 22 [2019-01-20 09:57:27,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:27,902 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-01-20 09:57:27,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-20 09:57:27,902 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2019-01-20 09:57:27,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-20 09:57:27,903 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:27,903 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1] [2019-01-20 09:57:27,903 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:27,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:27,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1145646954, now seen corresponding path program 10 times [2019-01-20 09:57:27,908 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:27,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:27,909 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:57:27,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:27,910 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:27,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:28,255 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-01-20 09:57:28,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:28,255 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:28,255 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:28,256 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:28,256 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:28,256 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:28,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:28,273 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:57:28,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:28,291 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:28,298 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-01-20 09:57:28,298 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:28,907 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-01-20 09:57:28,926 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:28,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2019-01-20 09:57:28,927 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:28,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-20 09:57:28,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-20 09:57:28,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-01-20 09:57:28,928 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 13 states. [2019-01-20 09:57:28,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:28,997 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2019-01-20 09:57:28,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-20 09:57:28,998 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2019-01-20 09:57:28,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:28,999 INFO L225 Difference]: With dead ends: 40 [2019-01-20 09:57:28,999 INFO L226 Difference]: Without dead ends: 27 [2019-01-20 09:57:29,000 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-01-20 09:57:29,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-01-20 09:57:29,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-01-20 09:57:29,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-20 09:57:29,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-01-20 09:57:29,004 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 24 [2019-01-20 09:57:29,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:29,004 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-01-20 09:57:29,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-20 09:57:29,004 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-01-20 09:57:29,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-20 09:57:29,005 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:29,005 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1] [2019-01-20 09:57:29,005 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:29,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:29,006 INFO L82 PathProgramCache]: Analyzing trace with hash 430349717, now seen corresponding path program 11 times [2019-01-20 09:57:29,006 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:29,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:29,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:29,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:29,007 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:29,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:29,180 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-01-20 09:57:29,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:29,181 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:29,181 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:29,181 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:29,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:29,182 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:29,191 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:57:29,192 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:57:29,237 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-01-20 09:57:29,237 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:57:29,239 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:29,246 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-01-20 09:57:29,247 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:29,489 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-01-20 09:57:29,518 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:29,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2019-01-20 09:57:29,519 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:29,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-20 09:57:29,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-20 09:57:29,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-01-20 09:57:29,520 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 14 states. [2019-01-20 09:57:29,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:29,633 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2019-01-20 09:57:29,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-20 09:57:29,633 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2019-01-20 09:57:29,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:29,634 INFO L225 Difference]: With dead ends: 43 [2019-01-20 09:57:29,635 INFO L226 Difference]: Without dead ends: 29 [2019-01-20 09:57:29,636 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-01-20 09:57:29,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-20 09:57:29,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-01-20 09:57:29,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-20 09:57:29,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-01-20 09:57:29,641 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 26 [2019-01-20 09:57:29,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:29,641 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-01-20 09:57:29,641 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-20 09:57:29,641 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-01-20 09:57:29,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-20 09:57:29,642 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:29,642 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1] [2019-01-20 09:57:29,643 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:29,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:29,643 INFO L82 PathProgramCache]: Analyzing trace with hash -454857078, now seen corresponding path program 12 times [2019-01-20 09:57:29,643 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:29,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:29,644 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:57:29,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:29,644 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:29,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:29,788 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-01-20 09:57:29,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:29,788 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:29,788 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:29,789 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:29,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:29,789 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:29,798 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 09:57:29,798 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 09:57:29,832 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 09:57:29,832 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:57:29,835 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:29,841 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-01-20 09:57:29,842 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:30,185 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-01-20 09:57:30,205 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:30,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2019-01-20 09:57:30,206 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:30,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-20 09:57:30,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-20 09:57:30,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-01-20 09:57:30,207 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 15 states. [2019-01-20 09:57:30,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:30,343 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2019-01-20 09:57:30,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-20 09:57:30,343 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2019-01-20 09:57:30,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:30,344 INFO L225 Difference]: With dead ends: 46 [2019-01-20 09:57:30,345 INFO L226 Difference]: Without dead ends: 31 [2019-01-20 09:57:30,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-01-20 09:57:30,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-01-20 09:57:30,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-01-20 09:57:30,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-20 09:57:30,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2019-01-20 09:57:30,351 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 28 [2019-01-20 09:57:30,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:30,351 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2019-01-20 09:57:30,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-20 09:57:30,352 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2019-01-20 09:57:30,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-20 09:57:30,352 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:30,353 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1] [2019-01-20 09:57:30,353 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:30,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:30,353 INFO L82 PathProgramCache]: Analyzing trace with hash -319437323, now seen corresponding path program 13 times [2019-01-20 09:57:30,353 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:30,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:30,354 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:57:30,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:30,355 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:30,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:30,628 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-01-20 09:57:30,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:30,629 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:30,629 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:30,629 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:30,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:30,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 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:30,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:30,640 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:57:30,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:30,679 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:30,687 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-01-20 09:57:30,687 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:30,996 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-01-20 09:57:31,015 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:31,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2019-01-20 09:57:31,015 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:31,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-20 09:57:31,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-20 09:57:31,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-01-20 09:57:31,016 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 16 states. [2019-01-20 09:57:31,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:31,212 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2019-01-20 09:57:31,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-20 09:57:31,212 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2019-01-20 09:57:31,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:31,213 INFO L225 Difference]: With dead ends: 49 [2019-01-20 09:57:31,213 INFO L226 Difference]: Without dead ends: 33 [2019-01-20 09:57:31,214 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-01-20 09:57:31,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-01-20 09:57:31,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-01-20 09:57:31,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-20 09:57:31,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2019-01-20 09:57:31,220 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 30 [2019-01-20 09:57:31,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:31,220 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2019-01-20 09:57:31,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-20 09:57:31,220 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2019-01-20 09:57:31,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-20 09:57:31,221 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:31,221 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1] [2019-01-20 09:57:31,221 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:31,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:31,221 INFO L82 PathProgramCache]: Analyzing trace with hash 969405866, now seen corresponding path program 14 times [2019-01-20 09:57:31,221 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:31,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:31,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:31,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:31,222 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:31,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:31,433 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-01-20 09:57:31,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:31,434 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:31,434 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:31,434 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:31,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:31,434 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:31,444 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:57:31,444 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:57:31,487 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-01-20 09:57:31,487 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:57:31,489 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:31,497 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-01-20 09:57:31,497 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:31,900 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-01-20 09:57:31,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:31,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2019-01-20 09:57:31,920 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:31,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-20 09:57:31,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-20 09:57:31,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-01-20 09:57:31,921 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 17 states. [2019-01-20 09:57:31,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:31,977 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2019-01-20 09:57:31,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-20 09:57:31,978 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2019-01-20 09:57:31,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:31,979 INFO L225 Difference]: With dead ends: 52 [2019-01-20 09:57:31,979 INFO L226 Difference]: Without dead ends: 35 [2019-01-20 09:57:31,980 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-01-20 09:57:31,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-20 09:57:31,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-01-20 09:57:31,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-20 09:57:31,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2019-01-20 09:57:31,984 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 32 [2019-01-20 09:57:31,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:31,984 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2019-01-20 09:57:31,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-20 09:57:31,984 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2019-01-20 09:57:31,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-20 09:57:31,985 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:31,985 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1] [2019-01-20 09:57:31,985 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:31,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:31,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1714035115, now seen corresponding path program 15 times [2019-01-20 09:57:31,986 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:31,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:31,987 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:57:31,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:31,987 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:31,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:32,261 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-01-20 09:57:32,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:32,262 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:32,262 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:32,262 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:32,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:32,262 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:32,279 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 09:57:32,279 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 09:57:32,318 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 09:57:32,318 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:57:32,321 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:32,337 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-01-20 09:57:32,337 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:32,825 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-01-20 09:57:32,846 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:32,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2019-01-20 09:57:32,846 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:32,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-20 09:57:32,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-20 09:57:32,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-01-20 09:57:32,847 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 18 states. [2019-01-20 09:57:32,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:32,940 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2019-01-20 09:57:32,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-20 09:57:32,941 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 34 [2019-01-20 09:57:32,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:32,942 INFO L225 Difference]: With dead ends: 55 [2019-01-20 09:57:32,942 INFO L226 Difference]: Without dead ends: 37 [2019-01-20 09:57:32,943 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-01-20 09:57:32,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-01-20 09:57:32,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-01-20 09:57:32,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-20 09:57:32,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2019-01-20 09:57:32,947 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 34 [2019-01-20 09:57:32,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:32,948 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2019-01-20 09:57:32,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-20 09:57:32,948 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2019-01-20 09:57:32,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-20 09:57:32,949 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:32,949 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1] [2019-01-20 09:57:32,949 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:32,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:32,949 INFO L82 PathProgramCache]: Analyzing trace with hash 272417994, now seen corresponding path program 16 times [2019-01-20 09:57:32,950 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:32,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:32,950 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:57:32,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:32,951 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:32,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:33,596 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-01-20 09:57:33,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:33,597 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:33,597 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:33,597 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:33,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:33,598 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:33,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:33,608 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:57:33,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:33,635 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:33,643 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-01-20 09:57:33,643 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:34,693 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-01-20 09:57:34,713 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:34,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2019-01-20 09:57:34,714 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:34,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-01-20 09:57:34,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-01-20 09:57:34,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-01-20 09:57:34,715 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 19 states. [2019-01-20 09:57:34,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:34,789 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2019-01-20 09:57:34,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-20 09:57:34,790 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 36 [2019-01-20 09:57:34,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:34,791 INFO L225 Difference]: With dead ends: 58 [2019-01-20 09:57:34,791 INFO L226 Difference]: Without dead ends: 39 [2019-01-20 09:57:34,792 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-01-20 09:57:34,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-01-20 09:57:34,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-01-20 09:57:34,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-20 09:57:34,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2019-01-20 09:57:34,797 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 36 [2019-01-20 09:57:34,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:34,798 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2019-01-20 09:57:34,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-01-20 09:57:34,798 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2019-01-20 09:57:34,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-01-20 09:57:34,798 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:34,799 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1] [2019-01-20 09:57:34,799 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:34,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:34,799 INFO L82 PathProgramCache]: Analyzing trace with hash -392102219, now seen corresponding path program 17 times [2019-01-20 09:57:34,799 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:34,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:34,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:34,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:34,800 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:34,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:35,597 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-01-20 09:57:35,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:35,598 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:35,598 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:35,598 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:35,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:35,598 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:35,606 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:57:35,607 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:57:35,652 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-01-20 09:57:35,653 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:57:35,656 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:35,663 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-01-20 09:57:35,663 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:36,627 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-01-20 09:57:36,649 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:36,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2019-01-20 09:57:36,649 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:36,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-20 09:57:36,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-20 09:57:36,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-01-20 09:57:36,650 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 20 states. [2019-01-20 09:57:36,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:36,725 INFO L93 Difference]: Finished difference Result 61 states and 64 transitions. [2019-01-20 09:57:36,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-20 09:57:36,726 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 38 [2019-01-20 09:57:36,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:36,726 INFO L225 Difference]: With dead ends: 61 [2019-01-20 09:57:36,727 INFO L226 Difference]: Without dead ends: 41 [2019-01-20 09:57:36,728 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-01-20 09:57:36,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-20 09:57:36,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-01-20 09:57:36,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-20 09:57:36,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2019-01-20 09:57:36,733 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 38 [2019-01-20 09:57:36,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:36,733 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2019-01-20 09:57:36,733 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-20 09:57:36,733 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2019-01-20 09:57:36,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-01-20 09:57:36,734 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:36,734 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1] [2019-01-20 09:57:36,734 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:36,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:36,735 INFO L82 PathProgramCache]: Analyzing trace with hash -536355862, now seen corresponding path program 18 times [2019-01-20 09:57:36,735 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:36,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:36,736 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:57:36,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:36,736 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:36,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:37,574 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-01-20 09:57:37,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:37,575 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:37,575 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:37,575 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:37,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:37,575 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:37,592 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 09:57:37,593 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 09:57:37,642 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 09:57:37,642 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:57:37,645 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:37,654 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-01-20 09:57:37,655 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:38,181 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-01-20 09:57:38,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:38,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2019-01-20 09:57:38,201 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:38,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-01-20 09:57:38,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-20 09:57:38,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-01-20 09:57:38,202 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 21 states. [2019-01-20 09:57:38,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:38,374 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2019-01-20 09:57:38,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-20 09:57:38,374 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 40 [2019-01-20 09:57:38,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:38,374 INFO L225 Difference]: With dead ends: 64 [2019-01-20 09:57:38,375 INFO L226 Difference]: Without dead ends: 43 [2019-01-20 09:57:38,375 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-01-20 09:57:38,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-01-20 09:57:38,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-01-20 09:57:38,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-20 09:57:38,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2019-01-20 09:57:38,380 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 40 [2019-01-20 09:57:38,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:38,380 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2019-01-20 09:57:38,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-01-20 09:57:38,380 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2019-01-20 09:57:38,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-01-20 09:57:38,381 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:38,381 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1] [2019-01-20 09:57:38,381 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:38,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:38,381 INFO L82 PathProgramCache]: Analyzing trace with hash -684650731, now seen corresponding path program 19 times [2019-01-20 09:57:38,381 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:38,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:38,382 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:57:38,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:38,382 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:38,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:38,712 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-01-20 09:57:38,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:38,712 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:38,712 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:38,712 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:38,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:38,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 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:38,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:38,722 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:57:38,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:38,753 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:38,762 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-01-20 09:57:38,762 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:39,541 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-01-20 09:57:39,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:39,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2019-01-20 09:57:39,562 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:39,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-20 09:57:39,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-20 09:57:39,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-01-20 09:57:39,563 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 22 states. [2019-01-20 09:57:39,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:39,639 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2019-01-20 09:57:39,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-20 09:57:39,639 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 42 [2019-01-20 09:57:39,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:39,640 INFO L225 Difference]: With dead ends: 67 [2019-01-20 09:57:39,640 INFO L226 Difference]: Without dead ends: 45 [2019-01-20 09:57:39,642 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-01-20 09:57:39,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-01-20 09:57:39,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-01-20 09:57:39,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-20 09:57:39,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2019-01-20 09:57:39,646 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 42 [2019-01-20 09:57:39,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:39,646 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2019-01-20 09:57:39,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-20 09:57:39,646 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2019-01-20 09:57:39,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-20 09:57:39,647 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:39,647 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1] [2019-01-20 09:57:39,647 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:39,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:39,648 INFO L82 PathProgramCache]: Analyzing trace with hash 728709898, now seen corresponding path program 20 times [2019-01-20 09:57:39,648 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:39,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:39,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:39,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:39,649 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:39,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:39,990 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-01-20 09:57:39,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:39,990 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:39,990 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:39,991 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:39,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:39,991 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:40,001 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:57:40,001 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:57:40,076 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-01-20 09:57:40,076 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:57:40,079 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:40,088 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-01-20 09:57:40,088 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:40,584 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-01-20 09:57:40,602 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:40,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2019-01-20 09:57:40,603 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:40,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-20 09:57:40,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-20 09:57:40,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-01-20 09:57:40,605 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 23 states. [2019-01-20 09:57:40,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:40,679 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2019-01-20 09:57:40,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-20 09:57:40,679 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 44 [2019-01-20 09:57:40,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:40,680 INFO L225 Difference]: With dead ends: 70 [2019-01-20 09:57:40,680 INFO L226 Difference]: Without dead ends: 47 [2019-01-20 09:57:40,682 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-01-20 09:57:40,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-20 09:57:40,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-01-20 09:57:40,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-20 09:57:40,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2019-01-20 09:57:40,685 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 44 [2019-01-20 09:57:40,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:40,686 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2019-01-20 09:57:40,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-20 09:57:40,686 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2019-01-20 09:57:40,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-01-20 09:57:40,687 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:40,687 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1] [2019-01-20 09:57:40,687 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:40,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:40,687 INFO L82 PathProgramCache]: Analyzing trace with hash 954210165, now seen corresponding path program 21 times [2019-01-20 09:57:40,687 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:40,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:40,688 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:57:40,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:40,688 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:40,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:41,516 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-01-20 09:57:41,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:41,516 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:41,516 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:41,516 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:41,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:41,516 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:41,525 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 09:57:41,525 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 09:57:41,558 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 09:57:41,559 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:57:41,561 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:41,570 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-01-20 09:57:41,570 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:42,133 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-01-20 09:57:42,152 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:42,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2019-01-20 09:57:42,152 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:42,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-01-20 09:57:42,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-20 09:57:42,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-01-20 09:57:42,154 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 24 states. [2019-01-20 09:57:42,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:42,271 INFO L93 Difference]: Finished difference Result 73 states and 76 transitions. [2019-01-20 09:57:42,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-01-20 09:57:42,274 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 46 [2019-01-20 09:57:42,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:42,275 INFO L225 Difference]: With dead ends: 73 [2019-01-20 09:57:42,275 INFO L226 Difference]: Without dead ends: 49 [2019-01-20 09:57:42,276 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-01-20 09:57:42,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-01-20 09:57:42,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-01-20 09:57:42,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-01-20 09:57:42,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2019-01-20 09:57:42,280 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 46 [2019-01-20 09:57:42,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:42,280 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2019-01-20 09:57:42,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-01-20 09:57:42,280 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2019-01-20 09:57:42,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-20 09:57:42,281 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:42,281 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1] [2019-01-20 09:57:42,281 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:42,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:42,282 INFO L82 PathProgramCache]: Analyzing trace with hash -549920214, now seen corresponding path program 22 times [2019-01-20 09:57:42,282 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:42,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:42,283 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:57:42,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:42,283 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:42,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:42,554 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-01-20 09:57:42,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:42,555 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:42,555 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:42,555 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:42,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:42,555 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:42,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:42,564 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:57:42,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:42,600 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:42,607 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-01-20 09:57:42,607 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:43,277 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-01-20 09:57:43,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:43,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2019-01-20 09:57:43,297 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:43,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-01-20 09:57:43,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-01-20 09:57:43,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-01-20 09:57:43,298 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 25 states. [2019-01-20 09:57:43,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:43,421 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2019-01-20 09:57:43,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-01-20 09:57:43,424 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 48 [2019-01-20 09:57:43,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:43,425 INFO L225 Difference]: With dead ends: 76 [2019-01-20 09:57:43,425 INFO L226 Difference]: Without dead ends: 51 [2019-01-20 09:57:43,426 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-01-20 09:57:43,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-01-20 09:57:43,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-01-20 09:57:43,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-20 09:57:43,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2019-01-20 09:57:43,430 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 48 [2019-01-20 09:57:43,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:43,430 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2019-01-20 09:57:43,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-01-20 09:57:43,431 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2019-01-20 09:57:43,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-20 09:57:43,431 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:43,431 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1] [2019-01-20 09:57:43,432 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:43,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:43,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1451759573, now seen corresponding path program 23 times [2019-01-20 09:57:43,432 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:43,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:43,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:43,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:43,433 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:43,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:44,176 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-01-20 09:57:44,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:44,177 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:44,177 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:44,178 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:44,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:44,178 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:44,186 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:57:44,186 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:57:44,268 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-01-20 09:57:44,268 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:57:44,271 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:44,279 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-01-20 09:57:44,279 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:44,996 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-01-20 09:57:45,014 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:45,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2019-01-20 09:57:45,015 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:45,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-01-20 09:57:45,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-01-20 09:57:45,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-01-20 09:57:45,016 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 26 states. [2019-01-20 09:57:45,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:45,105 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2019-01-20 09:57:45,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-20 09:57:45,105 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 50 [2019-01-20 09:57:45,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:45,106 INFO L225 Difference]: With dead ends: 79 [2019-01-20 09:57:45,106 INFO L226 Difference]: Without dead ends: 53 [2019-01-20 09:57:45,107 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-01-20 09:57:45,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-20 09:57:45,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-01-20 09:57:45,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-20 09:57:45,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2019-01-20 09:57:45,111 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 50 [2019-01-20 09:57:45,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:45,111 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2019-01-20 09:57:45,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-01-20 09:57:45,111 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2019-01-20 09:57:45,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-01-20 09:57:45,112 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:45,112 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1] [2019-01-20 09:57:45,112 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:45,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:45,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1297428150, now seen corresponding path program 24 times [2019-01-20 09:57:45,112 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:45,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:45,113 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:57:45,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:45,113 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:45,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:45,579 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-01-20 09:57:45,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:45,579 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:45,579 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:45,579 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:45,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:45,580 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:45,590 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 09:57:45,590 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 09:57:45,634 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 09:57:45,634 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:57:45,636 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:45,642 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-01-20 09:57:45,642 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:46,463 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-01-20 09:57:46,482 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:46,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2019-01-20 09:57:46,482 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:46,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-01-20 09:57:46,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-01-20 09:57:46,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-01-20 09:57:46,483 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 27 states. [2019-01-20 09:57:46,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:46,590 INFO L93 Difference]: Finished difference Result 82 states and 85 transitions. [2019-01-20 09:57:46,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-01-20 09:57:46,590 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 52 [2019-01-20 09:57:46,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:46,591 INFO L225 Difference]: With dead ends: 82 [2019-01-20 09:57:46,591 INFO L226 Difference]: Without dead ends: 55 [2019-01-20 09:57:46,593 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-01-20 09:57:46,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-20 09:57:46,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-01-20 09:57:46,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-01-20 09:57:46,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2019-01-20 09:57:46,597 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 52 [2019-01-20 09:57:46,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:46,597 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2019-01-20 09:57:46,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-01-20 09:57:46,597 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2019-01-20 09:57:46,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-20 09:57:46,598 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:46,598 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1] [2019-01-20 09:57:46,598 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:46,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:46,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1904013259, now seen corresponding path program 25 times [2019-01-20 09:57:46,599 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:46,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:46,599 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:57:46,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:46,600 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:46,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:47,002 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-01-20 09:57:47,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:47,002 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:47,002 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:47,002 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:47,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:47,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 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:47,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:47,011 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:57:47,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:47,051 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:47,058 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-01-20 09:57:47,058 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:48,240 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-01-20 09:57:48,259 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:48,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2019-01-20 09:57:48,259 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:48,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-01-20 09:57:48,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-01-20 09:57:48,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-01-20 09:57:48,261 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 28 states. [2019-01-20 09:57:48,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:48,349 INFO L93 Difference]: Finished difference Result 85 states and 88 transitions. [2019-01-20 09:57:48,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-01-20 09:57:48,349 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 54 [2019-01-20 09:57:48,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:48,350 INFO L225 Difference]: With dead ends: 85 [2019-01-20 09:57:48,350 INFO L226 Difference]: Without dead ends: 57 [2019-01-20 09:57:48,352 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-01-20 09:57:48,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-01-20 09:57:48,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-01-20 09:57:48,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-01-20 09:57:48,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2019-01-20 09:57:48,355 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 54 [2019-01-20 09:57:48,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:48,356 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2019-01-20 09:57:48,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-01-20 09:57:48,356 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2019-01-20 09:57:48,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-20 09:57:48,356 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:48,357 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1] [2019-01-20 09:57:48,357 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:48,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:48,357 INFO L82 PathProgramCache]: Analyzing trace with hash -2020931478, now seen corresponding path program 26 times [2019-01-20 09:57:48,357 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:48,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:48,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:48,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:48,358 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:48,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:48,994 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-01-20 09:57:48,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:48,994 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:48,994 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:48,994 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:48,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:48,995 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:49,004 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:57:49,004 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:57:49,113 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-01-20 09:57:49,113 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:57:49,117 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:49,126 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-01-20 09:57:49,126 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:50,100 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-01-20 09:57:50,119 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:50,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2019-01-20 09:57:50,119 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:50,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-01-20 09:57:50,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-01-20 09:57:50,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-01-20 09:57:50,122 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 29 states. [2019-01-20 09:57:50,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:50,225 INFO L93 Difference]: Finished difference Result 88 states and 91 transitions. [2019-01-20 09:57:50,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-01-20 09:57:50,226 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 56 [2019-01-20 09:57:50,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:50,227 INFO L225 Difference]: With dead ends: 88 [2019-01-20 09:57:50,227 INFO L226 Difference]: Without dead ends: 59 [2019-01-20 09:57:50,229 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-01-20 09:57:50,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-01-20 09:57:50,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-01-20 09:57:50,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-20 09:57:50,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2019-01-20 09:57:50,232 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 56 [2019-01-20 09:57:50,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:50,232 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2019-01-20 09:57:50,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-01-20 09:57:50,232 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2019-01-20 09:57:50,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-01-20 09:57:50,233 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:50,233 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1] [2019-01-20 09:57:50,233 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:50,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:50,234 INFO L82 PathProgramCache]: Analyzing trace with hash -190119787, now seen corresponding path program 27 times [2019-01-20 09:57:50,234 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:50,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:50,234 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:57:50,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:50,235 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:50,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:50,691 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2019-01-20 09:57:50,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:50,691 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:50,692 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:50,692 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:50,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:50,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 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:50,701 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 09:57:50,701 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 09:57:50,765 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 09:57:50,765 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:57:50,768 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:50,779 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2019-01-20 09:57:50,780 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:51,753 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2019-01-20 09:57:51,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:51,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2019-01-20 09:57:51,772 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:51,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-01-20 09:57:51,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-01-20 09:57:51,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-01-20 09:57:51,774 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 30 states. [2019-01-20 09:57:51,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:51,896 INFO L93 Difference]: Finished difference Result 91 states and 94 transitions. [2019-01-20 09:57:51,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-01-20 09:57:51,897 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 58 [2019-01-20 09:57:51,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:51,897 INFO L225 Difference]: With dead ends: 91 [2019-01-20 09:57:51,898 INFO L226 Difference]: Without dead ends: 61 [2019-01-20 09:57:51,898 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-01-20 09:57:51,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-01-20 09:57:51,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-01-20 09:57:51,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-20 09:57:51,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2019-01-20 09:57:51,902 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 58 [2019-01-20 09:57:51,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:51,903 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2019-01-20 09:57:51,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-01-20 09:57:51,903 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2019-01-20 09:57:51,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-01-20 09:57:51,903 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:51,904 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1] [2019-01-20 09:57:51,904 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:51,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:51,904 INFO L82 PathProgramCache]: Analyzing trace with hash -903903350, now seen corresponding path program 28 times [2019-01-20 09:57:51,904 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:51,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:51,905 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:57:51,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:51,905 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:51,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:52,499 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-01-20 09:57:52,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:52,499 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:52,499 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:52,500 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:52,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:52,500 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:52,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:52,509 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:57:52,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:52,563 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:52,573 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-01-20 09:57:52,574 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:53,748 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-01-20 09:57:53,767 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:53,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 59 [2019-01-20 09:57:53,768 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:53,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-01-20 09:57:53,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-01-20 09:57:53,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-01-20 09:57:53,769 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 31 states. [2019-01-20 09:57:53,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:53,888 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2019-01-20 09:57:53,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-01-20 09:57:53,888 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 60 [2019-01-20 09:57:53,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:53,889 INFO L225 Difference]: With dead ends: 94 [2019-01-20 09:57:53,889 INFO L226 Difference]: Without dead ends: 63 [2019-01-20 09:57:53,890 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-01-20 09:57:53,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-01-20 09:57:53,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-01-20 09:57:53,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-01-20 09:57:53,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2019-01-20 09:57:53,894 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 60 [2019-01-20 09:57:53,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:53,894 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2019-01-20 09:57:53,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-01-20 09:57:53,894 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2019-01-20 09:57:53,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-01-20 09:57:53,895 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:53,895 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1] [2019-01-20 09:57:53,895 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:53,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:53,895 INFO L82 PathProgramCache]: Analyzing trace with hash -228988683, now seen corresponding path program 29 times [2019-01-20 09:57:53,895 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:53,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:53,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:53,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:53,896 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:53,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:54,897 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2019-01-20 09:57:54,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:54,897 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:54,897 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:54,897 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:54,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:54,898 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:54,905 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:57:54,906 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:57:55,062 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-01-20 09:57:55,062 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:57:55,066 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:55,075 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2019-01-20 09:57:55,076 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:56,008 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2019-01-20 09:57:56,028 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:56,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2019-01-20 09:57:56,029 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:56,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-01-20 09:57:56,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-01-20 09:57:56,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-01-20 09:57:56,030 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 32 states. [2019-01-20 09:57:56,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:56,342 INFO L93 Difference]: Finished difference Result 97 states and 100 transitions. [2019-01-20 09:57:56,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-20 09:57:56,343 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 62 [2019-01-20 09:57:56,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:56,344 INFO L225 Difference]: With dead ends: 97 [2019-01-20 09:57:56,344 INFO L226 Difference]: Without dead ends: 65 [2019-01-20 09:57:56,345 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-01-20 09:57:56,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-20 09:57:56,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-01-20 09:57:56,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-01-20 09:57:56,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2019-01-20 09:57:56,348 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 62 [2019-01-20 09:57:56,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:56,348 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2019-01-20 09:57:56,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-01-20 09:57:56,348 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2019-01-20 09:57:56,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-01-20 09:57:56,349 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:56,349 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1] [2019-01-20 09:57:56,349 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:56,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:56,349 INFO L82 PathProgramCache]: Analyzing trace with hash -785494358, now seen corresponding path program 30 times [2019-01-20 09:57:56,349 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:56,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:56,350 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:57:56,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:56,350 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:56,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:56,782 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-01-20 09:57:56,782 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:56,782 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:56,782 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:56,783 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:56,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:56,783 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:56,792 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 09:57:56,793 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 09:57:56,835 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 09:57:56,835 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:57:56,837 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:56,848 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-01-20 09:57:56,848 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:57,875 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-01-20 09:57:57,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:57,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2019-01-20 09:57:57,894 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:57,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-01-20 09:57:57,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-01-20 09:57:57,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-01-20 09:57:57,895 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 33 states. [2019-01-20 09:57:58,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:58,047 INFO L93 Difference]: Finished difference Result 100 states and 103 transitions. [2019-01-20 09:57:58,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-01-20 09:57:58,047 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 64 [2019-01-20 09:57:58,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:58,048 INFO L225 Difference]: With dead ends: 100 [2019-01-20 09:57:58,048 INFO L226 Difference]: Without dead ends: 67 [2019-01-20 09:57:58,049 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-01-20 09:57:58,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-01-20 09:57:58,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-01-20 09:57:58,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-01-20 09:57:58,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2019-01-20 09:57:58,051 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 64 [2019-01-20 09:57:58,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:58,051 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2019-01-20 09:57:58,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-01-20 09:57:58,052 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2019-01-20 09:57:58,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-20 09:57:58,052 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:58,052 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1] [2019-01-20 09:57:58,052 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:58,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:58,053 INFO L82 PathProgramCache]: Analyzing trace with hash -429274795, now seen corresponding path program 31 times [2019-01-20 09:57:58,053 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:58,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:58,054 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:57:58,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:58,054 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:58,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:58,599 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2019-01-20 09:57:58,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:58,599 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:58,599 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:58,599 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:58,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:58,599 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:58,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:58,608 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:57:58,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:58,656 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:58,667 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2019-01-20 09:57:58,667 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:00,017 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2019-01-20 09:58:00,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:00,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2019-01-20 09:58:00,037 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:00,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-01-20 09:58:00,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-01-20 09:58:00,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-01-20 09:58:00,038 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 34 states. [2019-01-20 09:58:00,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:00,174 INFO L93 Difference]: Finished difference Result 103 states and 106 transitions. [2019-01-20 09:58:00,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-01-20 09:58:00,174 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 66 [2019-01-20 09:58:00,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:00,175 INFO L225 Difference]: With dead ends: 103 [2019-01-20 09:58:00,175 INFO L226 Difference]: Without dead ends: 69 [2019-01-20 09:58:00,176 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-01-20 09:58:00,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-01-20 09:58:00,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-01-20 09:58:00,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-01-20 09:58:00,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2019-01-20 09:58:00,179 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 66 [2019-01-20 09:58:00,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:00,179 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2019-01-20 09:58:00,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-01-20 09:58:00,180 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2019-01-20 09:58:00,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-01-20 09:58:00,180 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:00,180 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1, 1] [2019-01-20 09:58:00,181 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:58:00,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:00,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1040014794, now seen corresponding path program 32 times [2019-01-20 09:58:00,181 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:00,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:00,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:58:00,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:00,182 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:00,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:01,265 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-01-20 09:58:01,265 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:01,266 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:01,266 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:01,266 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:01,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:01,266 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:58:01,274 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:58:01,274 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:58:01,440 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-01-20 09:58:01,440 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:58:01,444 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:01,454 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-01-20 09:58:01,454 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:02,621 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-01-20 09:58:02,641 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:02,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 67 [2019-01-20 09:58:02,641 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:02,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-01-20 09:58:02,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-01-20 09:58:02,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-01-20 09:58:02,643 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 35 states. [2019-01-20 09:58:02,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:02,793 INFO L93 Difference]: Finished difference Result 106 states and 109 transitions. [2019-01-20 09:58:02,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-01-20 09:58:02,793 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 68 [2019-01-20 09:58:02,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:02,794 INFO L225 Difference]: With dead ends: 106 [2019-01-20 09:58:02,794 INFO L226 Difference]: Without dead ends: 71 [2019-01-20 09:58:02,795 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-01-20 09:58:02,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-20 09:58:02,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-01-20 09:58:02,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-20 09:58:02,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2019-01-20 09:58:02,799 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 68 [2019-01-20 09:58:02,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:02,799 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2019-01-20 09:58:02,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-01-20 09:58:02,799 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2019-01-20 09:58:02,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-01-20 09:58:02,800 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:02,800 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1] [2019-01-20 09:58:02,800 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:58:02,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:02,800 INFO L82 PathProgramCache]: Analyzing trace with hash -986406475, now seen corresponding path program 33 times [2019-01-20 09:58:02,801 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:02,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:02,801 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:58:02,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:02,801 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:02,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:03,371 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2019-01-20 09:58:03,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:03,372 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:03,372 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:03,372 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:03,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:03,372 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:58:03,382 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 09:58:03,382 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 09:58:03,432 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 09:58:03,432 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:58:03,434 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:03,443 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2019-01-20 09:58:03,443 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:04,945 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2019-01-20 09:58:04,964 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:04,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2019-01-20 09:58:04,964 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:04,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-01-20 09:58:04,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-01-20 09:58:04,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-01-20 09:58:04,965 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 36 states. [2019-01-20 09:58:05,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:05,127 INFO L93 Difference]: Finished difference Result 109 states and 112 transitions. [2019-01-20 09:58:05,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-01-20 09:58:05,128 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 70 [2019-01-20 09:58:05,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:05,128 INFO L225 Difference]: With dead ends: 109 [2019-01-20 09:58:05,129 INFO L226 Difference]: Without dead ends: 73 [2019-01-20 09:58:05,129 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-01-20 09:58:05,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-01-20 09:58:05,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-01-20 09:58:05,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-20 09:58:05,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2019-01-20 09:58:05,131 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 70 [2019-01-20 09:58:05,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:05,131 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2019-01-20 09:58:05,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-01-20 09:58:05,132 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2019-01-20 09:58:05,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-01-20 09:58:05,132 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:05,132 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1] [2019-01-20 09:58:05,132 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:58:05,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:05,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1548924138, now seen corresponding path program 34 times [2019-01-20 09:58:05,133 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:05,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:05,134 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:58:05,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:05,134 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:05,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:05,821 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2019-01-20 09:58:05,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:05,822 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:05,822 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:05,822 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:05,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:05,822 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:58:05,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:58:05,834 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:58:05,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:05,886 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:05,898 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2019-01-20 09:58:05,898 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:07,228 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2019-01-20 09:58:07,246 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:07,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 71 [2019-01-20 09:58:07,246 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:07,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-01-20 09:58:07,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-01-20 09:58:07,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-01-20 09:58:07,247 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 37 states. [2019-01-20 09:58:07,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:07,490 INFO L93 Difference]: Finished difference Result 112 states and 115 transitions. [2019-01-20 09:58:07,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-01-20 09:58:07,490 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 72 [2019-01-20 09:58:07,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:07,491 INFO L225 Difference]: With dead ends: 112 [2019-01-20 09:58:07,492 INFO L226 Difference]: Without dead ends: 75 [2019-01-20 09:58:07,492 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-01-20 09:58:07,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-01-20 09:58:07,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-01-20 09:58:07,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-01-20 09:58:07,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2019-01-20 09:58:07,495 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 72 [2019-01-20 09:58:07,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:07,495 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2019-01-20 09:58:07,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-01-20 09:58:07,495 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2019-01-20 09:58:07,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-01-20 09:58:07,496 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:07,496 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 1, 1, 1, 1] [2019-01-20 09:58:07,496 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:58:07,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:07,496 INFO L82 PathProgramCache]: Analyzing trace with hash -1198231019, now seen corresponding path program 35 times [2019-01-20 09:58:07,497 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:07,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:07,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:58:07,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:07,497 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:07,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:08,083 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2019-01-20 09:58:08,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:08,083 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:08,083 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:08,084 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:08,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:08,084 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:58:08,091 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:58:08,092 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:58:08,453 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2019-01-20 09:58:08,453 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:58:08,458 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:08,466 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2019-01-20 09:58:08,466 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:10,055 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2019-01-20 09:58:10,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:10,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2019-01-20 09:58:10,075 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:10,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-01-20 09:58:10,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-01-20 09:58:10,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-01-20 09:58:10,076 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 38 states. [2019-01-20 09:58:10,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:10,201 INFO L93 Difference]: Finished difference Result 115 states and 118 transitions. [2019-01-20 09:58:10,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-01-20 09:58:10,201 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 74 [2019-01-20 09:58:10,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:10,202 INFO L225 Difference]: With dead ends: 115 [2019-01-20 09:58:10,202 INFO L226 Difference]: Without dead ends: 77 [2019-01-20 09:58:10,203 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-01-20 09:58:10,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-01-20 09:58:10,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-01-20 09:58:10,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-20 09:58:10,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2019-01-20 09:58:10,206 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 74 [2019-01-20 09:58:10,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:10,206 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2019-01-20 09:58:10,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-01-20 09:58:10,207 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2019-01-20 09:58:10,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-01-20 09:58:10,207 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:10,207 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 1, 1, 1, 1] [2019-01-20 09:58:10,207 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:58:10,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:10,208 INFO L82 PathProgramCache]: Analyzing trace with hash -2106305526, now seen corresponding path program 36 times [2019-01-20 09:58:10,208 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:10,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:10,208 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:58:10,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:10,208 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:10,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:10,881 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2019-01-20 09:58:10,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:10,882 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:10,882 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:10,882 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:10,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:10,882 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:58:10,891 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 09:58:10,891 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 09:58:10,950 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 09:58:10,951 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:58:10,953 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:10,964 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2019-01-20 09:58:10,965 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:12,470 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2019-01-20 09:58:12,489 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:12,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 75 [2019-01-20 09:58:12,489 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:12,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-01-20 09:58:12,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-01-20 09:58:12,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-01-20 09:58:12,491 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 39 states. [2019-01-20 09:58:12,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:12,636 INFO L93 Difference]: Finished difference Result 118 states and 121 transitions. [2019-01-20 09:58:12,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-01-20 09:58:12,637 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 76 [2019-01-20 09:58:12,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:12,638 INFO L225 Difference]: With dead ends: 118 [2019-01-20 09:58:12,638 INFO L226 Difference]: Without dead ends: 79 [2019-01-20 09:58:12,639 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-01-20 09:58:12,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-01-20 09:58:12,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-01-20 09:58:12,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-01-20 09:58:12,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2019-01-20 09:58:12,642 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 76 [2019-01-20 09:58:12,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:12,642 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2019-01-20 09:58:12,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-01-20 09:58:12,642 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2019-01-20 09:58:12,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-01-20 09:58:12,643 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:12,643 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 1, 1, 1, 1] [2019-01-20 09:58:12,643 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:58:12,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:12,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1075627403, now seen corresponding path program 37 times [2019-01-20 09:58:12,644 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:12,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:12,644 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:58:12,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:12,645 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:12,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:13,323 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2019-01-20 09:58:13,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:13,324 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:13,324 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:13,324 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:13,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:13,324 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:58:13,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:58:13,332 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:58:13,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:13,393 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:13,405 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2019-01-20 09:58:13,406 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:15,390 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2019-01-20 09:58:15,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:15,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 77 [2019-01-20 09:58:15,408 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:15,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-01-20 09:58:15,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-01-20 09:58:15,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-01-20 09:58:15,409 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 40 states. [2019-01-20 09:58:15,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:15,548 INFO L93 Difference]: Finished difference Result 121 states and 124 transitions. [2019-01-20 09:58:15,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-01-20 09:58:15,549 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 78 [2019-01-20 09:58:15,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:15,549 INFO L225 Difference]: With dead ends: 121 [2019-01-20 09:58:15,549 INFO L226 Difference]: Without dead ends: 81 [2019-01-20 09:58:15,550 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-01-20 09:58:15,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-01-20 09:58:15,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-01-20 09:58:15,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-01-20 09:58:15,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2019-01-20 09:58:15,553 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 78 [2019-01-20 09:58:15,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:15,553 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2019-01-20 09:58:15,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-01-20 09:58:15,553 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2019-01-20 09:58:15,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-01-20 09:58:15,553 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:15,553 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 1, 1, 1, 1] [2019-01-20 09:58:15,554 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:58:15,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:15,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1898461994, now seen corresponding path program 38 times [2019-01-20 09:58:15,554 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:15,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:15,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:58:15,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:15,555 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:15,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:16,540 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2019-01-20 09:58:16,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:16,540 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:16,541 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:16,541 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:16,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:16,541 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:58:16,549 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:58:16,550 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:58:16,937 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-01-20 09:58:16,937 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:58:16,942 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:16,955 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2019-01-20 09:58:16,955 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:18,889 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2019-01-20 09:58:18,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:18,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 79 [2019-01-20 09:58:18,910 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:18,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-01-20 09:58:18,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-01-20 09:58:18,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-01-20 09:58:18,911 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 41 states. [2019-01-20 09:58:19,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:19,052 INFO L93 Difference]: Finished difference Result 124 states and 127 transitions. [2019-01-20 09:58:19,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-01-20 09:58:19,052 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 80 [2019-01-20 09:58:19,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:19,053 INFO L225 Difference]: With dead ends: 124 [2019-01-20 09:58:19,053 INFO L226 Difference]: Without dead ends: 83 [2019-01-20 09:58:19,054 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-01-20 09:58:19,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-01-20 09:58:19,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-01-20 09:58:19,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-01-20 09:58:19,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2019-01-20 09:58:19,058 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 80 [2019-01-20 09:58:19,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:19,058 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2019-01-20 09:58:19,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-01-20 09:58:19,058 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2019-01-20 09:58:19,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-01-20 09:58:19,059 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:19,059 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 1, 1, 1, 1] [2019-01-20 09:58:19,059 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:58:19,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:19,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1341848277, now seen corresponding path program 39 times [2019-01-20 09:58:19,059 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:19,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:19,060 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:58:19,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:19,060 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:19,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:19,976 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2019-01-20 09:58:19,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:19,976 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:19,976 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:19,977 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:19,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:19,977 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:58:19,985 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 09:58:19,985 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 09:58:20,054 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 09:58:20,055 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:58:20,057 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:20,065 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2019-01-20 09:58:20,065 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:21,914 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2019-01-20 09:58:21,932 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:21,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 81 [2019-01-20 09:58:21,933 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:21,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-01-20 09:58:21,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-01-20 09:58:21,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-01-20 09:58:21,934 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand 42 states. [2019-01-20 09:58:22,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:22,073 INFO L93 Difference]: Finished difference Result 127 states and 130 transitions. [2019-01-20 09:58:22,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-01-20 09:58:22,074 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 82 [2019-01-20 09:58:22,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:22,075 INFO L225 Difference]: With dead ends: 127 [2019-01-20 09:58:22,075 INFO L226 Difference]: Without dead ends: 85 [2019-01-20 09:58:22,075 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-01-20 09:58:22,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-20 09:58:22,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-01-20 09:58:22,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-01-20 09:58:22,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2019-01-20 09:58:22,078 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 82 [2019-01-20 09:58:22,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:22,078 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2019-01-20 09:58:22,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-01-20 09:58:22,078 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2019-01-20 09:58:22,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-01-20 09:58:22,079 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:22,079 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 1, 1, 1, 1] [2019-01-20 09:58:22,079 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:58:22,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:22,079 INFO L82 PathProgramCache]: Analyzing trace with hash -1280021942, now seen corresponding path program 40 times [2019-01-20 09:58:22,079 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:22,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:22,080 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:58:22,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:22,080 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:22,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:22,795 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2019-01-20 09:58:22,795 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:22,795 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:22,795 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:22,795 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:22,795 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:22,795 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:58:22,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:58:22,805 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:58:22,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:22,863 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:22,874 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2019-01-20 09:58:22,874 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:24,629 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2019-01-20 09:58:24,647 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:24,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 83 [2019-01-20 09:58:24,648 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:24,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-01-20 09:58:24,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-01-20 09:58:24,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-01-20 09:58:24,649 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 43 states. [2019-01-20 09:58:24,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:24,814 INFO L93 Difference]: Finished difference Result 130 states and 133 transitions. [2019-01-20 09:58:24,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-01-20 09:58:24,815 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 84 [2019-01-20 09:58:24,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:24,815 INFO L225 Difference]: With dead ends: 130 [2019-01-20 09:58:24,816 INFO L226 Difference]: Without dead ends: 87 [2019-01-20 09:58:24,816 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-01-20 09:58:24,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-01-20 09:58:24,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-01-20 09:58:24,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-01-20 09:58:24,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2019-01-20 09:58:24,819 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 84 [2019-01-20 09:58:24,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:24,820 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2019-01-20 09:58:24,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-01-20 09:58:24,820 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2019-01-20 09:58:24,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-01-20 09:58:24,820 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:24,820 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 1, 1, 1, 1] [2019-01-20 09:58:24,821 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:58:24,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:24,821 INFO L82 PathProgramCache]: Analyzing trace with hash -214584523, now seen corresponding path program 41 times [2019-01-20 09:58:24,821 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:24,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:24,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:58:24,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:24,822 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:24,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:25,874 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2019-01-20 09:58:25,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:25,875 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:25,875 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:25,875 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:25,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:25,875 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:58:25,883 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:58:25,883 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:58:26,207 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-01-20 09:58:26,207 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:58:26,213 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:26,226 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2019-01-20 09:58:26,226 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:28,081 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2019-01-20 09:58:28,101 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:28,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 85 [2019-01-20 09:58:28,102 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:28,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-01-20 09:58:28,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-01-20 09:58:28,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-01-20 09:58:28,103 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 44 states. [2019-01-20 09:58:28,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:28,288 INFO L93 Difference]: Finished difference Result 133 states and 136 transitions. [2019-01-20 09:58:28,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-01-20 09:58:28,288 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 86 [2019-01-20 09:58:28,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:28,289 INFO L225 Difference]: With dead ends: 133 [2019-01-20 09:58:28,289 INFO L226 Difference]: Without dead ends: 89 [2019-01-20 09:58:28,290 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-01-20 09:58:28,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-01-20 09:58:28,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-01-20 09:58:28,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-01-20 09:58:28,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2019-01-20 09:58:28,292 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 86 [2019-01-20 09:58:28,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:28,293 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2019-01-20 09:58:28,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-01-20 09:58:28,293 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2019-01-20 09:58:28,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-01-20 09:58:28,294 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:28,294 INFO L402 BasicCegarLoop]: trace histogram [42, 42, 1, 1, 1, 1] [2019-01-20 09:58:28,294 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:58:28,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:28,294 INFO L82 PathProgramCache]: Analyzing trace with hash -2170518, now seen corresponding path program 42 times [2019-01-20 09:58:28,294 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:28,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:28,295 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:58:28,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:28,295 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:28,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:29,216 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2019-01-20 09:58:29,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:29,216 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:29,216 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:29,217 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:29,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:29,217 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:58:29,225 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 09:58:29,225 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 09:58:29,284 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 09:58:29,284 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:58:29,287 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:29,308 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2019-01-20 09:58:29,308 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:31,557 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2019-01-20 09:58:31,575 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:31,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 87 [2019-01-20 09:58:31,576 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:31,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-01-20 09:58:31,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-01-20 09:58:31,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-01-20 09:58:31,577 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand 45 states. [2019-01-20 09:58:31,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:31,741 INFO L93 Difference]: Finished difference Result 136 states and 139 transitions. [2019-01-20 09:58:31,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-01-20 09:58:31,742 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 88 [2019-01-20 09:58:31,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:31,742 INFO L225 Difference]: With dead ends: 136 [2019-01-20 09:58:31,742 INFO L226 Difference]: Without dead ends: 91 [2019-01-20 09:58:31,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-01-20 09:58:31,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-01-20 09:58:31,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-01-20 09:58:31,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-01-20 09:58:31,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2019-01-20 09:58:31,747 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 88 [2019-01-20 09:58:31,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:31,747 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2019-01-20 09:58:31,747 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-01-20 09:58:31,747 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2019-01-20 09:58:31,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-01-20 09:58:31,748 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:31,748 INFO L402 BasicCegarLoop]: trace histogram [43, 43, 1, 1, 1, 1] [2019-01-20 09:58:31,748 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:58:31,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:31,748 INFO L82 PathProgramCache]: Analyzing trace with hash -378707051, now seen corresponding path program 43 times [2019-01-20 09:58:31,748 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:31,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:31,749 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:58:31,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:31,749 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:31,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:33,123 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2019-01-20 09:58:33,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:33,123 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:33,124 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:33,124 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:33,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:33,124 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:58:33,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:58:33,132 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:58:33,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:33,197 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:33,207 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2019-01-20 09:58:33,207 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:35,455 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2019-01-20 09:58:35,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:35,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 89 [2019-01-20 09:58:35,484 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:35,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-01-20 09:58:35,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-01-20 09:58:35,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-01-20 09:58:35,486 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand 46 states. [2019-01-20 09:58:35,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:35,740 INFO L93 Difference]: Finished difference Result 139 states and 142 transitions. [2019-01-20 09:58:35,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-01-20 09:58:35,741 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 90 [2019-01-20 09:58:35,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:35,742 INFO L225 Difference]: With dead ends: 139 [2019-01-20 09:58:35,742 INFO L226 Difference]: Without dead ends: 93 [2019-01-20 09:58:35,742 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-01-20 09:58:35,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-01-20 09:58:35,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-01-20 09:58:35,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-01-20 09:58:35,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2019-01-20 09:58:35,745 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 90 [2019-01-20 09:58:35,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:35,745 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2019-01-20 09:58:35,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-01-20 09:58:35,745 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2019-01-20 09:58:35,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-20 09:58:35,746 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:35,746 INFO L402 BasicCegarLoop]: trace histogram [44, 44, 1, 1, 1, 1] [2019-01-20 09:58:35,746 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:58:35,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:35,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1779588982, now seen corresponding path program 44 times [2019-01-20 09:58:35,746 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:35,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:35,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:58:35,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:35,747 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:35,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:37,168 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-01-20 09:58:37,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:37,168 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:37,168 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:37,168 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:37,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:37,168 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:58:37,177 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:58:37,177 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:58:37,543 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2019-01-20 09:58:37,544 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:58:37,548 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:37,557 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-01-20 09:58:37,557 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:39,729 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-01-20 09:58:39,748 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:39,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 91 [2019-01-20 09:58:39,748 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:39,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-01-20 09:58:39,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-01-20 09:58:39,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-01-20 09:58:39,750 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand 47 states. [2019-01-20 09:58:40,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:40,731 INFO L93 Difference]: Finished difference Result 142 states and 145 transitions. [2019-01-20 09:58:40,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-01-20 09:58:40,732 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 92 [2019-01-20 09:58:40,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:40,733 INFO L225 Difference]: With dead ends: 142 [2019-01-20 09:58:40,733 INFO L226 Difference]: Without dead ends: 95 [2019-01-20 09:58:40,734 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-01-20 09:58:40,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-01-20 09:58:40,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-01-20 09:58:40,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-01-20 09:58:40,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2019-01-20 09:58:40,737 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 92 [2019-01-20 09:58:40,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:40,737 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2019-01-20 09:58:40,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-01-20 09:58:40,737 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2019-01-20 09:58:40,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-20 09:58:40,738 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:40,738 INFO L402 BasicCegarLoop]: trace histogram [45, 45, 1, 1, 1, 1] [2019-01-20 09:58:40,738 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:58:40,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:40,738 INFO L82 PathProgramCache]: Analyzing trace with hash -939783179, now seen corresponding path program 45 times [2019-01-20 09:58:40,738 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:40,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:40,739 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:58:40,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:40,739 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:40,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:41,715 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2019-01-20 09:58:41,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:41,716 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:41,716 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:41,716 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:41,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:41,716 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:58:41,734 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 09:58:41,734 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 09:58:41,811 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 09:58:41,812 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:58:41,815 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:41,846 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2019-01-20 09:58:41,846 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:44,922 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2019-01-20 09:58:44,940 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:44,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 93 [2019-01-20 09:58:44,941 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:44,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-01-20 09:58:44,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-01-20 09:58:44,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-01-20 09:58:44,942 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand 48 states. [2019-01-20 09:58:45,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:45,146 INFO L93 Difference]: Finished difference Result 145 states and 148 transitions. [2019-01-20 09:58:45,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-01-20 09:58:45,149 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 94 [2019-01-20 09:58:45,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:45,150 INFO L225 Difference]: With dead ends: 145 [2019-01-20 09:58:45,150 INFO L226 Difference]: Without dead ends: 97 [2019-01-20 09:58:45,151 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-01-20 09:58:45,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-01-20 09:58:45,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-01-20 09:58:45,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-01-20 09:58:45,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2019-01-20 09:58:45,154 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 94 [2019-01-20 09:58:45,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:45,155 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2019-01-20 09:58:45,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-01-20 09:58:45,155 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2019-01-20 09:58:45,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-20 09:58:45,156 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:45,156 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1] [2019-01-20 09:58:45,156 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:58:45,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:45,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1599690838, now seen corresponding path program 46 times [2019-01-20 09:58:45,156 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:45,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:45,157 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:58:45,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:45,157 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:45,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:46,438 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-01-20 09:58:46,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:46,439 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:46,439 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:46,439 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:46,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:46,439 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:58:46,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:58:46,447 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:58:46,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:46,514 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:46,528 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-01-20 09:58:46,529 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:48,902 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-01-20 09:58:48,921 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:48,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2019-01-20 09:58:48,921 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:48,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-01-20 09:58:48,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-01-20 09:58:48,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-01-20 09:58:48,922 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 49 states. [2019-01-20 09:58:49,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:49,093 INFO L93 Difference]: Finished difference Result 148 states and 151 transitions. [2019-01-20 09:58:49,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-01-20 09:58:49,094 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 96 [2019-01-20 09:58:49,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:49,095 INFO L225 Difference]: With dead ends: 148 [2019-01-20 09:58:49,095 INFO L226 Difference]: Without dead ends: 99 [2019-01-20 09:58:49,095 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-01-20 09:58:49,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-01-20 09:58:49,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-01-20 09:58:49,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-01-20 09:58:49,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2019-01-20 09:58:49,099 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 96 [2019-01-20 09:58:49,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:49,099 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2019-01-20 09:58:49,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-01-20 09:58:49,099 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2019-01-20 09:58:49,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-20 09:58:49,100 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:49,100 INFO L402 BasicCegarLoop]: trace histogram [47, 47, 1, 1, 1, 1] [2019-01-20 09:58:49,100 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:58:49,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:49,101 INFO L82 PathProgramCache]: Analyzing trace with hash 431729749, now seen corresponding path program 47 times [2019-01-20 09:58:49,101 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:49,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:49,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:58:49,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:49,102 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:49,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:50,186 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2019-01-20 09:58:50,186 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:50,186 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:50,187 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:50,187 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:50,187 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:50,187 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:58:50,194 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:58:50,195 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:58:50,682 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2019-01-20 09:58:50,682 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:58:50,687 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:50,703 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2019-01-20 09:58:50,704 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:53,146 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2019-01-20 09:58:53,166 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:53,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2019-01-20 09:58:53,166 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:53,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-01-20 09:58:53,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-01-20 09:58:53,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-01-20 09:58:53,167 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 50 states. [2019-01-20 09:58:53,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:53,350 INFO L93 Difference]: Finished difference Result 151 states and 154 transitions. [2019-01-20 09:58:53,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-01-20 09:58:53,350 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 98 [2019-01-20 09:58:53,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:53,351 INFO L225 Difference]: With dead ends: 151 [2019-01-20 09:58:53,351 INFO L226 Difference]: Without dead ends: 101 [2019-01-20 09:58:53,352 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-01-20 09:58:53,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-01-20 09:58:53,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-01-20 09:58:53,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-01-20 09:58:53,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 102 transitions. [2019-01-20 09:58:53,355 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 102 transitions. Word has length 98 [2019-01-20 09:58:53,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:53,356 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 102 transitions. [2019-01-20 09:58:53,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-01-20 09:58:53,356 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 102 transitions. [2019-01-20 09:58:53,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-20 09:58:53,356 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:53,356 INFO L402 BasicCegarLoop]: trace histogram [48, 48, 1, 1, 1, 1] [2019-01-20 09:58:53,356 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:58:53,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:53,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1789921590, now seen corresponding path program 48 times [2019-01-20 09:58:53,357 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:53,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:53,357 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:58:53,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:53,358 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:53,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:54,406 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2019-01-20 09:58:54,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:54,407 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:54,407 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:54,407 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:54,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:54,407 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:58:54,415 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 09:58:54,416 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 09:58:54,488 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 09:58:54,488 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:58:54,491 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:54,501 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2019-01-20 09:58:54,501 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:57,253 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2019-01-20 09:58:57,271 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:57,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 99 [2019-01-20 09:58:57,272 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:57,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-01-20 09:58:57,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-01-20 09:58:57,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-01-20 09:58:57,273 INFO L87 Difference]: Start difference. First operand 101 states and 102 transitions. Second operand 51 states. [2019-01-20 09:58:57,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:57,605 INFO L93 Difference]: Finished difference Result 154 states and 157 transitions. [2019-01-20 09:58:57,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-01-20 09:58:57,606 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 100 [2019-01-20 09:58:57,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:57,606 INFO L225 Difference]: With dead ends: 154 [2019-01-20 09:58:57,606 INFO L226 Difference]: Without dead ends: 103 [2019-01-20 09:58:57,607 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-01-20 09:58:57,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-01-20 09:58:57,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-01-20 09:58:57,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-01-20 09:58:57,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2019-01-20 09:58:57,611 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 100 [2019-01-20 09:58:57,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:57,611 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2019-01-20 09:58:57,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-01-20 09:58:57,611 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2019-01-20 09:58:57,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-20 09:58:57,612 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:57,612 INFO L402 BasicCegarLoop]: trace histogram [49, 49, 1, 1, 1, 1] [2019-01-20 09:58:57,612 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:58:57,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:57,612 INFO L82 PathProgramCache]: Analyzing trace with hash -16366411, now seen corresponding path program 49 times [2019-01-20 09:58:57,612 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:57,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:57,613 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:58:57,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:57,613 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:57,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:58,663 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2019-01-20 09:58:58,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:58,664 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:58,664 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:58,664 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:58,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:58,664 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:58:58,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:58:58,673 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:58:58,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:58,755 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:58,768 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2019-01-20 09:58:58,768 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:59:01,678 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2019-01-20 09:59:01,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:59:01,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 101 [2019-01-20 09:59:01,698 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:59:01,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-01-20 09:59:01,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-01-20 09:59:01,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-01-20 09:59:01,699 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 52 states. [2019-01-20 09:59:01,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:59:01,914 INFO L93 Difference]: Finished difference Result 157 states and 160 transitions. [2019-01-20 09:59:01,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-01-20 09:59:01,914 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 102 [2019-01-20 09:59:01,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:59:01,915 INFO L225 Difference]: With dead ends: 157 [2019-01-20 09:59:01,915 INFO L226 Difference]: Without dead ends: 105 [2019-01-20 09:59:01,916 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-01-20 09:59:01,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-01-20 09:59:01,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-01-20 09:59:01,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-01-20 09:59:01,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2019-01-20 09:59:01,919 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 102 [2019-01-20 09:59:01,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:59:01,920 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2019-01-20 09:59:01,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-01-20 09:59:01,920 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2019-01-20 09:59:01,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-01-20 09:59:01,921 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:59:01,921 INFO L402 BasicCegarLoop]: trace histogram [50, 50, 1, 1, 1, 1] [2019-01-20 09:59:01,921 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:59:01,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:59:01,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1817211414, now seen corresponding path program 50 times [2019-01-20 09:59:01,921 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:59:01,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:01,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:59:01,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:01,922 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:59:01,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:59:03,393 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2019-01-20 09:59:03,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:03,393 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:59:03,393 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:59:03,393 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:59:03,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:03,393 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:59:03,404 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:59:03,405 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:59:04,574 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2019-01-20 09:59:04,574 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:59:04,582 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:59:04,598 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2019-01-20 09:59:04,598 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:59:07,840 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2019-01-20 09:59:07,861 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:59:07,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 103 [2019-01-20 09:59:07,861 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:59:07,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-01-20 09:59:07,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-01-20 09:59:07,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-01-20 09:59:07,862 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand 53 states. [2019-01-20 09:59:08,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:59:08,644 INFO L93 Difference]: Finished difference Result 160 states and 163 transitions. [2019-01-20 09:59:08,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-01-20 09:59:08,645 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 104 [2019-01-20 09:59:08,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:59:08,645 INFO L225 Difference]: With dead ends: 160 [2019-01-20 09:59:08,646 INFO L226 Difference]: Without dead ends: 107 [2019-01-20 09:59:08,646 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-01-20 09:59:08,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-01-20 09:59:08,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-01-20 09:59:08,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-01-20 09:59:08,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2019-01-20 09:59:08,650 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 104 [2019-01-20 09:59:08,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:59:08,650 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2019-01-20 09:59:08,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-01-20 09:59:08,650 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2019-01-20 09:59:08,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-01-20 09:59:08,651 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:59:08,651 INFO L402 BasicCegarLoop]: trace histogram [51, 51, 1, 1, 1, 1] [2019-01-20 09:59:08,651 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:59:08,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:59:08,651 INFO L82 PathProgramCache]: Analyzing trace with hash -843721451, now seen corresponding path program 51 times [2019-01-20 09:59:08,652 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:59:08,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:08,652 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:59:08,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:08,653 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:59:08,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:59:09,723 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2019-01-20 09:59:09,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:09,724 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:59:09,724 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:59:09,724 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:59:09,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:09,724 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:59:09,732 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 09:59:09,733 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 09:59:09,808 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 09:59:09,808 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:59:09,811 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:59:09,824 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2019-01-20 09:59:09,825 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:59:12,715 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2019-01-20 09:59:12,733 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:59:12,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 105 [2019-01-20 09:59:12,734 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:59:12,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-01-20 09:59:12,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-01-20 09:59:12,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-01-20 09:59:12,735 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand 54 states. [2019-01-20 09:59:12,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:59:12,975 INFO L93 Difference]: Finished difference Result 163 states and 166 transitions. [2019-01-20 09:59:12,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-01-20 09:59:12,975 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 106 [2019-01-20 09:59:12,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:59:12,976 INFO L225 Difference]: With dead ends: 163 [2019-01-20 09:59:12,976 INFO L226 Difference]: Without dead ends: 109 [2019-01-20 09:59:12,977 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-01-20 09:59:12,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-01-20 09:59:12,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-01-20 09:59:12,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-01-20 09:59:12,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2019-01-20 09:59:12,980 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 106 [2019-01-20 09:59:12,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:59:12,980 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2019-01-20 09:59:12,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-01-20 09:59:12,981 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2019-01-20 09:59:12,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-01-20 09:59:12,981 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:59:12,981 INFO L402 BasicCegarLoop]: trace histogram [52, 52, 1, 1, 1, 1] [2019-01-20 09:59:12,982 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:59:12,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:59:12,982 INFO L82 PathProgramCache]: Analyzing trace with hash -972329718, now seen corresponding path program 52 times [2019-01-20 09:59:12,982 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:59:12,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:12,983 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:59:12,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:12,983 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:59:13,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:59:14,564 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2019-01-20 09:59:14,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:14,565 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:59:14,565 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:59:14,565 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:59:14,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:14,565 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:59:14,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:59:14,574 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:59:14,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:59:14,653 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:59:14,667 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2019-01-20 09:59:14,667 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:59:17,788 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2019-01-20 09:59:17,807 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:59:17,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 107 [2019-01-20 09:59:17,807 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:59:17,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-01-20 09:59:17,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-01-20 09:59:17,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-01-20 09:59:17,809 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand 55 states. [2019-01-20 09:59:18,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:59:18,023 INFO L93 Difference]: Finished difference Result 166 states and 169 transitions. [2019-01-20 09:59:18,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-01-20 09:59:18,023 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 108 [2019-01-20 09:59:18,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:59:18,024 INFO L225 Difference]: With dead ends: 166 [2019-01-20 09:59:18,024 INFO L226 Difference]: Without dead ends: 111 [2019-01-20 09:59:18,025 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-01-20 09:59:18,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-01-20 09:59:18,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-01-20 09:59:18,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-01-20 09:59:18,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2019-01-20 09:59:18,027 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 108 [2019-01-20 09:59:18,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:59:18,028 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2019-01-20 09:59:18,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-01-20 09:59:18,028 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2019-01-20 09:59:18,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-01-20 09:59:18,028 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:59:18,028 INFO L402 BasicCegarLoop]: trace histogram [53, 53, 1, 1, 1, 1] [2019-01-20 09:59:18,029 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:59:18,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:59:18,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1323016843, now seen corresponding path program 53 times [2019-01-20 09:59:18,029 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:59:18,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:18,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:59:18,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:18,030 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:59:18,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:59:19,166 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2019-01-20 09:59:19,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:19,167 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:59:19,167 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:59:19,167 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:59:19,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:19,167 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:59:19,176 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:59:19,176 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:59:20,324 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2019-01-20 09:59:20,324 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:59:20,333 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:59:20,350 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2019-01-20 09:59:20,350 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:59:23,639 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2019-01-20 09:59:23,659 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:59:23,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 109 [2019-01-20 09:59:23,659 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:59:23,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-01-20 09:59:23,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-01-20 09:59:23,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-01-20 09:59:23,661 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand 56 states. [2019-01-20 09:59:23,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:59:23,908 INFO L93 Difference]: Finished difference Result 169 states and 172 transitions. [2019-01-20 09:59:23,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-01-20 09:59:23,908 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 110 [2019-01-20 09:59:23,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:59:23,909 INFO L225 Difference]: With dead ends: 169 [2019-01-20 09:59:23,909 INFO L226 Difference]: Without dead ends: 113 [2019-01-20 09:59:23,910 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-01-20 09:59:23,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-01-20 09:59:23,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-01-20 09:59:23,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-01-20 09:59:23,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 114 transitions. [2019-01-20 09:59:23,913 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 114 transitions. Word has length 110 [2019-01-20 09:59:23,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:59:23,913 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 114 transitions. [2019-01-20 09:59:23,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-01-20 09:59:23,913 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 114 transitions. [2019-01-20 09:59:23,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-01-20 09:59:23,914 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:59:23,914 INFO L402 BasicCegarLoop]: trace histogram [54, 54, 1, 1, 1, 1] [2019-01-20 09:59:23,914 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:59:23,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:59:23,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1054239702, now seen corresponding path program 54 times [2019-01-20 09:59:23,915 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:59:23,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:23,915 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:59:23,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:23,916 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:59:23,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:59:25,299 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2019-01-20 09:59:25,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:25,299 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:59:25,299 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:59:25,299 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:59:25,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:25,299 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:59:25,310 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 09:59:25,311 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 09:59:25,391 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 09:59:25,391 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:59:25,394 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:59:25,406 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2019-01-20 09:59:25,406 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:59:28,837 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2019-01-20 09:59:28,855 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:59:28,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 111 [2019-01-20 09:59:28,855 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:59:28,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-01-20 09:59:28,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-01-20 09:59:28,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-01-20 09:59:28,857 INFO L87 Difference]: Start difference. First operand 113 states and 114 transitions. Second operand 57 states. [2019-01-20 09:59:29,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:59:29,064 INFO L93 Difference]: Finished difference Result 172 states and 175 transitions. [2019-01-20 09:59:29,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-01-20 09:59:29,065 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 112 [2019-01-20 09:59:29,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:59:29,066 INFO L225 Difference]: With dead ends: 172 [2019-01-20 09:59:29,066 INFO L226 Difference]: Without dead ends: 115 [2019-01-20 09:59:29,067 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-01-20 09:59:29,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-01-20 09:59:29,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2019-01-20 09:59:29,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-01-20 09:59:29,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 116 transitions. [2019-01-20 09:59:29,070 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 116 transitions. Word has length 112 [2019-01-20 09:59:29,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:59:29,071 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 116 transitions. [2019-01-20 09:59:29,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-01-20 09:59:29,071 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 116 transitions. [2019-01-20 09:59:29,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-01-20 09:59:29,071 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:59:29,071 INFO L402 BasicCegarLoop]: trace histogram [55, 55, 1, 1, 1, 1] [2019-01-20 09:59:29,072 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:59:29,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:59:29,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1244388821, now seen corresponding path program 55 times [2019-01-20 09:59:29,072 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:59:29,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:29,073 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:59:29,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:29,073 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:59:29,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:59:30,350 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2019-01-20 09:59:30,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:30,351 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:59:30,351 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:59:30,351 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:59:30,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:30,351 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:59:30,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:59:30,359 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:59:30,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:59:30,443 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:59:30,462 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2019-01-20 09:59:30,462 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:59:34,477 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2019-01-20 09:59:34,495 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:59:34,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 113 [2019-01-20 09:59:34,495 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:59:34,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-01-20 09:59:34,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-01-20 09:59:34,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-01-20 09:59:34,497 INFO L87 Difference]: Start difference. First operand 115 states and 116 transitions. Second operand 58 states. [2019-01-20 09:59:34,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:59:34,841 INFO L93 Difference]: Finished difference Result 175 states and 178 transitions. [2019-01-20 09:59:34,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-01-20 09:59:34,841 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 114 [2019-01-20 09:59:34,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:59:34,842 INFO L225 Difference]: With dead ends: 175 [2019-01-20 09:59:34,842 INFO L226 Difference]: Without dead ends: 117 [2019-01-20 09:59:34,843 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-01-20 09:59:34,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-01-20 09:59:34,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2019-01-20 09:59:34,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-01-20 09:59:34,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 118 transitions. [2019-01-20 09:59:34,847 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 118 transitions. Word has length 114 [2019-01-20 09:59:34,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:59:34,847 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 118 transitions. [2019-01-20 09:59:34,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-01-20 09:59:34,847 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 118 transitions. [2019-01-20 09:59:34,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-01-20 09:59:34,848 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:59:34,848 INFO L402 BasicCegarLoop]: trace histogram [56, 56, 1, 1, 1, 1] [2019-01-20 09:59:34,848 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:59:34,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:59:34,848 INFO L82 PathProgramCache]: Analyzing trace with hash -464518326, now seen corresponding path program 56 times [2019-01-20 09:59:34,848 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:59:34,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:34,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:59:34,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:34,849 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:59:34,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:59:36,125 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2019-01-20 09:59:36,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:36,125 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:59:36,126 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:59:36,126 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:59:36,126 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:36,126 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:59:36,134 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:59:36,134 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:59:36,961 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2019-01-20 09:59:36,961 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:59:36,966 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:59:36,986 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2019-01-20 09:59:36,986 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:59:40,612 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2019-01-20 09:59:40,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:59:40,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 115 [2019-01-20 09:59:40,633 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:59:40,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-01-20 09:59:40,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-01-20 09:59:40,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-01-20 09:59:40,635 INFO L87 Difference]: Start difference. First operand 117 states and 118 transitions. Second operand 59 states. [2019-01-20 09:59:40,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:59:40,943 INFO L93 Difference]: Finished difference Result 178 states and 181 transitions. [2019-01-20 09:59:40,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-01-20 09:59:40,943 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 116 [2019-01-20 09:59:40,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:59:40,944 INFO L225 Difference]: With dead ends: 178 [2019-01-20 09:59:40,944 INFO L226 Difference]: Without dead ends: 119 [2019-01-20 09:59:40,945 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-01-20 09:59:40,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-01-20 09:59:40,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2019-01-20 09:59:40,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-01-20 09:59:40,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 120 transitions. [2019-01-20 09:59:40,948 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 120 transitions. Word has length 116 [2019-01-20 09:59:40,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:59:40,948 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 120 transitions. [2019-01-20 09:59:40,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-01-20 09:59:40,948 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2019-01-20 09:59:40,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-01-20 09:59:40,949 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:59:40,949 INFO L402 BasicCegarLoop]: trace histogram [57, 57, 1, 1, 1, 1] [2019-01-20 09:59:40,949 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:59:40,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:59:40,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1327912501, now seen corresponding path program 57 times [2019-01-20 09:59:40,950 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:59:40,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:40,950 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:59:40,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:40,951 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:59:40,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:59:42,566 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2019-01-20 09:59:42,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:42,566 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:59:42,566 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:59:42,566 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:59:42,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:42,566 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:59:42,574 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 09:59:42,574 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 09:59:42,653 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 09:59:42,653 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:59:42,656 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:59:42,676 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2019-01-20 09:59:42,676 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:59:46,102 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2019-01-20 09:59:46,120 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:59:46,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 117 [2019-01-20 09:59:46,120 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:59:46,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-01-20 09:59:46,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-01-20 09:59:46,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-01-20 09:59:46,121 INFO L87 Difference]: Start difference. First operand 119 states and 120 transitions. Second operand 60 states. [2019-01-20 09:59:46,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:59:46,390 INFO L93 Difference]: Finished difference Result 181 states and 184 transitions. [2019-01-20 09:59:46,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-01-20 09:59:46,391 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 118 [2019-01-20 09:59:46,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:59:46,392 INFO L225 Difference]: With dead ends: 181 [2019-01-20 09:59:46,392 INFO L226 Difference]: Without dead ends: 121 [2019-01-20 09:59:46,392 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-01-20 09:59:46,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-01-20 09:59:46,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2019-01-20 09:59:46,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-01-20 09:59:46,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 122 transitions. [2019-01-20 09:59:46,396 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 122 transitions. Word has length 118 [2019-01-20 09:59:46,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:59:46,396 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 122 transitions. [2019-01-20 09:59:46,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-01-20 09:59:46,397 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 122 transitions. [2019-01-20 09:59:46,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-01-20 09:59:46,397 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:59:46,397 INFO L402 BasicCegarLoop]: trace histogram [58, 58, 1, 1, 1, 1] [2019-01-20 09:59:46,398 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:59:46,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:59:46,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1186678166, now seen corresponding path program 58 times [2019-01-20 09:59:46,398 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:59:46,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:46,399 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:59:46,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:46,399 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:59:46,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:59:48,200 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 1711 trivial. 0 not checked. [2019-01-20 09:59:48,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:48,200 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:59:48,200 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:59:48,201 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:59:48,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:48,201 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:59:48,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:59:48,212 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:59:48,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:59:48,296 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:59:48,314 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 1711 trivial. 0 not checked. [2019-01-20 09:59:48,314 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:59:51,844 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 1711 trivial. 0 not checked. [2019-01-20 09:59:51,864 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:59:51,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 119 [2019-01-20 09:59:51,865 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:59:51,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-01-20 09:59:51,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-01-20 09:59:51,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-01-20 09:59:51,866 INFO L87 Difference]: Start difference. First operand 121 states and 122 transitions. Second operand 61 states. [2019-01-20 09:59:52,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:59:52,233 INFO L93 Difference]: Finished difference Result 184 states and 187 transitions. [2019-01-20 09:59:52,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-01-20 09:59:52,233 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 120 [2019-01-20 09:59:52,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:59:52,234 INFO L225 Difference]: With dead ends: 184 [2019-01-20 09:59:52,234 INFO L226 Difference]: Without dead ends: 123 [2019-01-20 09:59:52,235 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-01-20 09:59:52,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-01-20 09:59:52,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2019-01-20 09:59:52,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-01-20 09:59:52,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 124 transitions. [2019-01-20 09:59:52,239 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 124 transitions. Word has length 120 [2019-01-20 09:59:52,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:59:52,239 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 124 transitions. [2019-01-20 09:59:52,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-01-20 09:59:52,239 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 124 transitions. [2019-01-20 09:59:52,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-01-20 09:59:52,240 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:59:52,240 INFO L402 BasicCegarLoop]: trace histogram [59, 59, 1, 1, 1, 1] [2019-01-20 09:59:52,240 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:59:52,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:59:52,241 INFO L82 PathProgramCache]: Analyzing trace with hash 737003157, now seen corresponding path program 59 times [2019-01-20 09:59:52,241 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:59:52,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:52,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:59:52,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:52,242 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:59:52,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:59:53,747 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2019-01-20 09:59:53,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:53,747 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:59:53,747 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:59:53,747 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:59:53,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:53,747 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:59:53,756 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:59:53,756 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:59:54,774 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2019-01-20 09:59:54,774 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:59:54,781 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:59:54,795 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2019-01-20 09:59:54,795 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:59:58,675 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2019-01-20 09:59:58,697 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:59:58,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 121 [2019-01-20 09:59:58,697 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:59:58,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-01-20 09:59:58,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-01-20 09:59:58,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2019-01-20 09:59:58,699 INFO L87 Difference]: Start difference. First operand 123 states and 124 transitions. Second operand 62 states. [2019-01-20 09:59:59,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:59:59,314 INFO L93 Difference]: Finished difference Result 187 states and 190 transitions. [2019-01-20 09:59:59,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-01-20 09:59:59,315 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 122 [2019-01-20 09:59:59,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:59:59,315 INFO L225 Difference]: With dead ends: 187 [2019-01-20 09:59:59,316 INFO L226 Difference]: Without dead ends: 125 [2019-01-20 09:59:59,316 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2019-01-20 09:59:59,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-01-20 09:59:59,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2019-01-20 09:59:59,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-01-20 09:59:59,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 126 transitions. [2019-01-20 09:59:59,319 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 126 transitions. Word has length 122 [2019-01-20 09:59:59,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:59:59,320 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 126 transitions. [2019-01-20 09:59:59,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-01-20 09:59:59,320 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 126 transitions. [2019-01-20 09:59:59,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-01-20 09:59:59,320 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:59:59,321 INFO L402 BasicCegarLoop]: trace histogram [60, 60, 1, 1, 1, 1] [2019-01-20 09:59:59,321 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:59:59,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:59:59,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1414379914, now seen corresponding path program 60 times [2019-01-20 09:59:59,321 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:59:59,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:59,322 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:59:59,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:59,322 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:59:59,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:00:00,731 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 1830 trivial. 0 not checked. [2019-01-20 10:00:00,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:00:00,732 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:00:00,732 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:00:00,732 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:00:00,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:00:00,732 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:00:00,741 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:00:00,741 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:00:00,825 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:00:00,825 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:00:00,828 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:00:00,857 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 1830 trivial. 0 not checked. [2019-01-20 10:00:00,857 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:00:04,970 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 1830 trivial. 0 not checked. [2019-01-20 10:00:04,989 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:00:04,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 123 [2019-01-20 10:00:04,990 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:00:04,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-01-20 10:00:04,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-01-20 10:00:04,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2019-01-20 10:00:04,991 INFO L87 Difference]: Start difference. First operand 125 states and 126 transitions. Second operand 63 states. [2019-01-20 10:00:05,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:00:05,257 INFO L93 Difference]: Finished difference Result 190 states and 193 transitions. [2019-01-20 10:00:05,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-01-20 10:00:05,257 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 124 [2019-01-20 10:00:05,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:00:05,258 INFO L225 Difference]: With dead ends: 190 [2019-01-20 10:00:05,258 INFO L226 Difference]: Without dead ends: 127 [2019-01-20 10:00:05,259 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2019-01-20 10:00:05,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-01-20 10:00:05,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2019-01-20 10:00:05,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-01-20 10:00:05,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2019-01-20 10:00:05,263 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 124 [2019-01-20 10:00:05,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:00:05,263 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2019-01-20 10:00:05,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-01-20 10:00:05,263 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2019-01-20 10:00:05,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-01-20 10:00:05,264 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:00:05,264 INFO L402 BasicCegarLoop]: trace histogram [61, 61, 1, 1, 1, 1] [2019-01-20 10:00:05,264 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:00:05,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:00:05,264 INFO L82 PathProgramCache]: Analyzing trace with hash -1579405579, now seen corresponding path program 61 times [2019-01-20 10:00:05,264 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:00:05,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:00:05,265 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:00:05,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:00:05,265 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:00:05,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:00:06,700 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2019-01-20 10:00:06,700 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:00:06,700 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:00:06,700 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:00:06,700 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:00:06,700 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:00:06,700 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:00:06,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:00:06,709 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:00:06,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:00:06,797 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:00:06,827 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2019-01-20 10:00:06,827 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:00:10,937 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2019-01-20 10:00:10,955 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:00:10,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 125 [2019-01-20 10:00:10,955 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:00:10,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-01-20 10:00:10,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-01-20 10:00:10,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2019-01-20 10:00:10,957 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand 64 states. [2019-01-20 10:00:11,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:00:11,296 INFO L93 Difference]: Finished difference Result 193 states and 196 transitions. [2019-01-20 10:00:11,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-01-20 10:00:11,296 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 126 [2019-01-20 10:00:11,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:00:11,297 INFO L225 Difference]: With dead ends: 193 [2019-01-20 10:00:11,297 INFO L226 Difference]: Without dead ends: 129 [2019-01-20 10:00:11,298 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2019-01-20 10:00:11,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-01-20 10:00:11,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2019-01-20 10:00:11,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-01-20 10:00:11,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 130 transitions. [2019-01-20 10:00:11,301 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 130 transitions. Word has length 126 [2019-01-20 10:00:11,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:00:11,301 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 130 transitions. [2019-01-20 10:00:11,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-01-20 10:00:11,301 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 130 transitions. [2019-01-20 10:00:11,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-01-20 10:00:11,301 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:00:11,302 INFO L402 BasicCegarLoop]: trace histogram [62, 62, 1, 1, 1, 1] [2019-01-20 10:00:11,302 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:00:11,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:00:11,302 INFO L82 PathProgramCache]: Analyzing trace with hash -1271856982, now seen corresponding path program 62 times [2019-01-20 10:00:11,302 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:00:11,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:00:11,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:00:11,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:00:11,303 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:00:11,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:00:13,019 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2019-01-20 10:00:13,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:00:13,020 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:00:13,020 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:00:13,020 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:00:13,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:00:13,020 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:00:13,029 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:00:13,029 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:00:14,041 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2019-01-20 10:00:14,041 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:00:14,047 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:00:14,061 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2019-01-20 10:00:14,062 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:00:18,342 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2019-01-20 10:00:18,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:00:18,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 127 [2019-01-20 10:00:18,363 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:00:18,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-01-20 10:00:18,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-01-20 10:00:18,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2019-01-20 10:00:18,364 INFO L87 Difference]: Start difference. First operand 129 states and 130 transitions. Second operand 65 states. [2019-01-20 10:00:18,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:00:18,725 INFO L93 Difference]: Finished difference Result 196 states and 199 transitions. [2019-01-20 10:00:18,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-01-20 10:00:18,726 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 128 [2019-01-20 10:00:18,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:00:18,726 INFO L225 Difference]: With dead ends: 196 [2019-01-20 10:00:18,726 INFO L226 Difference]: Without dead ends: 131 [2019-01-20 10:00:18,727 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2019-01-20 10:00:18,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-01-20 10:00:18,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2019-01-20 10:00:18,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-01-20 10:00:18,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 132 transitions. [2019-01-20 10:00:18,731 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 132 transitions. Word has length 128 [2019-01-20 10:00:18,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:00:18,731 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 132 transitions. [2019-01-20 10:00:18,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-01-20 10:00:18,731 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 132 transitions. [2019-01-20 10:00:18,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-01-20 10:00:18,732 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:00:18,732 INFO L402 BasicCegarLoop]: trace histogram [63, 63, 1, 1, 1, 1] [2019-01-20 10:00:18,733 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:00:18,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:00:18,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1741393749, now seen corresponding path program 63 times [2019-01-20 10:00:18,733 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:00:18,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:00:18,734 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:00:18,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:00:18,734 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:00:18,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:00:20,287 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2019-01-20 10:00:20,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:00:20,287 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:00:20,287 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:00:20,287 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:00:20,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:00:20,287 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:00:20,299 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:00:20,299 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:00:20,387 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:00:20,388 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:00:20,391 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:00:20,408 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2019-01-20 10:00:20,408 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:00:24,914 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2019-01-20 10:00:24,942 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:00:24,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 129 [2019-01-20 10:00:24,943 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:00:24,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-01-20 10:00:24,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-01-20 10:00:24,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2019-01-20 10:00:24,944 INFO L87 Difference]: Start difference. First operand 131 states and 132 transitions. Second operand 66 states. [2019-01-20 10:00:25,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:00:25,316 INFO L93 Difference]: Finished difference Result 199 states and 202 transitions. [2019-01-20 10:00:25,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-01-20 10:00:25,316 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 130 [2019-01-20 10:00:25,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:00:25,317 INFO L225 Difference]: With dead ends: 199 [2019-01-20 10:00:25,317 INFO L226 Difference]: Without dead ends: 133 [2019-01-20 10:00:25,318 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2019-01-20 10:00:25,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-01-20 10:00:25,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2019-01-20 10:00:25,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-01-20 10:00:25,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 134 transitions. [2019-01-20 10:00:25,321 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 134 transitions. Word has length 130 [2019-01-20 10:00:25,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:00:25,321 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 134 transitions. [2019-01-20 10:00:25,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-01-20 10:00:25,321 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 134 transitions. [2019-01-20 10:00:25,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-01-20 10:00:25,322 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:00:25,322 INFO L402 BasicCegarLoop]: trace histogram [64, 64, 1, 1, 1, 1] [2019-01-20 10:00:25,323 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:00:25,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:00:25,323 INFO L82 PathProgramCache]: Analyzing trace with hash 573870026, now seen corresponding path program 64 times [2019-01-20 10:00:25,323 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:00:25,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:00:25,324 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:00:25,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:00:25,324 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:00:25,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:00:26,866 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 2080 trivial. 0 not checked. [2019-01-20 10:00:26,866 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:00:26,866 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:00:26,866 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:00:26,867 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:00:26,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:00:26,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 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:00:26,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:00:26,875 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:00:26,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:00:26,968 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:00:26,983 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 2080 trivial. 0 not checked. [2019-01-20 10:00:26,983 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:00:31,582 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 2080 trivial. 0 not checked. [2019-01-20 10:00:31,600 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:00:31,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 131 [2019-01-20 10:00:31,601 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:00:31,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-01-20 10:00:31,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-01-20 10:00:31,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2019-01-20 10:00:31,602 INFO L87 Difference]: Start difference. First operand 133 states and 134 transitions. Second operand 67 states. [2019-01-20 10:00:32,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:00:32,021 INFO L93 Difference]: Finished difference Result 202 states and 205 transitions. [2019-01-20 10:00:32,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-01-20 10:00:32,021 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 132 [2019-01-20 10:00:32,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:00:32,022 INFO L225 Difference]: With dead ends: 202 [2019-01-20 10:00:32,022 INFO L226 Difference]: Without dead ends: 135 [2019-01-20 10:00:32,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2019-01-20 10:00:32,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-01-20 10:00:32,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2019-01-20 10:00:32,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-01-20 10:00:32,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 136 transitions. [2019-01-20 10:00:32,027 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 136 transitions. Word has length 132 [2019-01-20 10:00:32,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:00:32,028 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 136 transitions. [2019-01-20 10:00:32,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-01-20 10:00:32,028 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 136 transitions. [2019-01-20 10:00:32,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-01-20 10:00:32,028 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:00:32,029 INFO L402 BasicCegarLoop]: trace histogram [65, 65, 1, 1, 1, 1] [2019-01-20 10:00:32,029 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:00:32,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:00:32,029 INFO L82 PathProgramCache]: Analyzing trace with hash -904534091, now seen corresponding path program 65 times [2019-01-20 10:00:32,029 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:00:32,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:00:32,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:00:32,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:00:32,030 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:00:32,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:00:34,062 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2019-01-20 10:00:34,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:00:34,062 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:00:34,063 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:00:34,063 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:00:34,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:00:34,063 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:00:34,071 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:00:34,071 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:00:37,073 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2019-01-20 10:00:37,073 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:00:37,086 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:00:37,110 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2019-01-20 10:00:37,110 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:00:42,174 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2019-01-20 10:00:42,198 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:00:42,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 133 [2019-01-20 10:00:42,198 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:00:42,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-01-20 10:00:42,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-01-20 10:00:42,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2019-01-20 10:00:42,200 INFO L87 Difference]: Start difference. First operand 135 states and 136 transitions. Second operand 68 states. [2019-01-20 10:00:42,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:00:42,553 INFO L93 Difference]: Finished difference Result 205 states and 208 transitions. [2019-01-20 10:00:42,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-01-20 10:00:42,553 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 134 [2019-01-20 10:00:42,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:00:42,554 INFO L225 Difference]: With dead ends: 205 [2019-01-20 10:00:42,554 INFO L226 Difference]: Without dead ends: 137 [2019-01-20 10:00:42,555 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2019-01-20 10:00:42,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-01-20 10:00:42,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2019-01-20 10:00:42,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-01-20 10:00:42,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 138 transitions. [2019-01-20 10:00:42,557 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 138 transitions. Word has length 134 [2019-01-20 10:00:42,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:00:42,557 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 138 transitions. [2019-01-20 10:00:42,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-01-20 10:00:42,558 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 138 transitions. [2019-01-20 10:00:42,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-01-20 10:00:42,558 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:00:42,558 INFO L402 BasicCegarLoop]: trace histogram [66, 66, 1, 1, 1, 1] [2019-01-20 10:00:42,558 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:00:42,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:00:42,559 INFO L82 PathProgramCache]: Analyzing trace with hash -1843501334, now seen corresponding path program 66 times [2019-01-20 10:00:42,559 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:00:42,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:00:42,559 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:00:42,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:00:42,559 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:00:42,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:00:44,905 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 2211 trivial. 0 not checked. [2019-01-20 10:00:44,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:00:44,905 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:00:44,905 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:00:44,905 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:00:44,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:00:44,905 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:00:44,916 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:00:44,916 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:00:45,004 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:00:45,004 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:00:45,007 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:00:45,032 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 2211 trivial. 0 not checked. [2019-01-20 10:00:45,032 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:00:50,040 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 2211 trivial. 0 not checked. [2019-01-20 10:00:50,059 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:00:50,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 135 [2019-01-20 10:00:50,059 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:00:50,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-01-20 10:00:50,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-01-20 10:00:50,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2019-01-20 10:00:50,060 INFO L87 Difference]: Start difference. First operand 137 states and 138 transitions. Second operand 69 states. [2019-01-20 10:00:50,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:00:50,494 INFO L93 Difference]: Finished difference Result 208 states and 211 transitions. [2019-01-20 10:00:50,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-01-20 10:00:50,494 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 136 [2019-01-20 10:00:50,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:00:50,495 INFO L225 Difference]: With dead ends: 208 [2019-01-20 10:00:50,495 INFO L226 Difference]: Without dead ends: 139 [2019-01-20 10:00:50,496 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2019-01-20 10:00:50,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-01-20 10:00:50,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2019-01-20 10:00:50,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-01-20 10:00:50,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 140 transitions. [2019-01-20 10:00:50,499 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 140 transitions. Word has length 136 [2019-01-20 10:00:50,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:00:50,499 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 140 transitions. [2019-01-20 10:00:50,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-01-20 10:00:50,499 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 140 transitions. [2019-01-20 10:00:50,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-01-20 10:00:50,499 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:00:50,500 INFO L402 BasicCegarLoop]: trace histogram [67, 67, 1, 1, 1, 1] [2019-01-20 10:00:50,500 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:00:50,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:00:50,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1251293205, now seen corresponding path program 67 times [2019-01-20 10:00:50,500 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:00:50,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:00:50,501 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:00:50,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:00:50,501 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:00:50,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:00:52,167 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2019-01-20 10:00:52,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:00:52,167 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:00:52,167 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:00:52,167 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:00:52,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:00:52,167 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:00:52,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:00:52,175 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:00:52,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:00:52,272 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:00:52,289 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2019-01-20 10:00:52,290 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:00:57,370 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2019-01-20 10:00:57,389 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:00:57,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 137 [2019-01-20 10:00:57,389 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:00:57,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-01-20 10:00:57,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-01-20 10:00:57,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2019-01-20 10:00:57,391 INFO L87 Difference]: Start difference. First operand 139 states and 140 transitions. Second operand 70 states. [2019-01-20 10:00:57,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:00:57,846 INFO L93 Difference]: Finished difference Result 211 states and 214 transitions. [2019-01-20 10:00:57,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-01-20 10:00:57,846 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 138 [2019-01-20 10:00:57,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:00:57,847 INFO L225 Difference]: With dead ends: 211 [2019-01-20 10:00:57,847 INFO L226 Difference]: Without dead ends: 141 [2019-01-20 10:00:57,848 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2019-01-20 10:00:57,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-01-20 10:00:57,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2019-01-20 10:00:57,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-01-20 10:00:57,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 142 transitions. [2019-01-20 10:00:57,850 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 142 transitions. Word has length 138 [2019-01-20 10:00:57,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:00:57,851 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 142 transitions. [2019-01-20 10:00:57,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-01-20 10:00:57,851 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 142 transitions. [2019-01-20 10:00:57,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-01-20 10:00:57,851 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:00:57,851 INFO L402 BasicCegarLoop]: trace histogram [68, 68, 1, 1, 1, 1] [2019-01-20 10:00:57,852 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:00:57,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:00:57,852 INFO L82 PathProgramCache]: Analyzing trace with hash 36996618, now seen corresponding path program 68 times [2019-01-20 10:00:57,852 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:00:57,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:00:57,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:00:57,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:00:57,853 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:00:57,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:00:59,837 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2019-01-20 10:00:59,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:00:59,838 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:00:59,838 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:00:59,838 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:00:59,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:00:59,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 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:00:59,847 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:00:59,847 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:01:03,145 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2019-01-20 10:01:03,145 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:01:03,162 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:01:03,179 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2019-01-20 10:01:03,179 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:01:08,322 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2019-01-20 10:01:08,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:01:08,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 139 [2019-01-20 10:01:08,344 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:01:08,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-01-20 10:01:08,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-01-20 10:01:08,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2019-01-20 10:01:08,346 INFO L87 Difference]: Start difference. First operand 141 states and 142 transitions. Second operand 71 states. [2019-01-20 10:01:08,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:01:08,855 INFO L93 Difference]: Finished difference Result 214 states and 217 transitions. [2019-01-20 10:01:08,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-01-20 10:01:08,855 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 140 [2019-01-20 10:01:08,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:01:08,856 INFO L225 Difference]: With dead ends: 214 [2019-01-20 10:01:08,856 INFO L226 Difference]: Without dead ends: 143 [2019-01-20 10:01:08,857 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2019-01-20 10:01:08,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-01-20 10:01:08,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2019-01-20 10:01:08,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-01-20 10:01:08,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 144 transitions. [2019-01-20 10:01:08,859 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 144 transitions. Word has length 140 [2019-01-20 10:01:08,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:01:08,860 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 144 transitions. [2019-01-20 10:01:08,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-01-20 10:01:08,860 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 144 transitions. [2019-01-20 10:01:08,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-01-20 10:01:08,860 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:01:08,860 INFO L402 BasicCegarLoop]: trace histogram [69, 69, 1, 1, 1, 1] [2019-01-20 10:01:08,861 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:01:08,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:01:08,861 INFO L82 PathProgramCache]: Analyzing trace with hash 1084457077, now seen corresponding path program 69 times [2019-01-20 10:01:08,861 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:01:08,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:08,862 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:01:08,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:08,862 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:01:08,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:01:10,842 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2019-01-20 10:01:10,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:01:10,842 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:01:10,842 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:01:10,842 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:01:10,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:01:10,842 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:01:10,850 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:01:10,851 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:01:10,948 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:01:10,948 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:01:10,951 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:01:10,970 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2019-01-20 10:01:10,970 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:01:16,184 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2019-01-20 10:01:16,203 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:01:16,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 141 [2019-01-20 10:01:16,203 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:01:16,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-01-20 10:01:16,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-01-20 10:01:16,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2019-01-20 10:01:16,205 INFO L87 Difference]: Start difference. First operand 143 states and 144 transitions. Second operand 72 states. [2019-01-20 10:01:16,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:01:16,672 INFO L93 Difference]: Finished difference Result 217 states and 220 transitions. [2019-01-20 10:01:16,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-01-20 10:01:16,672 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 142 [2019-01-20 10:01:16,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:01:16,673 INFO L225 Difference]: With dead ends: 217 [2019-01-20 10:01:16,673 INFO L226 Difference]: Without dead ends: 145 [2019-01-20 10:01:16,674 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2019-01-20 10:01:16,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-01-20 10:01:16,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2019-01-20 10:01:16,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-01-20 10:01:16,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 146 transitions. [2019-01-20 10:01:16,677 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 146 transitions. Word has length 142 [2019-01-20 10:01:16,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:01:16,677 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 146 transitions. [2019-01-20 10:01:16,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-01-20 10:01:16,677 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 146 transitions. [2019-01-20 10:01:16,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-01-20 10:01:16,678 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:01:16,678 INFO L402 BasicCegarLoop]: trace histogram [70, 70, 1, 1, 1, 1] [2019-01-20 10:01:16,678 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:01:16,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:01:16,678 INFO L82 PathProgramCache]: Analyzing trace with hash -616764118, now seen corresponding path program 70 times [2019-01-20 10:01:16,678 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:01:16,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:16,679 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:01:16,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:16,679 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:01:16,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:01:18,511 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 2485 trivial. 0 not checked. [2019-01-20 10:01:18,511 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:01:18,511 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:01:18,511 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:01:18,511 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:01:18,511 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:01:18,512 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:01:18,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:01:18,519 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:01:18,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:01:18,620 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:01:18,636 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 2485 trivial. 0 not checked. [2019-01-20 10:01:18,636 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:01:24,018 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 2485 trivial. 0 not checked. [2019-01-20 10:01:24,037 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:01:24,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 143 [2019-01-20 10:01:24,037 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:01:24,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-01-20 10:01:24,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-01-20 10:01:24,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2019-01-20 10:01:24,039 INFO L87 Difference]: Start difference. First operand 145 states and 146 transitions. Second operand 73 states. [2019-01-20 10:01:24,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:01:24,481 INFO L93 Difference]: Finished difference Result 220 states and 223 transitions. [2019-01-20 10:01:24,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-01-20 10:01:24,481 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 144 [2019-01-20 10:01:24,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:01:24,482 INFO L225 Difference]: With dead ends: 220 [2019-01-20 10:01:24,482 INFO L226 Difference]: Without dead ends: 147 [2019-01-20 10:01:24,484 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2019-01-20 10:01:24,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-01-20 10:01:24,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2019-01-20 10:01:24,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-01-20 10:01:24,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 148 transitions. [2019-01-20 10:01:24,487 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 148 transitions. Word has length 144 [2019-01-20 10:01:24,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:01:24,488 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 148 transitions. [2019-01-20 10:01:24,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-01-20 10:01:24,488 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 148 transitions. [2019-01-20 10:01:24,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-01-20 10:01:24,489 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:01:24,489 INFO L402 BasicCegarLoop]: trace histogram [71, 71, 1, 1, 1, 1] [2019-01-20 10:01:24,489 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:01:24,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:01:24,489 INFO L82 PathProgramCache]: Analyzing trace with hash 2031796437, now seen corresponding path program 71 times [2019-01-20 10:01:24,490 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:01:24,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:24,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:01:24,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:24,490 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:01:24,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:01:26,575 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2019-01-20 10:01:26,576 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:01:26,576 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:01:26,576 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:01:26,576 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:01:26,576 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:01:26,576 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:01:26,584 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:01:26,584 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:01:29,268 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 37 check-sat command(s) [2019-01-20 10:01:29,269 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:01:29,282 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:01:29,298 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2019-01-20 10:01:29,299 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:01:34,983 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2019-01-20 10:01:35,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:01:35,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 145 [2019-01-20 10:01:35,007 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:01:35,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-01-20 10:01:35,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-01-20 10:01:35,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2019-01-20 10:01:35,008 INFO L87 Difference]: Start difference. First operand 147 states and 148 transitions. Second operand 74 states. [2019-01-20 10:01:35,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:01:35,533 INFO L93 Difference]: Finished difference Result 223 states and 226 transitions. [2019-01-20 10:01:35,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-01-20 10:01:35,534 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 146 [2019-01-20 10:01:35,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:01:35,534 INFO L225 Difference]: With dead ends: 223 [2019-01-20 10:01:35,534 INFO L226 Difference]: Without dead ends: 149 [2019-01-20 10:01:35,535 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2019-01-20 10:01:35,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-01-20 10:01:35,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2019-01-20 10:01:35,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-01-20 10:01:35,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 150 transitions. [2019-01-20 10:01:35,539 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 150 transitions. Word has length 146 [2019-01-20 10:01:35,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:01:35,539 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 150 transitions. [2019-01-20 10:01:35,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-01-20 10:01:35,539 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 150 transitions. [2019-01-20 10:01:35,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-01-20 10:01:35,540 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:01:35,540 INFO L402 BasicCegarLoop]: trace histogram [72, 72, 1, 1, 1, 1] [2019-01-20 10:01:35,540 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:01:35,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:01:35,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1350409290, now seen corresponding path program 72 times [2019-01-20 10:01:35,541 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:01:35,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:35,541 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:01:35,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:35,542 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:01:35,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:01:37,666 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 2628 trivial. 0 not checked. [2019-01-20 10:01:37,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:01:37,666 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:01:37,666 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:01:37,666 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:01:37,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:01:37,666 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:01:37,675 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:01:37,675 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:01:37,777 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:01:37,778 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:01:37,781 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:01:37,808 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 2628 trivial. 0 not checked. [2019-01-20 10:01:37,808 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:01:43,673 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 2628 trivial. 0 not checked. [2019-01-20 10:01:43,691 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:01:43,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 147 [2019-01-20 10:01:43,692 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:01:43,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-01-20 10:01:43,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-01-20 10:01:43,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2019-01-20 10:01:43,693 INFO L87 Difference]: Start difference. First operand 149 states and 150 transitions. Second operand 75 states. [2019-01-20 10:01:44,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:01:44,170 INFO L93 Difference]: Finished difference Result 226 states and 229 transitions. [2019-01-20 10:01:44,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-01-20 10:01:44,170 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 148 [2019-01-20 10:01:44,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:01:44,171 INFO L225 Difference]: With dead ends: 226 [2019-01-20 10:01:44,171 INFO L226 Difference]: Without dead ends: 151 [2019-01-20 10:01:44,172 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2019-01-20 10:01:44,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-01-20 10:01:44,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2019-01-20 10:01:44,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-01-20 10:01:44,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 152 transitions. [2019-01-20 10:01:44,175 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 152 transitions. Word has length 148 [2019-01-20 10:01:44,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:01:44,176 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 152 transitions. [2019-01-20 10:01:44,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-01-20 10:01:44,176 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 152 transitions. [2019-01-20 10:01:44,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-01-20 10:01:44,176 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:01:44,177 INFO L402 BasicCegarLoop]: trace histogram [73, 73, 1, 1, 1, 1] [2019-01-20 10:01:44,177 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:01:44,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:01:44,177 INFO L82 PathProgramCache]: Analyzing trace with hash -699074251, now seen corresponding path program 73 times [2019-01-20 10:01:44,177 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:01:44,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:44,178 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:01:44,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:44,178 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:01:44,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:01:46,491 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 2701 trivial. 0 not checked. [2019-01-20 10:01:46,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:01:46,492 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:01:46,492 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:01:46,492 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:01:46,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:01:46,492 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:01:46,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:01:46,502 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:01:46,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:01:46,606 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:01:46,633 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 2701 trivial. 0 not checked. [2019-01-20 10:01:46,634 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:01:52,447 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 2701 trivial. 0 not checked. [2019-01-20 10:01:52,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:01:52,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 149 [2019-01-20 10:01:52,466 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:01:52,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-01-20 10:01:52,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-01-20 10:01:52,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2019-01-20 10:01:52,468 INFO L87 Difference]: Start difference. First operand 151 states and 152 transitions. Second operand 76 states. [2019-01-20 10:01:52,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:01:52,931 INFO L93 Difference]: Finished difference Result 229 states and 232 transitions. [2019-01-20 10:01:52,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-01-20 10:01:52,931 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 150 [2019-01-20 10:01:52,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:01:52,932 INFO L225 Difference]: With dead ends: 229 [2019-01-20 10:01:52,932 INFO L226 Difference]: Without dead ends: 153 [2019-01-20 10:01:52,933 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2019-01-20 10:01:52,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-01-20 10:01:52,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2019-01-20 10:01:52,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-01-20 10:01:52,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 154 transitions. [2019-01-20 10:01:52,936 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 154 transitions. Word has length 150 [2019-01-20 10:01:52,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:01:52,937 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 154 transitions. [2019-01-20 10:01:52,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-01-20 10:01:52,937 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 154 transitions. [2019-01-20 10:01:52,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-01-20 10:01:52,937 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:01:52,937 INFO L402 BasicCegarLoop]: trace histogram [74, 74, 1, 1, 1, 1] [2019-01-20 10:01:52,937 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:01:52,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:01:52,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1078160534, now seen corresponding path program 74 times [2019-01-20 10:01:52,938 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:01:52,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:52,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:01:52,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:52,939 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:01:52,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:01:55,210 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2019-01-20 10:01:55,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:01:55,210 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:01:55,210 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:01:55,210 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:01:55,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:01:55,211 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:01:55,220 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:01:55,220 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:01:57,422 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2019-01-20 10:01:57,422 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:01:57,431 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:01:57,457 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2019-01-20 10:01:57,458 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:02:03,546 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2019-01-20 10:02:03,569 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:02:03,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 151 [2019-01-20 10:02:03,569 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:02:03,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-01-20 10:02:03,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-01-20 10:02:03,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2019-01-20 10:02:03,571 INFO L87 Difference]: Start difference. First operand 153 states and 154 transitions. Second operand 77 states. [2019-01-20 10:02:04,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:02:04,108 INFO L93 Difference]: Finished difference Result 232 states and 235 transitions. [2019-01-20 10:02:04,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-01-20 10:02:04,108 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 152 [2019-01-20 10:02:04,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:02:04,109 INFO L225 Difference]: With dead ends: 232 [2019-01-20 10:02:04,109 INFO L226 Difference]: Without dead ends: 155 [2019-01-20 10:02:04,110 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2019-01-20 10:02:04,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-01-20 10:02:04,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2019-01-20 10:02:04,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-01-20 10:02:04,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 156 transitions. [2019-01-20 10:02:04,114 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 156 transitions. Word has length 152 [2019-01-20 10:02:04,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:02:04,114 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 156 transitions. [2019-01-20 10:02:04,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-01-20 10:02:04,115 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 156 transitions. [2019-01-20 10:02:04,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-01-20 10:02:04,115 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:02:04,115 INFO L402 BasicCegarLoop]: trace histogram [75, 75, 1, 1, 1, 1] [2019-01-20 10:02:04,116 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:02:04,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:04,116 INFO L82 PathProgramCache]: Analyzing trace with hash -265541227, now seen corresponding path program 75 times [2019-01-20 10:02:04,116 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:02:04,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:04,116 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:02:04,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:04,117 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:02:04,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:06,408 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 2850 trivial. 0 not checked. [2019-01-20 10:02:06,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:06,409 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:02:06,409 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:02:06,409 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:02:06,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:06,409 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:02:06,418 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:02:06,418 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:02:06,523 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:02:06,523 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:02:06,527 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:02:06,547 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 2850 trivial. 0 not checked. [2019-01-20 10:02:06,548 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:02:12,625 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 2850 trivial. 0 not checked. [2019-01-20 10:02:12,644 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:02:12,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 153 [2019-01-20 10:02:12,644 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:02:12,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-01-20 10:02:12,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-01-20 10:02:12,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2019-01-20 10:02:12,646 INFO L87 Difference]: Start difference. First operand 155 states and 156 transitions. Second operand 78 states. [2019-01-20 10:02:13,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:02:13,287 INFO L93 Difference]: Finished difference Result 235 states and 238 transitions. [2019-01-20 10:02:13,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-01-20 10:02:13,287 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 154 [2019-01-20 10:02:13,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:02:13,288 INFO L225 Difference]: With dead ends: 235 [2019-01-20 10:02:13,288 INFO L226 Difference]: Without dead ends: 157 [2019-01-20 10:02:13,289 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-01-20 10:02:13,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-01-20 10:02:13,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2019-01-20 10:02:13,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-01-20 10:02:13,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 158 transitions. [2019-01-20 10:02:13,291 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 158 transitions. Word has length 154 [2019-01-20 10:02:13,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:02:13,291 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 158 transitions. [2019-01-20 10:02:13,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-01-20 10:02:13,292 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 158 transitions. [2019-01-20 10:02:13,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-01-20 10:02:13,292 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:02:13,292 INFO L402 BasicCegarLoop]: trace histogram [76, 76, 1, 1, 1, 1] [2019-01-20 10:02:13,292 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:02:13,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:13,293 INFO L82 PathProgramCache]: Analyzing trace with hash 289395338, now seen corresponding path program 76 times [2019-01-20 10:02:13,293 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:02:13,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:13,293 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:02:13,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:13,293 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:02:13,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:15,632 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 2926 trivial. 0 not checked. [2019-01-20 10:02:15,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:15,632 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:02:15,632 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:02:15,632 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:02:15,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:15,632 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:02:15,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:02:15,641 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:02:15,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:15,748 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:02:15,767 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 2926 trivial. 0 not checked. [2019-01-20 10:02:15,768 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:02:21,987 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 2926 trivial. 0 not checked. [2019-01-20 10:02:22,005 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:02:22,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 155 [2019-01-20 10:02:22,006 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:02:22,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-01-20 10:02:22,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-01-20 10:02:22,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2019-01-20 10:02:22,007 INFO L87 Difference]: Start difference. First operand 157 states and 158 transitions. Second operand 79 states. [2019-01-20 10:02:22,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:02:22,537 INFO L93 Difference]: Finished difference Result 238 states and 241 transitions. [2019-01-20 10:02:22,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-01-20 10:02:22,538 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 156 [2019-01-20 10:02:22,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:02:22,539 INFO L225 Difference]: With dead ends: 238 [2019-01-20 10:02:22,539 INFO L226 Difference]: Without dead ends: 159 [2019-01-20 10:02:22,540 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-01-20 10:02:22,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-01-20 10:02:22,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2019-01-20 10:02:22,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-01-20 10:02:22,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 160 transitions. [2019-01-20 10:02:22,543 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 160 transitions. Word has length 156 [2019-01-20 10:02:22,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:02:22,543 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 160 transitions. [2019-01-20 10:02:22,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-01-20 10:02:22,543 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 160 transitions. [2019-01-20 10:02:22,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-01-20 10:02:22,544 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:02:22,544 INFO L402 BasicCegarLoop]: trace histogram [77, 77, 1, 1, 1, 1] [2019-01-20 10:02:22,544 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:02:22,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:22,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1275440651, now seen corresponding path program 77 times [2019-01-20 10:02:22,545 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:02:22,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:22,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:02:22,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:22,545 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:02:22,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:24,746 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2019-01-20 10:02:24,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:24,746 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:02:24,746 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:02:24,746 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:02:24,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:24,746 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:02:24,754 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:02:24,755 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:02:29,078 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2019-01-20 10:02:29,078 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:02:29,097 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:02:29,115 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2019-01-20 10:02:29,116 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:02:35,491 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2019-01-20 10:02:35,515 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:02:35,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 157 [2019-01-20 10:02:35,516 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:02:35,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-01-20 10:02:35,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-01-20 10:02:35,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2019-01-20 10:02:35,518 INFO L87 Difference]: Start difference. First operand 159 states and 160 transitions. Second operand 80 states. [2019-01-20 10:02:36,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:02:36,119 INFO L93 Difference]: Finished difference Result 241 states and 244 transitions. [2019-01-20 10:02:36,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-01-20 10:02:36,119 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 158 [2019-01-20 10:02:36,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:02:36,120 INFO L225 Difference]: With dead ends: 241 [2019-01-20 10:02:36,120 INFO L226 Difference]: Without dead ends: 161 [2019-01-20 10:02:36,121 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2019-01-20 10:02:36,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-01-20 10:02:36,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2019-01-20 10:02:36,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-01-20 10:02:36,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 162 transitions. [2019-01-20 10:02:36,125 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 162 transitions. Word has length 158 [2019-01-20 10:02:36,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:02:36,125 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 162 transitions. [2019-01-20 10:02:36,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-01-20 10:02:36,125 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 162 transitions. [2019-01-20 10:02:36,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-01-20 10:02:36,126 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:02:36,126 INFO L402 BasicCegarLoop]: trace histogram [78, 78, 1, 1, 1, 1] [2019-01-20 10:02:36,127 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:02:36,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:36,127 INFO L82 PathProgramCache]: Analyzing trace with hash 399333802, now seen corresponding path program 78 times [2019-01-20 10:02:36,127 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:02:36,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:36,128 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:02:36,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:36,128 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:02:36,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:38,307 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 3081 trivial. 0 not checked. [2019-01-20 10:02:38,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:38,308 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:02:38,308 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:02:38,308 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:02:38,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:38,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 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:02:38,317 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:02:38,317 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:02:38,425 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:02:38,426 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:02:38,429 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:02:38,450 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 3081 trivial. 0 not checked. [2019-01-20 10:02:38,451 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:02:45,260 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 3081 trivial. 0 not checked. [2019-01-20 10:02:45,279 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:02:45,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 159 [2019-01-20 10:02:45,279 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:02:45,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-01-20 10:02:45,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-01-20 10:02:45,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2019-01-20 10:02:45,281 INFO L87 Difference]: Start difference. First operand 161 states and 162 transitions. Second operand 81 states. [2019-01-20 10:02:45,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:02:45,997 INFO L93 Difference]: Finished difference Result 244 states and 247 transitions. [2019-01-20 10:02:45,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-01-20 10:02:45,997 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 160 [2019-01-20 10:02:45,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:02:45,998 INFO L225 Difference]: With dead ends: 244 [2019-01-20 10:02:45,998 INFO L226 Difference]: Without dead ends: 163 [2019-01-20 10:02:45,999 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2019-01-20 10:02:45,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-01-20 10:02:46,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2019-01-20 10:02:46,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-01-20 10:02:46,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 164 transitions. [2019-01-20 10:02:46,003 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 164 transitions. Word has length 160 [2019-01-20 10:02:46,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:02:46,003 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 164 transitions. [2019-01-20 10:02:46,003 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-01-20 10:02:46,003 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 164 transitions. [2019-01-20 10:02:46,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-01-20 10:02:46,004 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:02:46,004 INFO L402 BasicCegarLoop]: trace histogram [79, 79, 1, 1, 1, 1] [2019-01-20 10:02:46,005 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:02:46,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:46,005 INFO L82 PathProgramCache]: Analyzing trace with hash 77165141, now seen corresponding path program 79 times [2019-01-20 10:02:46,005 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:02:46,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:46,006 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:02:46,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:46,006 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:02:46,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:48,410 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 3160 trivial. 0 not checked. [2019-01-20 10:02:48,410 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:48,410 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:02:48,410 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:02:48,411 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:02:48,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:48,411 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:02:48,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:02:48,420 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:02:48,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:48,533 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:02:48,575 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 3160 trivial. 0 not checked. [2019-01-20 10:02:48,575 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:02:55,405 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 3160 trivial. 0 not checked. [2019-01-20 10:02:55,424 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:02:55,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 161 [2019-01-20 10:02:55,425 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:02:55,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-01-20 10:02:55,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-01-20 10:02:55,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2019-01-20 10:02:55,426 INFO L87 Difference]: Start difference. First operand 163 states and 164 transitions. Second operand 82 states. [2019-01-20 10:02:56,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:02:56,144 INFO L93 Difference]: Finished difference Result 247 states and 250 transitions. [2019-01-20 10:02:56,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-01-20 10:02:56,145 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 162 [2019-01-20 10:02:56,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:02:56,145 INFO L225 Difference]: With dead ends: 247 [2019-01-20 10:02:56,145 INFO L226 Difference]: Without dead ends: 165 [2019-01-20 10:02:56,146 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2019-01-20 10:02:56,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-01-20 10:02:56,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2019-01-20 10:02:56,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-01-20 10:02:56,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 166 transitions. [2019-01-20 10:02:56,149 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 166 transitions. Word has length 162 [2019-01-20 10:02:56,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:02:56,149 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 166 transitions. [2019-01-20 10:02:56,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-01-20 10:02:56,149 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 166 transitions. [2019-01-20 10:02:56,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-01-20 10:02:56,150 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:02:56,150 INFO L402 BasicCegarLoop]: trace histogram [80, 80, 1, 1, 1, 1] [2019-01-20 10:02:56,151 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:02:56,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:56,151 INFO L82 PathProgramCache]: Analyzing trace with hash -257218358, now seen corresponding path program 80 times [2019-01-20 10:02:56,151 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:02:56,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:56,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:02:56,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:56,152 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:02:56,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:58,806 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2019-01-20 10:02:58,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:58,806 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:02:58,807 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:02:58,807 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:02:58,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:58,807 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:02:58,817 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:02:58,817 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:03:01,767 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 41 check-sat command(s) [2019-01-20 10:03:01,767 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:03:01,775 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:03:01,795 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2019-01-20 10:03:01,795 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:03:09,016 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2019-01-20 10:03:09,040 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:03:09,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 163 [2019-01-20 10:03:09,040 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:03:09,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-01-20 10:03:09,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-01-20 10:03:09,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2019-01-20 10:03:09,042 INFO L87 Difference]: Start difference. First operand 165 states and 166 transitions. Second operand 83 states. [2019-01-20 10:03:09,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:03:09,771 INFO L93 Difference]: Finished difference Result 250 states and 253 transitions. [2019-01-20 10:03:09,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-01-20 10:03:09,771 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 164 [2019-01-20 10:03:09,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:03:09,772 INFO L225 Difference]: With dead ends: 250 [2019-01-20 10:03:09,772 INFO L226 Difference]: Without dead ends: 167 [2019-01-20 10:03:09,773 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2019-01-20 10:03:09,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-01-20 10:03:09,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2019-01-20 10:03:09,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-01-20 10:03:09,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 168 transitions. [2019-01-20 10:03:09,776 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 168 transitions. Word has length 164 [2019-01-20 10:03:09,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:03:09,776 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 168 transitions. [2019-01-20 10:03:09,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-01-20 10:03:09,776 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 168 transitions. [2019-01-20 10:03:09,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-01-20 10:03:09,776 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:03:09,777 INFO L402 BasicCegarLoop]: trace histogram [81, 81, 1, 1, 1, 1] [2019-01-20 10:03:09,777 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:03:09,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:03:09,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1516473013, now seen corresponding path program 81 times [2019-01-20 10:03:09,777 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:03:09,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:03:09,778 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:03:09,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:03:09,778 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:03:09,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:03:12,502 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 3321 trivial. 0 not checked. [2019-01-20 10:03:12,502 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:03:12,503 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:03:12,503 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:03:12,503 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:03:12,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:03:12,503 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:03:12,511 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:03:12,512 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:03:12,625 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:03:12,625 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:03:12,630 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:03:12,650 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 3321 trivial. 0 not checked. [2019-01-20 10:03:12,651 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:03:19,771 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 3321 trivial. 0 not checked. [2019-01-20 10:03:19,789 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:03:19,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 165 [2019-01-20 10:03:19,789 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:03:19,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-01-20 10:03:19,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-01-20 10:03:19,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2019-01-20 10:03:19,791 INFO L87 Difference]: Start difference. First operand 167 states and 168 transitions. Second operand 84 states. [2019-01-20 10:03:20,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:03:20,385 INFO L93 Difference]: Finished difference Result 253 states and 256 transitions. [2019-01-20 10:03:20,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-01-20 10:03:20,385 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 166 [2019-01-20 10:03:20,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:03:20,386 INFO L225 Difference]: With dead ends: 253 [2019-01-20 10:03:20,386 INFO L226 Difference]: Without dead ends: 169 [2019-01-20 10:03:20,387 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2019-01-20 10:03:20,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-01-20 10:03:20,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2019-01-20 10:03:20,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-01-20 10:03:20,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 170 transitions. [2019-01-20 10:03:20,390 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 170 transitions. Word has length 166 [2019-01-20 10:03:20,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:03:20,390 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 170 transitions. [2019-01-20 10:03:20,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-01-20 10:03:20,390 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 170 transitions. [2019-01-20 10:03:20,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-01-20 10:03:20,391 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:03:20,391 INFO L402 BasicCegarLoop]: trace histogram [82, 82, 1, 1, 1, 1] [2019-01-20 10:03:20,391 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:03:20,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:03:20,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1671380970, now seen corresponding path program 82 times [2019-01-20 10:03:20,391 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:03:20,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:03:20,392 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:03:20,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:03:20,392 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:03:20,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:03:23,132 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 3403 trivial. 0 not checked. [2019-01-20 10:03:23,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:03:23,133 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:03:23,133 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:03:23,133 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:03:23,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:03:23,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 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:03:23,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:03:23,143 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:03:23,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:03:23,260 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:03:23,280 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 3403 trivial. 0 not checked. [2019-01-20 10:03:23,280 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:03:30,371 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 3403 trivial. 0 not checked. [2019-01-20 10:03:30,390 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:03:30,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 167 [2019-01-20 10:03:30,390 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:03:30,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-01-20 10:03:30,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-01-20 10:03:30,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2019-01-20 10:03:30,392 INFO L87 Difference]: Start difference. First operand 169 states and 170 transitions. Second operand 85 states. [2019-01-20 10:03:31,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:03:31,178 INFO L93 Difference]: Finished difference Result 256 states and 259 transitions. [2019-01-20 10:03:31,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-01-20 10:03:31,178 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 168 [2019-01-20 10:03:31,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:03:31,179 INFO L225 Difference]: With dead ends: 256 [2019-01-20 10:03:31,179 INFO L226 Difference]: Without dead ends: 171 [2019-01-20 10:03:31,180 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2019-01-20 10:03:31,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-01-20 10:03:31,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2019-01-20 10:03:31,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-01-20 10:03:31,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 172 transitions. [2019-01-20 10:03:31,183 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 172 transitions. Word has length 168 [2019-01-20 10:03:31,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:03:31,183 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 172 transitions. [2019-01-20 10:03:31,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-01-20 10:03:31,183 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 172 transitions. [2019-01-20 10:03:31,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-01-20 10:03:31,183 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:03:31,184 INFO L402 BasicCegarLoop]: trace histogram [83, 83, 1, 1, 1, 1] [2019-01-20 10:03:31,184 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:03:31,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:03:31,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1664260885, now seen corresponding path program 83 times [2019-01-20 10:03:31,184 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:03:31,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:03:31,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:03:31,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:03:31,185 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:03:31,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:03:33,977 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2019-01-20 10:03:33,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:03:33,977 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:03:33,977 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:03:33,977 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:03:33,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:03:33,978 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:03:33,987 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:03:33,987 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:03:42,574 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 43 check-sat command(s) [2019-01-20 10:03:42,574 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:03:42,601 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:03:42,622 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2019-01-20 10:03:42,622 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:03:50,008 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2019-01-20 10:03:50,033 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:03:50,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 169 [2019-01-20 10:03:50,033 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:03:50,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-01-20 10:03:50,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-01-20 10:03:50,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2019-01-20 10:03:50,035 INFO L87 Difference]: Start difference. First operand 171 states and 172 transitions. Second operand 86 states. [2019-01-20 10:03:50,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:03:50,885 INFO L93 Difference]: Finished difference Result 259 states and 262 transitions. [2019-01-20 10:03:50,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-01-20 10:03:50,885 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 170 [2019-01-20 10:03:50,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:03:50,886 INFO L225 Difference]: With dead ends: 259 [2019-01-20 10:03:50,886 INFO L226 Difference]: Without dead ends: 173 [2019-01-20 10:03:50,887 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2019-01-20 10:03:50,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-01-20 10:03:50,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2019-01-20 10:03:50,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-01-20 10:03:50,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 174 transitions. [2019-01-20 10:03:50,890 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 174 transitions. Word has length 170 [2019-01-20 10:03:50,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:03:50,890 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 174 transitions. [2019-01-20 10:03:50,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-01-20 10:03:50,890 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 174 transitions. [2019-01-20 10:03:50,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-01-20 10:03:50,891 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:03:50,891 INFO L402 BasicCegarLoop]: trace histogram [84, 84, 1, 1, 1, 1] [2019-01-20 10:03:50,892 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:03:50,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:03:50,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1123000074, now seen corresponding path program 84 times [2019-01-20 10:03:50,892 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:03:50,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:03:50,893 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:03:50,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:03:50,893 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:03:50,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:03:53,792 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 3570 trivial. 0 not checked. [2019-01-20 10:03:53,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:03:53,793 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:03:53,793 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:03:53,793 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:03:53,793 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:03:53,793 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:03:53,800 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:03:53,801 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:03:53,919 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:03:53,919 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:03:53,924 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:03:53,946 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 3570 trivial. 0 not checked. [2019-01-20 10:03:53,946 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:04:01,590 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 3570 trivial. 0 not checked. [2019-01-20 10:04:01,608 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:04:01,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 171 [2019-01-20 10:04:01,608 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:04:01,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-01-20 10:04:01,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-01-20 10:04:01,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2019-01-20 10:04:01,610 INFO L87 Difference]: Start difference. First operand 173 states and 174 transitions. Second operand 87 states. [2019-01-20 10:04:02,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:04:02,471 INFO L93 Difference]: Finished difference Result 262 states and 265 transitions. [2019-01-20 10:04:02,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-01-20 10:04:02,471 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 172 [2019-01-20 10:04:02,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:04:02,472 INFO L225 Difference]: With dead ends: 262 [2019-01-20 10:04:02,472 INFO L226 Difference]: Without dead ends: 175 [2019-01-20 10:04:02,472 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-01-20 10:04:02,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-01-20 10:04:02,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2019-01-20 10:04:02,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-01-20 10:04:02,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 176 transitions. [2019-01-20 10:04:02,476 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 176 transitions. Word has length 172 [2019-01-20 10:04:02,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:04:02,477 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 176 transitions. [2019-01-20 10:04:02,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-01-20 10:04:02,477 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 176 transitions. [2019-01-20 10:04:02,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-01-20 10:04:02,478 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:04:02,478 INFO L402 BasicCegarLoop]: trace histogram [85, 85, 1, 1, 1, 1] [2019-01-20 10:04:02,478 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:04:02,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:04:02,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1570725003, now seen corresponding path program 85 times [2019-01-20 10:04:02,479 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:04:02,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:04:02,479 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:04:02,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:04:02,480 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:04:02,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:04:05,403 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 3655 trivial. 0 not checked. [2019-01-20 10:04:05,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:04:05,404 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:04:05,404 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:04:05,404 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:04:05,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:04:05,405 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:04:05,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:04:05,417 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:04:05,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:04:05,536 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:04:05,559 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 3655 trivial. 0 not checked. [2019-01-20 10:04:05,560 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:04:13,347 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 3655 trivial. 0 not checked. [2019-01-20 10:04:13,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:04:13,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 173 [2019-01-20 10:04:13,365 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:04:13,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-01-20 10:04:13,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-01-20 10:04:13,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2019-01-20 10:04:13,367 INFO L87 Difference]: Start difference. First operand 175 states and 176 transitions. Second operand 88 states. [2019-01-20 10:04:14,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:04:14,201 INFO L93 Difference]: Finished difference Result 265 states and 268 transitions. [2019-01-20 10:04:14,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-01-20 10:04:14,202 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 174 [2019-01-20 10:04:14,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:04:14,202 INFO L225 Difference]: With dead ends: 265 [2019-01-20 10:04:14,203 INFO L226 Difference]: Without dead ends: 177 [2019-01-20 10:04:14,204 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2019-01-20 10:04:14,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-01-20 10:04:14,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2019-01-20 10:04:14,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-01-20 10:04:14,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 178 transitions. [2019-01-20 10:04:14,207 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 178 transitions. Word has length 174 [2019-01-20 10:04:14,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:04:14,207 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 178 transitions. [2019-01-20 10:04:14,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-01-20 10:04:14,207 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 178 transitions. [2019-01-20 10:04:14,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-01-20 10:04:14,208 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:04:14,208 INFO L402 BasicCegarLoop]: trace histogram [86, 86, 1, 1, 1, 1] [2019-01-20 10:04:14,209 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:04:14,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:04:14,209 INFO L82 PathProgramCache]: Analyzing trace with hash -882751958, now seen corresponding path program 86 times [2019-01-20 10:04:14,209 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:04:14,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:04:14,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:04:14,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:04:14,210 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:04:14,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:04:16,900 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 3741 trivial. 0 not checked. [2019-01-20 10:04:16,901 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:04:16,901 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:04:16,901 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:04:16,901 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:04:16,901 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:04:16,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 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:04:16,909 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:04:16,909 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:04:25,849 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) [2019-01-20 10:04:25,849 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:04:25,879 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:04:25,903 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 3741 trivial. 0 not checked. [2019-01-20 10:04:25,903 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:04:34,300 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 3741 trivial. 0 not checked. [2019-01-20 10:04:34,324 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:04:34,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 175 [2019-01-20 10:04:34,325 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:04:34,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-01-20 10:04:34,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-01-20 10:04:34,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2019-01-20 10:04:34,327 INFO L87 Difference]: Start difference. First operand 177 states and 178 transitions. Second operand 89 states. [2019-01-20 10:04:35,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:04:35,057 INFO L93 Difference]: Finished difference Result 268 states and 271 transitions. [2019-01-20 10:04:35,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-01-20 10:04:35,058 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 176 [2019-01-20 10:04:35,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:04:35,059 INFO L225 Difference]: With dead ends: 268 [2019-01-20 10:04:35,059 INFO L226 Difference]: Without dead ends: 179 [2019-01-20 10:04:35,061 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-01-20 10:04:35,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-01-20 10:04:35,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2019-01-20 10:04:35,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-01-20 10:04:35,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 180 transitions. [2019-01-20 10:04:35,064 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 180 transitions. Word has length 176 [2019-01-20 10:04:35,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:04:35,065 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 180 transitions. [2019-01-20 10:04:35,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-01-20 10:04:35,065 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 180 transitions. [2019-01-20 10:04:35,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-01-20 10:04:35,065 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:04:35,065 INFO L402 BasicCegarLoop]: trace histogram [87, 87, 1, 1, 1, 1] [2019-01-20 10:04:35,066 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:04:35,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:04:35,066 INFO L82 PathProgramCache]: Analyzing trace with hash 281519061, now seen corresponding path program 87 times [2019-01-20 10:04:35,066 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:04:35,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:04:35,067 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:04:35,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:04:35,067 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:04:35,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:04:37,846 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2019-01-20 10:04:37,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:04:37,846 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:04:37,847 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:04:37,847 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:04:37,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:04:37,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 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:04:37,856 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:04:37,856 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:04:37,974 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:04:37,974 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:04:37,979 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:04:38,002 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2019-01-20 10:04:38,002 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:04:46,360 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2019-01-20 10:04:46,379 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:04:46,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 177 [2019-01-20 10:04:46,379 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:04:46,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-01-20 10:04:46,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-01-20 10:04:46,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2019-01-20 10:04:46,381 INFO L87 Difference]: Start difference. First operand 179 states and 180 transitions. Second operand 90 states. [2019-01-20 10:04:47,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:04:47,330 INFO L93 Difference]: Finished difference Result 271 states and 274 transitions. [2019-01-20 10:04:47,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-01-20 10:04:47,330 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 178 [2019-01-20 10:04:47,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:04:47,331 INFO L225 Difference]: With dead ends: 271 [2019-01-20 10:04:47,331 INFO L226 Difference]: Without dead ends: 181 [2019-01-20 10:04:47,332 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 443 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2019-01-20 10:04:47,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-01-20 10:04:47,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2019-01-20 10:04:47,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-01-20 10:04:47,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 182 transitions. [2019-01-20 10:04:47,335 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 182 transitions. Word has length 178 [2019-01-20 10:04:47,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:04:47,335 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 182 transitions. [2019-01-20 10:04:47,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-01-20 10:04:47,335 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 182 transitions. [2019-01-20 10:04:47,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-01-20 10:04:47,336 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:04:47,336 INFO L402 BasicCegarLoop]: trace histogram [88, 88, 1, 1, 1, 1] [2019-01-20 10:04:47,336 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:04:47,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:04:47,336 INFO L82 PathProgramCache]: Analyzing trace with hash 71120202, now seen corresponding path program 88 times [2019-01-20 10:04:47,336 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:04:47,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:04:47,337 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:04:47,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:04:47,337 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:04:47,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:04:50,439 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 3916 trivial. 0 not checked. [2019-01-20 10:04:50,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:04:50,440 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:04:50,440 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:04:50,440 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:04:50,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:04:50,440 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:04:50,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:04:50,449 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:04:50,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:04:50,574 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:04:50,598 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 3916 trivial. 0 not checked. [2019-01-20 10:04:50,598 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:04:58,808 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 3916 trivial. 0 not checked. [2019-01-20 10:04:58,826 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:04:58,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90, 90] total 179 [2019-01-20 10:04:58,826 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:04:58,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-01-20 10:04:58,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-01-20 10:04:58,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2019-01-20 10:04:58,828 INFO L87 Difference]: Start difference. First operand 181 states and 182 transitions. Second operand 91 states. [2019-01-20 10:04:59,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:04:59,592 INFO L93 Difference]: Finished difference Result 274 states and 277 transitions. [2019-01-20 10:04:59,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-01-20 10:04:59,592 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 180 [2019-01-20 10:04:59,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:04:59,593 INFO L225 Difference]: With dead ends: 274 [2019-01-20 10:04:59,593 INFO L226 Difference]: Without dead ends: 183 [2019-01-20 10:04:59,594 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2019-01-20 10:04:59,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-01-20 10:04:59,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2019-01-20 10:04:59,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-01-20 10:04:59,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 184 transitions. [2019-01-20 10:04:59,597 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 184 transitions. Word has length 180 [2019-01-20 10:04:59,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:04:59,597 INFO L480 AbstractCegarLoop]: Abstraction has 183 states and 184 transitions. [2019-01-20 10:04:59,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-01-20 10:04:59,597 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 184 transitions. [2019-01-20 10:04:59,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-01-20 10:04:59,598 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:04:59,598 INFO L402 BasicCegarLoop]: trace histogram [89, 89, 1, 1, 1, 1] [2019-01-20 10:04:59,598 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:04:59,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:04:59,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1128162251, now seen corresponding path program 89 times [2019-01-20 10:04:59,598 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:04:59,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:04:59,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:04:59,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:04:59,599 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:04:59,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:02,611 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 4005 trivial. 0 not checked. [2019-01-20 10:05:02,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:02,612 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:05:02,612 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:05:02,612 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:05:02,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:02,612 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:05:02,637 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:05:02,637 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:05:07,372 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2019-01-20 10:05:07,372 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:05:07,381 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:05:07,403 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 4005 trivial. 0 not checked. [2019-01-20 10:05:07,403 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:05:15,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-01-20 10:05:16,023 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:05:16,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 181 [2019-01-20 10:05:16,023 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:05:16,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-01-20 10:05:16,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-01-20 10:05:16,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2019-01-20 10:05:16,026 INFO L87 Difference]: Start difference. First operand 183 states and 184 transitions. Second operand 92 states. [2019-01-20 10:05:16,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:05:16,777 INFO L93 Difference]: Finished difference Result 277 states and 280 transitions. [2019-01-20 10:05:16,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-01-20 10:05:16,777 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 182 [2019-01-20 10:05:16,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:05:16,778 INFO L225 Difference]: With dead ends: 277 [2019-01-20 10:05:16,778 INFO L226 Difference]: Without dead ends: 185 [2019-01-20 10:05:16,780 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-01-20 10:05:16,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-01-20 10:05:16,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2019-01-20 10:05:16,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-01-20 10:05:16,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 186 transitions. [2019-01-20 10:05:16,783 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 186 transitions. Word has length 182 [2019-01-20 10:05:16,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:05:16,783 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 186 transitions. [2019-01-20 10:05:16,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-01-20 10:05:16,783 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 186 transitions. [2019-01-20 10:05:16,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-01-20 10:05:16,784 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:05:16,784 INFO L402 BasicCegarLoop]: trace histogram [90, 90, 1, 1, 1, 1] [2019-01-20 10:05:16,784 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:05:16,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:16,784 INFO L82 PathProgramCache]: Analyzing trace with hash 524708970, now seen corresponding path program 90 times [2019-01-20 10:05:16,785 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:05:16,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:16,785 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:05:16,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:16,785 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:05:16,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:19,894 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 4095 trivial. 0 not checked. [2019-01-20 10:05:19,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:19,894 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:05:19,894 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:05:19,894 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:05:19,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:19,894 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:05:19,905 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:05:19,905 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:05:20,030 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:05:20,030 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:05:20,034 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:05:20,059 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 4095 trivial. 0 not checked. [2019-01-20 10:05:20,060 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:05:28,618 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 4095 trivial. 0 not checked. [2019-01-20 10:05:28,637 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:05:28,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92, 92] total 183 [2019-01-20 10:05:28,637 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:05:28,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-01-20 10:05:28,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-01-20 10:05:28,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2019-01-20 10:05:28,640 INFO L87 Difference]: Start difference. First operand 185 states and 186 transitions. Second operand 93 states. [2019-01-20 10:05:29,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:05:29,452 INFO L93 Difference]: Finished difference Result 280 states and 283 transitions. [2019-01-20 10:05:29,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-01-20 10:05:29,453 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 184 [2019-01-20 10:05:29,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:05:29,453 INFO L225 Difference]: With dead ends: 280 [2019-01-20 10:05:29,454 INFO L226 Difference]: Without dead ends: 187 [2019-01-20 10:05:29,455 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2019-01-20 10:05:29,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-01-20 10:05:29,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2019-01-20 10:05:29,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-01-20 10:05:29,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 188 transitions. [2019-01-20 10:05:29,459 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 188 transitions. Word has length 184 [2019-01-20 10:05:29,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:05:29,459 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 188 transitions. [2019-01-20 10:05:29,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-01-20 10:05:29,459 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 188 transitions. [2019-01-20 10:05:29,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-01-20 10:05:29,460 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:05:29,460 INFO L402 BasicCegarLoop]: trace histogram [91, 91, 1, 1, 1, 1] [2019-01-20 10:05:29,460 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:05:29,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:29,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1781042325, now seen corresponding path program 91 times [2019-01-20 10:05:29,461 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:05:29,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:29,461 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:05:29,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:29,462 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:05:29,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:32,731 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 4186 trivial. 0 not checked. [2019-01-20 10:05:32,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:32,731 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:05:32,731 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:05:32,731 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:05:32,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:32,731 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:05:32,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:05:32,743 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:05:32,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:32,873 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:05:32,898 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 4186 trivial. 0 not checked. [2019-01-20 10:05:32,898 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:05:42,131 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 4186 trivial. 0 not checked. [2019-01-20 10:05:42,150 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:05:42,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 185 [2019-01-20 10:05:42,150 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:05:42,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-01-20 10:05:42,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-01-20 10:05:42,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2019-01-20 10:05:42,153 INFO L87 Difference]: Start difference. First operand 187 states and 188 transitions. Second operand 94 states. [2019-01-20 10:05:43,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:05:43,229 INFO L93 Difference]: Finished difference Result 283 states and 286 transitions. [2019-01-20 10:05:43,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-01-20 10:05:43,229 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 186 [2019-01-20 10:05:43,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:05:43,230 INFO L225 Difference]: With dead ends: 283 [2019-01-20 10:05:43,230 INFO L226 Difference]: Without dead ends: 189 [2019-01-20 10:05:43,231 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 463 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2019-01-20 10:05:43,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-01-20 10:05:43,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2019-01-20 10:05:43,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-01-20 10:05:43,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 190 transitions. [2019-01-20 10:05:43,235 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 190 transitions. Word has length 186 [2019-01-20 10:05:43,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:05:43,236 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 190 transitions. [2019-01-20 10:05:43,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-01-20 10:05:43,236 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 190 transitions. [2019-01-20 10:05:43,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-01-20 10:05:43,236 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:05:43,237 INFO L402 BasicCegarLoop]: trace histogram [92, 92, 1, 1, 1, 1] [2019-01-20 10:05:43,237 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:05:43,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:43,237 INFO L82 PathProgramCache]: Analyzing trace with hash -658248822, now seen corresponding path program 92 times [2019-01-20 10:05:43,237 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:05:43,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:43,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:05:43,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:43,238 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:05:43,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:46,649 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 4278 trivial. 0 not checked. [2019-01-20 10:05:46,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:46,650 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:05:46,650 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:05:46,650 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:05:46,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:46,650 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:05:46,660 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:05:46,661 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:05:51,676 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 47 check-sat command(s) [2019-01-20 10:05:51,677 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:05:51,686 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:05:51,710 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 4278 trivial. 0 not checked. [2019-01-20 10:05:51,710 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:06:00,830 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 4278 trivial. 0 not checked. [2019-01-20 10:06:00,855 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:06:00,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94, 94] total 187 [2019-01-20 10:06:00,855 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:06:00,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-01-20 10:06:00,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-01-20 10:06:00,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2019-01-20 10:06:00,857 INFO L87 Difference]: Start difference. First operand 189 states and 190 transitions. Second operand 95 states. [2019-01-20 10:06:01,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:06:01,824 INFO L93 Difference]: Finished difference Result 286 states and 289 transitions. [2019-01-20 10:06:01,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-01-20 10:06:01,825 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 188 [2019-01-20 10:06:01,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:06:01,825 INFO L225 Difference]: With dead ends: 286 [2019-01-20 10:06:01,826 INFO L226 Difference]: Without dead ends: 191 [2019-01-20 10:06:01,826 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 468 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2019-01-20 10:06:01,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-01-20 10:06:01,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2019-01-20 10:06:01,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-01-20 10:06:01,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 192 transitions. [2019-01-20 10:06:01,831 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 192 transitions. Word has length 188 [2019-01-20 10:06:01,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:06:01,831 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 192 transitions. [2019-01-20 10:06:01,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-01-20 10:06:01,831 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 192 transitions. [2019-01-20 10:06:01,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-01-20 10:06:01,832 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:06:01,832 INFO L402 BasicCegarLoop]: trace histogram [93, 93, 1, 1, 1, 1] [2019-01-20 10:06:01,832 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:06:01,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:06:01,833 INFO L82 PathProgramCache]: Analyzing trace with hash 844526837, now seen corresponding path program 93 times [2019-01-20 10:06:01,833 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:06:01,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:01,833 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:06:01,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:01,834 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:06:01,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:06:04,933 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 4371 trivial. 0 not checked. [2019-01-20 10:06:04,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:04,934 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:06:04,934 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:06:04,934 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:06:04,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:04,934 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:06:04,942 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:06:04,942 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:06:05,076 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:06:05,076 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:06:05,081 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:06:05,107 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 4371 trivial. 0 not checked. [2019-01-20 10:06:05,107 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:06:14,475 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 4371 trivial. 0 not checked. [2019-01-20 10:06:14,493 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:06:14,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 189 [2019-01-20 10:06:14,494 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:06:14,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-01-20 10:06:14,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-01-20 10:06:14,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2019-01-20 10:06:14,496 INFO L87 Difference]: Start difference. First operand 191 states and 192 transitions. Second operand 96 states. [2019-01-20 10:06:15,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:06:15,634 INFO L93 Difference]: Finished difference Result 289 states and 292 transitions. [2019-01-20 10:06:15,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-01-20 10:06:15,635 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 190 [2019-01-20 10:06:15,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:06:15,636 INFO L225 Difference]: With dead ends: 289 [2019-01-20 10:06:15,636 INFO L226 Difference]: Without dead ends: 193 [2019-01-20 10:06:15,637 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 473 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2019-01-20 10:06:15,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-01-20 10:06:15,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2019-01-20 10:06:15,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-01-20 10:06:15,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 194 transitions. [2019-01-20 10:06:15,640 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 194 transitions. Word has length 190 [2019-01-20 10:06:15,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:06:15,640 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 194 transitions. [2019-01-20 10:06:15,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-01-20 10:06:15,640 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 194 transitions. [2019-01-20 10:06:15,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-01-20 10:06:15,641 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:06:15,641 INFO L402 BasicCegarLoop]: trace histogram [94, 94, 1, 1, 1, 1] [2019-01-20 10:06:15,641 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:06:15,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:06:15,641 INFO L82 PathProgramCache]: Analyzing trace with hash -679759190, now seen corresponding path program 94 times [2019-01-20 10:06:15,641 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:06:15,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:15,642 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:06:15,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:15,642 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:06:15,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:06:19,023 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 4465 trivial. 0 not checked. [2019-01-20 10:06:19,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:19,023 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:06:19,023 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:06:19,024 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:06:19,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:19,024 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:06:19,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:06:19,032 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:06:19,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:06:19,165 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:06:19,192 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 4465 trivial. 0 not checked. [2019-01-20 10:06:19,192 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:06:28,764 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 4465 trivial. 0 not checked. [2019-01-20 10:06:28,782 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:06:28,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 191 [2019-01-20 10:06:28,783 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:06:28,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-01-20 10:06:28,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-01-20 10:06:28,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2019-01-20 10:06:28,785 INFO L87 Difference]: Start difference. First operand 193 states and 194 transitions. Second operand 97 states. [2019-01-20 10:06:29,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:06:29,975 INFO L93 Difference]: Finished difference Result 292 states and 295 transitions. [2019-01-20 10:06:29,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-01-20 10:06:29,976 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 192 [2019-01-20 10:06:29,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:06:29,976 INFO L225 Difference]: With dead ends: 292 [2019-01-20 10:06:29,977 INFO L226 Difference]: Without dead ends: 195 [2019-01-20 10:06:29,977 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 478 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2019-01-20 10:06:29,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-01-20 10:06:29,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2019-01-20 10:06:29,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-01-20 10:06:29,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 196 transitions. [2019-01-20 10:06:29,980 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 196 transitions. Word has length 192 [2019-01-20 10:06:29,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:06:29,980 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 196 transitions. [2019-01-20 10:06:29,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-01-20 10:06:29,980 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 196 transitions. [2019-01-20 10:06:29,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-01-20 10:06:29,981 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:06:29,981 INFO L402 BasicCegarLoop]: trace histogram [95, 95, 1, 1, 1, 1] [2019-01-20 10:06:29,981 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:06:29,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:06:29,981 INFO L82 PathProgramCache]: Analyzing trace with hash 606426453, now seen corresponding path program 95 times [2019-01-20 10:06:29,982 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:06:29,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:29,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:06:29,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:29,982 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:06:30,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:06:33,382 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 4560 trivial. 0 not checked. [2019-01-20 10:06:33,382 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:33,383 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:06:33,383 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:06:33,383 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:06:33,383 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:33,383 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:06:33,391 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:06:33,391 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:06:39,256 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 49 check-sat command(s) [2019-01-20 10:06:39,256 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:06:39,266 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:06:39,292 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 4560 trivial. 0 not checked. [2019-01-20 10:06:39,292 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:06:49,067 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 4560 trivial. 0 not checked. [2019-01-20 10:06:49,093 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:06:49,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 193 [2019-01-20 10:06:49,093 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:06:49,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-01-20 10:06:49,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-01-20 10:06:49,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2019-01-20 10:06:49,096 INFO L87 Difference]: Start difference. First operand 195 states and 196 transitions. Second operand 98 states. [2019-01-20 10:06:50,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:06:50,423 INFO L93 Difference]: Finished difference Result 295 states and 298 transitions. [2019-01-20 10:06:50,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-01-20 10:06:50,424 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 194 [2019-01-20 10:06:50,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:06:50,425 INFO L225 Difference]: With dead ends: 295 [2019-01-20 10:06:50,425 INFO L226 Difference]: Without dead ends: 197 [2019-01-20 10:06:50,426 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 483 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2019-01-20 10:06:50,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-01-20 10:06:50,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2019-01-20 10:06:50,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-01-20 10:06:50,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 198 transitions. [2019-01-20 10:06:50,429 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 198 transitions. Word has length 194 [2019-01-20 10:06:50,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:06:50,430 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 198 transitions. [2019-01-20 10:06:50,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-01-20 10:06:50,430 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 198 transitions. [2019-01-20 10:06:50,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-01-20 10:06:50,431 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:06:50,431 INFO L402 BasicCegarLoop]: trace histogram [96, 96, 1, 1, 1, 1] [2019-01-20 10:06:50,431 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:06:50,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:06:50,431 INFO L82 PathProgramCache]: Analyzing trace with hash 213107146, now seen corresponding path program 96 times [2019-01-20 10:06:50,431 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:06:50,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:50,432 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:06:50,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:50,432 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:06:50,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:06:53,767 INFO L134 CoverageAnalysis]: Checked inductivity of 9312 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 4656 trivial. 0 not checked. [2019-01-20 10:06:53,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:53,767 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:06:53,768 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:06:53,768 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:06:53,768 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:53,768 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:06:53,776 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:06:53,776 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:06:53,911 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:06:53,911 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:06:53,916 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:06:53,942 INFO L134 CoverageAnalysis]: Checked inductivity of 9312 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 4656 trivial. 0 not checked. [2019-01-20 10:06:53,942 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:07:04,020 INFO L134 CoverageAnalysis]: Checked inductivity of 9312 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 4656 trivial. 0 not checked. [2019-01-20 10:07:04,040 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:07:04,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 195 [2019-01-20 10:07:04,040 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:07:04,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-01-20 10:07:04,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-01-20 10:07:04,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2019-01-20 10:07:04,042 INFO L87 Difference]: Start difference. First operand 197 states and 198 transitions. Second operand 99 states. [2019-01-20 10:07:05,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:07:05,345 INFO L93 Difference]: Finished difference Result 298 states and 301 transitions. [2019-01-20 10:07:05,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-01-20 10:07:05,346 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 196 [2019-01-20 10:07:05,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:07:05,346 INFO L225 Difference]: With dead ends: 298 [2019-01-20 10:07:05,347 INFO L226 Difference]: Without dead ends: 199 [2019-01-20 10:07:05,348 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 488 GetRequests, 294 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2019-01-20 10:07:05,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-01-20 10:07:05,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2019-01-20 10:07:05,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-01-20 10:07:05,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 200 transitions. [2019-01-20 10:07:05,351 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 200 transitions. Word has length 196 [2019-01-20 10:07:05,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:07:05,351 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 200 transitions. [2019-01-20 10:07:05,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-01-20 10:07:05,351 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 200 transitions. [2019-01-20 10:07:05,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-01-20 10:07:05,351 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:07:05,352 INFO L402 BasicCegarLoop]: trace histogram [97, 97, 1, 1, 1, 1] [2019-01-20 10:07:05,352 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:07:05,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:07:05,352 INFO L82 PathProgramCache]: Analyzing trace with hash -470864459, now seen corresponding path program 97 times [2019-01-20 10:07:05,352 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:07:05,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:07:05,353 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:07:05,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:07:05,353 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:07:05,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:07:09,098 INFO L134 CoverageAnalysis]: Checked inductivity of 9506 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 4753 trivial. 0 not checked. [2019-01-20 10:07:09,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:07:09,098 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:07:09,098 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:07:09,098 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:07:09,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:07:09,099 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:07:09,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:07:09,107 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:07:09,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:07:09,245 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:07:09,272 INFO L134 CoverageAnalysis]: Checked inductivity of 9506 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 4753 trivial. 0 not checked. [2019-01-20 10:07:09,273 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:07:19,521 INFO L134 CoverageAnalysis]: Checked inductivity of 9506 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 4753 trivial. 0 not checked. [2019-01-20 10:07:19,540 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:07:19,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 197 [2019-01-20 10:07:19,540 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:07:19,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-01-20 10:07:19,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-01-20 10:07:19,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2019-01-20 10:07:19,542 INFO L87 Difference]: Start difference. First operand 199 states and 200 transitions. Second operand 100 states. [2019-01-20 10:07:20,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:07:20,608 INFO L93 Difference]: Finished difference Result 301 states and 304 transitions. [2019-01-20 10:07:20,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-01-20 10:07:20,608 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 198 [2019-01-20 10:07:20,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:07:20,609 INFO L225 Difference]: With dead ends: 301 [2019-01-20 10:07:20,609 INFO L226 Difference]: Without dead ends: 201 [2019-01-20 10:07:20,610 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 493 GetRequests, 297 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2019-01-20 10:07:20,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-01-20 10:07:20,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2019-01-20 10:07:20,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-01-20 10:07:20,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 202 transitions. [2019-01-20 10:07:20,614 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 202 transitions. Word has length 198 [2019-01-20 10:07:20,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:07:20,614 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 202 transitions. [2019-01-20 10:07:20,614 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-01-20 10:07:20,614 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 202 transitions. [2019-01-20 10:07:20,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-01-20 10:07:20,615 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:07:20,615 INFO L402 BasicCegarLoop]: trace histogram [98, 98, 1, 1, 1, 1] [2019-01-20 10:07:20,615 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:07:20,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:07:20,615 INFO L82 PathProgramCache]: Analyzing trace with hash 338827498, now seen corresponding path program 98 times [2019-01-20 10:07:20,616 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:07:20,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:07:20,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:07:20,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:07:20,616 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:07:20,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:07:24,371 INFO L134 CoverageAnalysis]: Checked inductivity of 9702 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 4851 trivial. 0 not checked. [2019-01-20 10:07:24,371 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:07:24,371 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:07:24,371 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:07:24,372 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:07:24,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:07:24,372 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:07:24,380 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:07:24,380 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:07:39,004 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 50 check-sat command(s) [2019-01-20 10:07:39,005 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:07:39,045 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:07:39,071 INFO L134 CoverageAnalysis]: Checked inductivity of 9702 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 4851 trivial. 0 not checked. [2019-01-20 10:07:39,071 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:07:49,537 INFO L134 CoverageAnalysis]: Checked inductivity of 9702 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 4851 trivial. 0 not checked. [2019-01-20 10:07:49,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:07:49,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100, 100] total 199 [2019-01-20 10:07:49,566 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:07:49,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-01-20 10:07:49,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-01-20 10:07:49,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2019-01-20 10:07:49,568 INFO L87 Difference]: Start difference. First operand 201 states and 202 transitions. Second operand 101 states. [2019-01-20 10:07:50,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:07:50,977 INFO L93 Difference]: Finished difference Result 304 states and 307 transitions. [2019-01-20 10:07:50,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-01-20 10:07:50,977 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 200 [2019-01-20 10:07:50,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:07:50,978 INFO L225 Difference]: With dead ends: 304 [2019-01-20 10:07:50,978 INFO L226 Difference]: Without dead ends: 203 [2019-01-20 10:07:50,979 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 498 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2019-01-20 10:07:50,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-01-20 10:07:50,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2019-01-20 10:07:50,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-01-20 10:07:50,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 204 transitions. [2019-01-20 10:07:50,982 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 204 transitions. Word has length 200 [2019-01-20 10:07:50,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:07:50,983 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 204 transitions. [2019-01-20 10:07:50,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-01-20 10:07:50,983 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 204 transitions. [2019-01-20 10:07:50,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-01-20 10:07:50,983 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:07:50,983 INFO L402 BasicCegarLoop]: trace histogram [99, 99, 1, 1, 1, 1] [2019-01-20 10:07:50,984 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:07:50,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:07:50,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1267596821, now seen corresponding path program 99 times [2019-01-20 10:07:50,984 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:07:50,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:07:50,984 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:07:50,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:07:50,984 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:07:51,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:07:54,713 INFO L134 CoverageAnalysis]: Checked inductivity of 9900 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 4950 trivial. 0 not checked. [2019-01-20 10:07:54,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:07:54,714 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:07:54,714 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:07:54,714 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:07:54,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:07:54,714 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:07:54,723 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:07:54,723 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:07:54,863 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:07:54,864 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:07:54,868 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:07:54,896 INFO L134 CoverageAnalysis]: Checked inductivity of 9900 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 4950 trivial. 0 not checked. [2019-01-20 10:07:54,897 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:08:05,367 INFO L134 CoverageAnalysis]: Checked inductivity of 9900 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 4950 trivial. 0 not checked. [2019-01-20 10:08:05,387 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:08:05,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101, 101] total 201 [2019-01-20 10:08:05,387 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:08:05,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-01-20 10:08:05,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-01-20 10:08:05,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2019-01-20 10:08:05,389 INFO L87 Difference]: Start difference. First operand 203 states and 204 transitions. Second operand 102 states. [2019-01-20 10:08:06,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:08:06,841 INFO L93 Difference]: Finished difference Result 307 states and 310 transitions. [2019-01-20 10:08:06,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-01-20 10:08:06,841 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 202 [2019-01-20 10:08:06,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:08:06,842 INFO L225 Difference]: With dead ends: 307 [2019-01-20 10:08:06,842 INFO L226 Difference]: Without dead ends: 205 [2019-01-20 10:08:06,843 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 503 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2019-01-20 10:08:06,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-01-20 10:08:06,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2019-01-20 10:08:06,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-01-20 10:08:06,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 206 transitions. [2019-01-20 10:08:06,846 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 206 transitions. Word has length 202 [2019-01-20 10:08:06,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:08:06,846 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 206 transitions. [2019-01-20 10:08:06,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-01-20 10:08:06,846 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 206 transitions. [2019-01-20 10:08:06,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-01-20 10:08:06,847 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:08:06,847 INFO L402 BasicCegarLoop]: trace histogram [100, 100, 1, 1, 1, 1] [2019-01-20 10:08:06,847 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:08:06,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:08:06,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1807960054, now seen corresponding path program 100 times [2019-01-20 10:08:06,847 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:08:06,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:08:06,848 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:08:06,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:08:06,848 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:08:06,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:08:10,680 INFO L134 CoverageAnalysis]: Checked inductivity of 10100 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 5050 trivial. 0 not checked. [2019-01-20 10:08:10,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:08:10,680 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:08:10,680 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:08:10,680 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:08:10,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:08:10,681 INFO 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-01-20 10:08:10,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:08:10,689 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:08:10,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:08:10,832 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:08:10,859 INFO L134 CoverageAnalysis]: Checked inductivity of 10100 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 5050 trivial. 0 not checked. [2019-01-20 10:08:10,860 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:08:21,614 INFO L134 CoverageAnalysis]: Checked inductivity of 10100 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 5050 trivial. 0 not checked. [2019-01-20 10:08:21,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:08:21,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 102, 102] total 203 [2019-01-20 10:08:21,635 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:08:21,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-01-20 10:08:21,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-01-20 10:08:21,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2019-01-20 10:08:21,638 INFO L87 Difference]: Start difference. First operand 205 states and 206 transitions. Second operand 103 states. [2019-01-20 10:08:23,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:08:23,022 INFO L93 Difference]: Finished difference Result 310 states and 313 transitions. [2019-01-20 10:08:23,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-01-20 10:08:23,022 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 204 [2019-01-20 10:08:23,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:08:23,023 INFO L225 Difference]: With dead ends: 310 [2019-01-20 10:08:23,023 INFO L226 Difference]: Without dead ends: 207 [2019-01-20 10:08:23,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 508 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2019-01-20 10:08:23,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-01-20 10:08:23,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2019-01-20 10:08:23,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2019-01-20 10:08:23,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 208 transitions. [2019-01-20 10:08:23,029 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 208 transitions. Word has length 204 [2019-01-20 10:08:23,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:08:23,029 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 208 transitions. [2019-01-20 10:08:23,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-01-20 10:08:23,029 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 208 transitions. [2019-01-20 10:08:23,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-01-20 10:08:23,030 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:08:23,030 INFO L402 BasicCegarLoop]: trace histogram [101, 101, 1, 1, 1, 1] [2019-01-20 10:08:23,030 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:08:23,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:08:23,031 INFO L82 PathProgramCache]: Analyzing trace with hash 173786741, now seen corresponding path program 101 times [2019-01-20 10:08:23,031 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:08:23,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:08:23,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:08:23,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:08:23,032 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:08:23,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:08:26,956 INFO L134 CoverageAnalysis]: Checked inductivity of 10302 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 5151 trivial. 0 not checked. [2019-01-20 10:08:26,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:08:26,957 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:08:26,957 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:08:26,957 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:08:26,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:08:26,957 INFO 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-01-20 10:08:26,965 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:08:26,965 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:08:45,463 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2019-01-20 10:08:45,463 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:08:45,516 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:08:45,544 INFO L134 CoverageAnalysis]: Checked inductivity of 10302 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 5151 trivial. 0 not checked. [2019-01-20 10:08:45,544 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:08:56,691 INFO L134 CoverageAnalysis]: Checked inductivity of 10302 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 5151 trivial. 0 not checked. [2019-01-20 10:08:56,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:08:56,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 103, 103] total 205 [2019-01-20 10:08:56,738 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:08:56,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-01-20 10:08:56,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-01-20 10:08:56,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2019-01-20 10:08:56,741 INFO L87 Difference]: Start difference. First operand 207 states and 208 transitions. Second operand 104 states. [2019-01-20 10:08:58,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:08:58,303 INFO L93 Difference]: Finished difference Result 313 states and 316 transitions. [2019-01-20 10:08:58,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-01-20 10:08:58,303 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 206 [2019-01-20 10:08:58,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:08:58,305 INFO L225 Difference]: With dead ends: 313 [2019-01-20 10:08:58,305 INFO L226 Difference]: Without dead ends: 209 [2019-01-20 10:08:58,306 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 513 GetRequests, 309 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2019-01-20 10:08:58,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-01-20 10:08:58,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2019-01-20 10:08:58,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-01-20 10:08:58,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 210 transitions. [2019-01-20 10:08:58,310 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 210 transitions. Word has length 206 [2019-01-20 10:08:58,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:08:58,310 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 210 transitions. [2019-01-20 10:08:58,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-01-20 10:08:58,311 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 210 transitions. [2019-01-20 10:08:58,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-01-20 10:08:58,311 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:08:58,312 INFO L402 BasicCegarLoop]: trace histogram [102, 102, 1, 1, 1, 1] [2019-01-20 10:08:58,312 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:08:58,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:08:58,312 INFO L82 PathProgramCache]: Analyzing trace with hash -1650876630, now seen corresponding path program 102 times [2019-01-20 10:08:58,312 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:08:58,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:08:58,313 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:08:58,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:08:58,313 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:08:58,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:02,322 INFO L134 CoverageAnalysis]: Checked inductivity of 10506 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 5253 trivial. 0 not checked. [2019-01-20 10:09:02,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:02,322 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:09:02,322 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:09:02,322 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:09:02,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:02,323 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-20 10:09:02,330 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:09:02,330 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:09:02,473 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:09:02,474 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:09:02,478 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:09:02,508 INFO L134 CoverageAnalysis]: Checked inductivity of 10506 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 5253 trivial. 0 not checked. [2019-01-20 10:09:02,509 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:09:13,757 INFO L134 CoverageAnalysis]: Checked inductivity of 10506 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 5253 trivial. 0 not checked. [2019-01-20 10:09:13,776 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:09:13,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104, 104, 104] total 207 [2019-01-20 10:09:13,776 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:09:13,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-01-20 10:09:13,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-01-20 10:09:13,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2019-01-20 10:09:13,780 INFO L87 Difference]: Start difference. First operand 209 states and 210 transitions. Second operand 105 states. [2019-01-20 10:09:15,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:09:15,132 INFO L93 Difference]: Finished difference Result 316 states and 319 transitions. [2019-01-20 10:09:15,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-01-20 10:09:15,132 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 208 [2019-01-20 10:09:15,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:09:15,133 INFO L225 Difference]: With dead ends: 316 [2019-01-20 10:09:15,133 INFO L226 Difference]: Without dead ends: 211 [2019-01-20 10:09:15,135 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 518 GetRequests, 312 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.0s TimeCoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2019-01-20 10:09:15,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-01-20 10:09:15,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2019-01-20 10:09:15,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-01-20 10:09:15,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 212 transitions. [2019-01-20 10:09:15,140 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 212 transitions. Word has length 208 [2019-01-20 10:09:15,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:09:15,140 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 212 transitions. [2019-01-20 10:09:15,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-01-20 10:09:15,140 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 212 transitions. [2019-01-20 10:09:15,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-01-20 10:09:15,141 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:09:15,141 INFO L402 BasicCegarLoop]: trace histogram [103, 103, 1, 1, 1, 1] [2019-01-20 10:09:15,141 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:09:15,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:09:15,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1160939221, now seen corresponding path program 103 times [2019-01-20 10:09:15,142 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:09:15,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:15,143 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:09:15,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:15,143 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:09:15,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:19,204 INFO L134 CoverageAnalysis]: Checked inductivity of 10712 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 5356 trivial. 0 not checked. [2019-01-20 10:09:19,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:19,205 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:09:19,205 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:09:19,205 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:09:19,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:19,205 INFO 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-01-20 10:09:19,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:09:19,217 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:09:19,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:19,361 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:09:19,400 INFO L134 CoverageAnalysis]: Checked inductivity of 10712 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 5356 trivial. 0 not checked. [2019-01-20 10:09:19,400 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:09:31,029 INFO L134 CoverageAnalysis]: Checked inductivity of 10712 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 5356 trivial. 0 not checked. [2019-01-20 10:09:31,048 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:09:31,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105, 105, 105] total 209 [2019-01-20 10:09:31,048 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:09:31,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-01-20 10:09:31,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-01-20 10:09:31,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2019-01-20 10:09:31,051 INFO L87 Difference]: Start difference. First operand 211 states and 212 transitions. Second operand 106 states. [2019-01-20 10:09:32,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:09:32,597 INFO L93 Difference]: Finished difference Result 319 states and 322 transitions. [2019-01-20 10:09:32,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-01-20 10:09:32,606 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 210 [2019-01-20 10:09:32,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:09:32,607 INFO L225 Difference]: With dead ends: 319 [2019-01-20 10:09:32,607 INFO L226 Difference]: Without dead ends: 213 [2019-01-20 10:09:32,609 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 523 GetRequests, 315 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2019-01-20 10:09:32,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-01-20 10:09:32,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2019-01-20 10:09:32,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-01-20 10:09:32,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 214 transitions. [2019-01-20 10:09:32,614 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 214 transitions. Word has length 210 [2019-01-20 10:09:32,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:09:32,614 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 214 transitions. [2019-01-20 10:09:32,614 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-01-20 10:09:32,614 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 214 transitions. [2019-01-20 10:09:32,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-01-20 10:09:32,615 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:09:32,615 INFO L402 BasicCegarLoop]: trace histogram [104, 104, 1, 1, 1, 1] [2019-01-20 10:09:32,616 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:09:32,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:09:32,616 INFO L82 PathProgramCache]: Analyzing trace with hash 193908298, now seen corresponding path program 104 times [2019-01-20 10:09:32,616 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:09:32,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:32,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:09:32,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:32,617 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:09:32,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:36,874 INFO L134 CoverageAnalysis]: Checked inductivity of 10920 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 5460 trivial. 0 not checked. [2019-01-20 10:09:36,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:36,875 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:09:36,875 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:09:36,875 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:09:36,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:36,875 INFO 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-01-20 10:09:36,883 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:09:36,883 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:09:45,245 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 53 check-sat command(s) [2019-01-20 10:09:45,245 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:09:45,256 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:09:45,288 INFO L134 CoverageAnalysis]: Checked inductivity of 10920 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 5460 trivial. 0 not checked. [2019-01-20 10:09:45,288 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:09:57,284 INFO L134 CoverageAnalysis]: Checked inductivity of 10920 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 5460 trivial. 0 not checked. [2019-01-20 10:09:57,313 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:09:57,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106, 106, 106] total 211 [2019-01-20 10:09:57,313 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:09:57,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-01-20 10:09:57,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-01-20 10:09:57,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2019-01-20 10:09:57,317 INFO L87 Difference]: Start difference. First operand 213 states and 214 transitions. Second operand 107 states. [2019-01-20 10:09:58,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:09:58,602 INFO L93 Difference]: Finished difference Result 322 states and 325 transitions. [2019-01-20 10:09:58,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-01-20 10:09:58,602 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 212 [2019-01-20 10:09:58,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:09:58,603 INFO L225 Difference]: With dead ends: 322 [2019-01-20 10:09:58,603 INFO L226 Difference]: Without dead ends: 215 [2019-01-20 10:09:58,605 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 528 GetRequests, 318 SyntacticMatches, 0 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.0s TimeCoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2019-01-20 10:09:58,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-01-20 10:09:58,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2019-01-20 10:09:58,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2019-01-20 10:09:58,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 216 transitions. [2019-01-20 10:09:58,608 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 216 transitions. Word has length 212 [2019-01-20 10:09:58,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:09:58,608 INFO L480 AbstractCegarLoop]: Abstraction has 215 states and 216 transitions. [2019-01-20 10:09:58,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-01-20 10:09:58,608 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 216 transitions. [2019-01-20 10:09:58,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-01-20 10:09:58,609 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:09:58,609 INFO L402 BasicCegarLoop]: trace histogram [105, 105, 1, 1, 1, 1] [2019-01-20 10:09:58,609 INFO L423 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:09:58,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:09:58,609 INFO L82 PathProgramCache]: Analyzing trace with hash 913063733, now seen corresponding path program 105 times [2019-01-20 10:09:58,609 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:09:58,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:58,610 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:09:58,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:58,610 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:09:58,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:02,876 INFO L134 CoverageAnalysis]: Checked inductivity of 11130 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 5565 trivial. 0 not checked. [2019-01-20 10:10:02,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:02,876 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:10:02,876 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:10:02,876 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:10:02,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:02,877 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:10:02,885 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:10:02,886 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:10:03,038 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:10:03,038 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:10:03,043 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:10:03,075 INFO L134 CoverageAnalysis]: Checked inductivity of 11130 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 5565 trivial. 0 not checked. [2019-01-20 10:10:03,075 INFO L316 TraceCheckSpWp]: Computing backward predicates...