java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/array2.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1de736e-m [2019-02-18 09:52:39,555 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-18 09:52:39,557 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-18 09:52:39,574 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-18 09:52:39,575 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-18 09:52:39,576 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-18 09:52:39,577 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-18 09:52:39,579 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-18 09:52:39,581 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-18 09:52:39,582 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-18 09:52:39,583 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-18 09:52:39,584 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-18 09:52:39,585 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-18 09:52:39,586 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-18 09:52:39,587 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-18 09:52:39,588 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-18 09:52:39,588 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-18 09:52:39,590 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-18 09:52:39,592 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-18 09:52:39,594 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-18 09:52:39,595 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-18 09:52:39,596 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-18 09:52:39,598 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-18 09:52:39,599 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-18 09:52:39,599 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-18 09:52:39,600 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-18 09:52:39,601 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-18 09:52:39,602 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-18 09:52:39,602 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-18 09:52:39,604 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-18 09:52:39,604 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-18 09:52:39,605 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-18 09:52:39,605 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-18 09:52:39,605 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-18 09:52:39,606 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-18 09:52:39,607 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-18 09:52:39,607 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2019-02-18 09:52:39,623 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-18 09:52:39,625 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-18 09:52:39,625 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-18 09:52:39,626 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-18 09:52:39,626 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-18 09:52:39,626 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-18 09:52:39,626 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-18 09:52:39,627 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-18 09:52:39,627 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-18 09:52:39,627 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-02-18 09:52:39,627 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-02-18 09:52:39,627 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-18 09:52:39,628 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-18 09:52:39,628 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-18 09:52:39,628 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-18 09:52:39,629 INFO L133 SettingsManager]: * Use SBE=true [2019-02-18 09:52:39,630 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-18 09:52:39,630 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-18 09:52:39,630 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-18 09:52:39,630 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-18 09:52:39,631 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-18 09:52:39,632 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-18 09:52:39,632 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-18 09:52:39,632 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-18 09:52:39,632 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-18 09:52:39,633 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-18 09:52:39,633 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-18 09:52:39,633 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-18 09:52:39,633 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-18 09:52:39,634 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-18 09:52:39,634 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-02-18 09:52:39,634 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-18 09:52:39,634 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-18 09:52:39,634 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-18 09:52:39,635 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-18 09:52:39,635 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-18 09:52:39,635 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in [2019-02-18 09:52:39,635 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-18 09:52:39,635 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-18 09:52:39,681 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-18 09:52:39,694 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-18 09:52:39,697 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-18 09:52:39,699 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-18 09:52:39,700 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-18 09:52:39,700 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array2.i_3.bpl [2019-02-18 09:52:39,701 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array2.i_3.bpl' [2019-02-18 09:52:39,736 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-18 09:52:39,738 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-18 09:52:39,738 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-18 09:52:39,739 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-18 09:52:39,739 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-18 09:52:39,755 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:52:39" (1/1) ... [2019-02-18 09:52:39,767 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:52:39" (1/1) ... [2019-02-18 09:52:39,775 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-18 09:52:39,776 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-18 09:52:39,776 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-18 09:52:39,776 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-18 09:52:39,788 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:52:39" (1/1) ... [2019-02-18 09:52:39,788 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:52:39" (1/1) ... [2019-02-18 09:52:39,789 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:52:39" (1/1) ... [2019-02-18 09:52:39,789 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:52:39" (1/1) ... [2019-02-18 09:52:39,793 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:52:39" (1/1) ... [2019-02-18 09:52:39,795 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:52:39" (1/1) ... [2019-02-18 09:52:39,796 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:52:39" (1/1) ... [2019-02-18 09:52:39,797 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-18 09:52:39,798 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-18 09:52:39,798 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-18 09:52:39,798 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-18 09:52:39,799 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:52:39" (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:8092 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-02-18 09:52:39,864 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-18 09:52:39,865 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-18 09:52:40,115 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-18 09:52:40,116 INFO L286 CfgBuilder]: Removed 1 assue(true) statements. [2019-02-18 09:52:40,117 INFO L202 PluginConnector]: Adding new model array2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 09:52:40 BoogieIcfgContainer [2019-02-18 09:52:40,118 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-18 09:52:40,119 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-18 09:52:40,119 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-18 09:52:40,122 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-18 09:52:40,123 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:52:39" (1/2) ... [2019-02-18 09:52:40,124 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a9153d6 and model type array2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 09:52:40, skipping insertion in model container [2019-02-18 09:52:40,124 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 09:52:40" (2/2) ... [2019-02-18 09:52:40,126 INFO L112 eAbstractionObserver]: Analyzing ICFG array2.i_3.bpl [2019-02-18 09:52:40,136 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-18 09:52:40,144 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-02-18 09:52:40,162 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-02-18 09:52:40,196 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-18 09:52:40,196 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-18 09:52:40,196 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-18 09:52:40,196 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-18 09:52:40,197 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-18 09:52:40,197 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-18 09:52:40,197 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-18 09:52:40,197 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-18 09:52:40,212 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-02-18 09:52:40,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-18 09:52:40,219 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:52:40,220 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-18 09:52:40,222 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:52:40,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:52:40,229 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2019-02-18 09:52:40,231 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:52:40,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:40,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:52:40,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:40,288 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:52:40,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:52:40,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-02-18 09:52:40,386 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-18 09:52:40,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-18 09:52:40,386 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 09:52:40,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-18 09:52:40,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-18 09:52:40,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-18 09:52:40,404 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2019-02-18 09:52:40,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:52:40,455 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2019-02-18 09:52:40,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-18 09:52:40,457 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-02-18 09:52:40,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:52:40,469 INFO L225 Difference]: With dead ends: 9 [2019-02-18 09:52:40,469 INFO L226 Difference]: Without dead ends: 5 [2019-02-18 09:52:40,473 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-18 09:52:40,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-02-18 09:52:40,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-02-18 09:52:40,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-02-18 09:52:40,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-02-18 09:52:40,510 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-02-18 09:52:40,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:52:40,510 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-02-18 09:52:40,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-18 09:52:40,511 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-02-18 09:52:40,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-18 09:52:40,511 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:52:40,511 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-18 09:52:40,512 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:52:40,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:52:40,512 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2019-02-18 09:52:40,512 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:52:40,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:40,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:52:40,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:40,514 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:52:40,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:52:40,701 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:52:40,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:40,702 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:52:40,703 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-18 09:52:40,705 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [9] [2019-02-18 09:52:40,781 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 09:52:40,781 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:52:42,178 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:52:42,182 INFO L272 AbstractInterpreter]: Visited 4 different actions 18 times. Merged at 1 different actions 7 times. Widened at 1 different actions 3 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-18 09:52:42,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:52:42,191 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:52:42,191 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:42,191 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:52:42,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:52:42,208 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:52:42,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:52:42,236 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:52:42,254 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:52:42,254 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:52:42,422 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:52:42,445 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:52:42,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2019-02-18 09:52:42,445 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:52:42,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-18 09:52:42,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-18 09:52:42,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-02-18 09:52:42,448 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-02-18 09:52:42,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:52:42,489 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-02-18 09:52:42,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-18 09:52:42,489 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-02-18 09:52:42,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:52:42,490 INFO L225 Difference]: With dead ends: 8 [2019-02-18 09:52:42,490 INFO L226 Difference]: Without dead ends: 6 [2019-02-18 09:52:42,491 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-02-18 09:52:42,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-02-18 09:52:42,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-02-18 09:52:42,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-02-18 09:52:42,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-02-18 09:52:42,494 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-02-18 09:52:42,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:52:42,494 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-02-18 09:52:42,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-18 09:52:42,494 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-02-18 09:52:42,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-18 09:52:42,495 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:52:42,495 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-02-18 09:52:42,496 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:52:42,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:52:42,496 INFO L82 PathProgramCache]: Analyzing trace with hash 28844579, now seen corresponding path program 2 times [2019-02-18 09:52:42,496 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:52:42,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:42,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:52:42,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:42,498 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:52:42,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:52:42,644 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:52:42,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:42,645 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:52:42,645 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:52:42,645 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:52:42,645 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:42,645 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:52:42,660 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:52:42,661 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:52:42,678 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-02-18 09:52:42,678 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:52:42,680 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:52:42,683 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:52:42,683 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:52:42,808 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:52:42,827 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:52:42,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2019-02-18 09:52:42,828 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:52:42,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-02-18 09:52:42,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-02-18 09:52:42,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-02-18 09:52:42,829 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-02-18 09:52:42,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:52:42,900 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-02-18 09:52:42,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-18 09:52:42,901 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-02-18 09:52:42,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:52:42,901 INFO L225 Difference]: With dead ends: 9 [2019-02-18 09:52:42,902 INFO L226 Difference]: Without dead ends: 7 [2019-02-18 09:52:42,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-02-18 09:52:42,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-02-18 09:52:42,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-02-18 09:52:42,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-02-18 09:52:42,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-02-18 09:52:42,904 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-02-18 09:52:42,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:52:42,905 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-02-18 09:52:42,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-02-18 09:52:42,905 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-02-18 09:52:42,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 09:52:42,905 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:52:42,906 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-02-18 09:52:42,906 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:52:42,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:52:42,906 INFO L82 PathProgramCache]: Analyzing trace with hash 894183756, now seen corresponding path program 3 times [2019-02-18 09:52:42,907 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:52:42,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:42,908 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:52:42,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:42,908 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:52:42,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:52:43,068 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:52:43,069 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:43,069 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:52:43,069 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:52:43,070 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:52:43,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:43,070 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:52:43,091 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:52:43,091 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:52:43,129 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:52:43,129 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:52:43,131 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:52:43,137 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:52:43,138 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:52:43,298 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:52:43,319 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:52:43,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2019-02-18 09:52:43,319 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:52:43,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-18 09:52:43,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-18 09:52:43,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-02-18 09:52:43,321 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-02-18 09:52:43,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:52:43,342 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-02-18 09:52:43,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-18 09:52:43,343 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-02-18 09:52:43,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:52:43,344 INFO L225 Difference]: With dead ends: 10 [2019-02-18 09:52:43,344 INFO L226 Difference]: Without dead ends: 8 [2019-02-18 09:52:43,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-02-18 09:52:43,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-02-18 09:52:43,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-02-18 09:52:43,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-02-18 09:52:43,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-02-18 09:52:43,348 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-02-18 09:52:43,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:52:43,349 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-02-18 09:52:43,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-18 09:52:43,349 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-02-18 09:52:43,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-18 09:52:43,349 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:52:43,349 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-02-18 09:52:43,350 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:52:43,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:52:43,350 INFO L82 PathProgramCache]: Analyzing trace with hash 1949894467, now seen corresponding path program 4 times [2019-02-18 09:52:43,350 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:52:43,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:43,351 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:52:43,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:43,351 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:52:43,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:52:43,531 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:52:43,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:43,531 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:52:43,532 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:52:43,532 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:52:43,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:43,533 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:52:43,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:52:43,542 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:52:43,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:52:43,550 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:52:43,554 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:52:43,554 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:52:43,643 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:52:43,663 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:52:43,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2019-02-18 09:52:43,664 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:52:43,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-02-18 09:52:43,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-02-18 09:52:43,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-02-18 09:52:43,665 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-02-18 09:52:43,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:52:43,696 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-02-18 09:52:43,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-18 09:52:43,697 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-02-18 09:52:43,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:52:43,697 INFO L225 Difference]: With dead ends: 11 [2019-02-18 09:52:43,697 INFO L226 Difference]: Without dead ends: 9 [2019-02-18 09:52:43,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 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-02-18 09:52:43,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-02-18 09:52:43,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-02-18 09:52:43,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-02-18 09:52:43,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-02-18 09:52:43,701 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-02-18 09:52:43,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:52:43,701 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-02-18 09:52:43,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-02-18 09:52:43,701 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-02-18 09:52:43,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-18 09:52:43,702 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:52:43,702 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-02-18 09:52:43,702 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:52:43,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:52:43,703 INFO L82 PathProgramCache]: Analyzing trace with hash 317188140, now seen corresponding path program 5 times [2019-02-18 09:52:43,703 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:52:43,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:43,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:52:43,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:43,705 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:52:43,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:52:43,808 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:52:43,808 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:43,808 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:52:43,808 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:52:43,808 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:52:43,808 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:43,809 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:52:43,817 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:52:43,817 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:52:43,877 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-02-18 09:52:43,877 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:52:43,879 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:52:43,883 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:52:43,883 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:52:44,372 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:52:44,391 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:52:44,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2019-02-18 09:52:44,392 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:52:44,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:52:44,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:52:44,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-02-18 09:52:44,393 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2019-02-18 09:52:44,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:52:44,436 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-02-18 09:52:44,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-18 09:52:44,437 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-02-18 09:52:44,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:52:44,438 INFO L225 Difference]: With dead ends: 12 [2019-02-18 09:52:44,438 INFO L226 Difference]: Without dead ends: 10 [2019-02-18 09:52:44,439 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-02-18 09:52:44,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-02-18 09:52:44,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-02-18 09:52:44,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-02-18 09:52:44,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-02-18 09:52:44,442 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-02-18 09:52:44,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:52:44,442 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-02-18 09:52:44,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:52:44,442 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-02-18 09:52:44,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-18 09:52:44,443 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:52:44,443 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-02-18 09:52:44,443 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:52:44,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:52:44,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1242899555, now seen corresponding path program 6 times [2019-02-18 09:52:44,444 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:52:44,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:44,445 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:52:44,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:44,445 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:52:44,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:52:44,536 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:52:44,536 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:44,537 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:52:44,537 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:52:44,537 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:52:44,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:44,538 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:52:44,548 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:52:44,549 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:52:44,567 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:52:44,567 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:52:44,569 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:52:44,574 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:52:44,574 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:52:44,735 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:52:44,755 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:52:44,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2019-02-18 09:52:44,756 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:52:44,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-18 09:52:44,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-18 09:52:44,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-02-18 09:52:44,757 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2019-02-18 09:52:44,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:52:44,792 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-02-18 09:52:44,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-18 09:52:44,794 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-02-18 09:52:44,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:52:44,794 INFO L225 Difference]: With dead ends: 13 [2019-02-18 09:52:44,794 INFO L226 Difference]: Without dead ends: 11 [2019-02-18 09:52:44,795 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-02-18 09:52:44,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-02-18 09:52:44,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-02-18 09:52:44,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-02-18 09:52:44,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-02-18 09:52:44,798 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-02-18 09:52:44,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:52:44,798 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-02-18 09:52:44,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-18 09:52:44,799 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-02-18 09:52:44,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-02-18 09:52:44,799 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:52:44,799 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-02-18 09:52:44,800 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:52:44,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:52:44,800 INFO L82 PathProgramCache]: Analyzing trace with hash -124817652, now seen corresponding path program 7 times [2019-02-18 09:52:44,800 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:52:44,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:44,801 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:52:44,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:44,802 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:52:44,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:52:45,060 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:52:45,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:45,060 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:52:45,061 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:52:45,061 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:52:45,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:45,061 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:52:45,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:52:45,072 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:52:45,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:52:45,090 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:52:45,094 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:52:45,094 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:52:45,553 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:52:45,572 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:52:45,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2019-02-18 09:52:45,572 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:52:45,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 09:52:45,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 09:52:45,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-02-18 09:52:45,573 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2019-02-18 09:52:45,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:52:45,603 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-02-18 09:52:45,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-18 09:52:45,604 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-02-18 09:52:45,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:52:45,605 INFO L225 Difference]: With dead ends: 14 [2019-02-18 09:52:45,605 INFO L226 Difference]: Without dead ends: 12 [2019-02-18 09:52:45,605 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-02-18 09:52:45,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-02-18 09:52:45,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-02-18 09:52:45,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-02-18 09:52:45,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-02-18 09:52:45,608 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-02-18 09:52:45,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:52:45,608 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-02-18 09:52:45,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 09:52:45,608 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-02-18 09:52:45,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-02-18 09:52:45,609 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:52:45,609 INFO L402 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-02-18 09:52:45,609 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:52:45,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:52:45,609 INFO L82 PathProgramCache]: Analyzing trace with hash 425621891, now seen corresponding path program 8 times [2019-02-18 09:52:45,609 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:52:45,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:45,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:52:45,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:45,610 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:52:45,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:52:45,732 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:52:45,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:45,733 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:52:45,733 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:52:45,733 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:52:45,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:45,733 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:52:45,742 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:52:45,743 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:52:45,801 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-02-18 09:52:45,801 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:52:45,802 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:52:45,807 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:52:45,808 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:52:45,994 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:52:46,013 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:52:46,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2019-02-18 09:52:46,013 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:52:46,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-18 09:52:46,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-18 09:52:46,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-02-18 09:52:46,015 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2019-02-18 09:52:46,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:52:46,040 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-02-18 09:52:46,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-18 09:52:46,041 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-02-18 09:52:46,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:52:46,041 INFO L225 Difference]: With dead ends: 15 [2019-02-18 09:52:46,041 INFO L226 Difference]: Without dead ends: 13 [2019-02-18 09:52:46,042 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-02-18 09:52:46,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-02-18 09:52:46,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-02-18 09:52:46,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-02-18 09:52:46,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-02-18 09:52:46,044 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-02-18 09:52:46,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:52:46,044 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-02-18 09:52:46,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-18 09:52:46,044 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-02-18 09:52:46,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-02-18 09:52:46,045 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:52:46,045 INFO L402 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2019-02-18 09:52:46,046 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:52:46,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:52:46,046 INFO L82 PathProgramCache]: Analyzing trace with hash 309378540, now seen corresponding path program 9 times [2019-02-18 09:52:46,046 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:52:46,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:46,047 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:52:46,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:46,047 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:52:46,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:52:46,158 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:52:46,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:46,158 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:52:46,158 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:52:46,159 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:52:46,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:46,159 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:52:46,168 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:52:46,168 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:52:46,189 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:52:46,189 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:52:46,191 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:52:46,196 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:52:46,196 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:52:46,362 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:52:46,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:52:46,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2019-02-18 09:52:46,382 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:52:46,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-18 09:52:46,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-18 09:52:46,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-02-18 09:52:46,383 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2019-02-18 09:52:46,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:52:46,407 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-02-18 09:52:46,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-02-18 09:52:46,408 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-02-18 09:52:46,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:52:46,409 INFO L225 Difference]: With dead ends: 16 [2019-02-18 09:52:46,409 INFO L226 Difference]: Without dead ends: 14 [2019-02-18 09:52:46,410 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-02-18 09:52:46,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-02-18 09:52:46,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-02-18 09:52:46,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-02-18 09:52:46,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-02-18 09:52:46,413 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-02-18 09:52:46,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:52:46,413 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-02-18 09:52:46,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-18 09:52:46,413 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-02-18 09:52:46,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-02-18 09:52:46,414 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:52:46,414 INFO L402 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2019-02-18 09:52:46,414 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:52:46,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:52:46,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1000801955, now seen corresponding path program 10 times [2019-02-18 09:52:46,414 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:52:46,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:46,415 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:52:46,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:46,416 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:52:46,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:52:46,608 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:52:46,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:46,609 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:52:46,609 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:52:46,609 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:52:46,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:46,609 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:52:46,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:52:46,621 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:52:46,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:52:46,634 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:52:46,640 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:52:46,640 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:52:47,040 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:52:47,060 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:52:47,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2019-02-18 09:52:47,060 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:52:47,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-02-18 09:52:47,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-02-18 09:52:47,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-02-18 09:52:47,062 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2019-02-18 09:52:47,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:52:47,101 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-02-18 09:52:47,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-02-18 09:52:47,102 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-02-18 09:52:47,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:52:47,103 INFO L225 Difference]: With dead ends: 17 [2019-02-18 09:52:47,103 INFO L226 Difference]: Without dead ends: 15 [2019-02-18 09:52:47,104 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-02-18 09:52:47,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-02-18 09:52:47,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-02-18 09:52:47,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-02-18 09:52:47,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-02-18 09:52:47,107 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-02-18 09:52:47,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:52:47,107 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-02-18 09:52:47,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-02-18 09:52:47,108 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-02-18 09:52:47,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-02-18 09:52:47,108 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:52:47,108 INFO L402 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2019-02-18 09:52:47,108 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:52:47,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:52:47,108 INFO L82 PathProgramCache]: Analyzing trace with hash 960091340, now seen corresponding path program 11 times [2019-02-18 09:52:47,109 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:52:47,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:47,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:52:47,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:47,109 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:52:47,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:52:47,453 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:52:47,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:47,453 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:52:47,454 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:52:47,454 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:52:47,454 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:47,454 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:52:47,470 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:52:47,471 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:52:47,490 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-02-18 09:52:47,490 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:52:47,491 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:52:47,502 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:52:47,502 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:52:47,713 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:52:47,734 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:52:47,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2019-02-18 09:52:47,735 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:52:47,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-02-18 09:52:47,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-02-18 09:52:47,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-02-18 09:52:47,736 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2019-02-18 09:52:47,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:52:47,780 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-02-18 09:52:47,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-02-18 09:52:47,780 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-02-18 09:52:47,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:52:47,781 INFO L225 Difference]: With dead ends: 18 [2019-02-18 09:52:47,781 INFO L226 Difference]: Without dead ends: 16 [2019-02-18 09:52:47,781 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-02-18 09:52:47,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-02-18 09:52:47,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-02-18 09:52:47,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-02-18 09:52:47,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-02-18 09:52:47,784 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-02-18 09:52:47,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:52:47,784 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-02-18 09:52:47,784 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-02-18 09:52:47,785 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-02-18 09:52:47,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-02-18 09:52:47,785 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:52:47,785 INFO L402 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2019-02-18 09:52:47,785 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:52:47,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:52:47,786 INFO L82 PathProgramCache]: Analyzing trace with hash -301937725, now seen corresponding path program 12 times [2019-02-18 09:52:47,786 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:52:47,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:47,787 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:52:47,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:47,787 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:52:47,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:52:47,927 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:52:47,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:47,928 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:52:47,928 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:52:47,928 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:52:47,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:47,928 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:52:47,938 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:52:47,939 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:52:47,980 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:52:47,980 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:52:47,982 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:52:47,987 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:52:47,987 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:52:48,458 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:52:48,477 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:52:48,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2019-02-18 09:52:48,477 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:52:48,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-02-18 09:52:48,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-02-18 09:52:48,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-02-18 09:52:48,482 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2019-02-18 09:52:48,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:52:48,540 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-02-18 09:52:48,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-02-18 09:52:48,541 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-02-18 09:52:48,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:52:48,542 INFO L225 Difference]: With dead ends: 19 [2019-02-18 09:52:48,542 INFO L226 Difference]: Without dead ends: 17 [2019-02-18 09:52:48,544 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-02-18 09:52:48,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-02-18 09:52:48,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-02-18 09:52:48,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-02-18 09:52:48,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-02-18 09:52:48,550 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-02-18 09:52:48,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:52:48,552 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-02-18 09:52:48,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-02-18 09:52:48,552 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-02-18 09:52:48,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-02-18 09:52:48,553 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:52:48,553 INFO L402 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2019-02-18 09:52:48,553 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:52:48,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:52:48,553 INFO L82 PathProgramCache]: Analyzing trace with hash -770133076, now seen corresponding path program 13 times [2019-02-18 09:52:48,554 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:52:48,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:48,555 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:52:48,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:48,555 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:52:48,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:52:48,741 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:52:48,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:48,742 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:52:48,742 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:52:48,742 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:52:48,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:48,742 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:52:48,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:52:48,753 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:52:48,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:52:48,767 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:52:48,773 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:52:48,774 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:52:49,172 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:52:49,190 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:52:49,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2019-02-18 09:52:49,190 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:52:49,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-02-18 09:52:49,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-02-18 09:52:49,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-02-18 09:52:49,192 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2019-02-18 09:52:49,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:52:49,227 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-02-18 09:52:49,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-02-18 09:52:49,234 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-02-18 09:52:49,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:52:49,235 INFO L225 Difference]: With dead ends: 20 [2019-02-18 09:52:49,235 INFO L226 Difference]: Without dead ends: 18 [2019-02-18 09:52:49,235 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-02-18 09:52:49,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-02-18 09:52:49,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-02-18 09:52:49,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-02-18 09:52:49,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-02-18 09:52:49,239 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-02-18 09:52:49,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:52:49,239 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-02-18 09:52:49,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-02-18 09:52:49,239 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-02-18 09:52:49,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-02-18 09:52:49,241 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:52:49,241 INFO L402 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2019-02-18 09:52:49,242 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:52:49,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:52:49,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1895680227, now seen corresponding path program 14 times [2019-02-18 09:52:49,242 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:52:49,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:49,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:52:49,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:49,243 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:52:49,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:52:49,463 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:52:49,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:49,463 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:52:49,463 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:52:49,464 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:52:49,464 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:49,464 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:52:49,473 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:52:49,473 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:52:49,491 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-02-18 09:52:49,491 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:52:49,493 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:52:49,499 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:52:49,500 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:52:49,815 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:52:49,835 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:52:49,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2019-02-18 09:52:49,836 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:52:49,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-02-18 09:52:49,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-02-18 09:52:49,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-02-18 09:52:49,837 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2019-02-18 09:52:49,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:52:49,869 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-02-18 09:52:49,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-02-18 09:52:49,870 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-02-18 09:52:49,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:52:49,870 INFO L225 Difference]: With dead ends: 21 [2019-02-18 09:52:49,871 INFO L226 Difference]: Without dead ends: 19 [2019-02-18 09:52:49,871 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-02-18 09:52:49,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-02-18 09:52:49,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-02-18 09:52:49,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-02-18 09:52:49,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-02-18 09:52:49,874 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-02-18 09:52:49,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:52:49,875 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-02-18 09:52:49,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-02-18 09:52:49,875 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-02-18 09:52:49,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-02-18 09:52:49,875 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:52:49,876 INFO L402 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2019-02-18 09:52:49,876 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:52:49,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:52:49,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1363453300, now seen corresponding path program 15 times [2019-02-18 09:52:49,876 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:52:49,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:49,877 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:52:49,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:49,877 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:52:49,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:52:50,092 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:52:50,092 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:50,092 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:52:50,092 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:52:50,093 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:52:50,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:50,093 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:52:50,107 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:52:50,107 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:52:50,136 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:52:50,136 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:52:50,138 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:52:50,146 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:52:50,146 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:52:50,575 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:52:50,594 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:52:50,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2019-02-18 09:52:50,595 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:52:50,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-02-18 09:52:50,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-02-18 09:52:50,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-02-18 09:52:50,596 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2019-02-18 09:52:50,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:52:50,649 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-02-18 09:52:50,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-02-18 09:52:50,649 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-02-18 09:52:50,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:52:50,650 INFO L225 Difference]: With dead ends: 22 [2019-02-18 09:52:50,650 INFO L226 Difference]: Without dead ends: 20 [2019-02-18 09:52:50,651 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-02-18 09:52:50,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-02-18 09:52:50,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-02-18 09:52:50,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-02-18 09:52:50,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-02-18 09:52:50,654 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-02-18 09:52:50,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:52:50,655 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-02-18 09:52:50,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-02-18 09:52:50,655 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-02-18 09:52:50,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-02-18 09:52:50,655 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:52:50,656 INFO L402 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2019-02-18 09:52:50,656 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:52:50,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:52:50,656 INFO L82 PathProgramCache]: Analyzing trace with hash 682622467, now seen corresponding path program 16 times [2019-02-18 09:52:50,656 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:52:50,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:50,657 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:52:50,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:50,657 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:52:50,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:52:51,252 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:52:51,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:51,253 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:52:51,253 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:52:51,253 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:52:51,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:51,254 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:52:51,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:52:51,270 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:52:51,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:52:51,290 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:52:51,295 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:52:51,295 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:52:51,981 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:52:52,001 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:52:52,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2019-02-18 09:52:52,001 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:52:52,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-02-18 09:52:52,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-02-18 09:52:52,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-02-18 09:52:52,002 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2019-02-18 09:52:52,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:52:52,030 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-02-18 09:52:52,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-02-18 09:52:52,031 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-02-18 09:52:52,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:52:52,032 INFO L225 Difference]: With dead ends: 23 [2019-02-18 09:52:52,032 INFO L226 Difference]: Without dead ends: 21 [2019-02-18 09:52:52,033 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-02-18 09:52:52,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-02-18 09:52:52,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-02-18 09:52:52,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-02-18 09:52:52,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-02-18 09:52:52,035 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-02-18 09:52:52,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:52:52,036 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-02-18 09:52:52,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-02-18 09:52:52,036 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-02-18 09:52:52,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-02-18 09:52:52,036 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:52:52,036 INFO L402 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2019-02-18 09:52:52,037 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:52:52,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:52:52,037 INFO L82 PathProgramCache]: Analyzing trace with hash -313538196, now seen corresponding path program 17 times [2019-02-18 09:52:52,037 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:52:52,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:52,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:52:52,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:52,038 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:52:52,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:52:53,016 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:52:53,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:53,016 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:52:53,016 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:52:53,016 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:52:53,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:53,017 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:52:53,025 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:52:53,025 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:52:53,051 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-02-18 09:52:53,051 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:52:53,053 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:52:53,058 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:52:53,058 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:52:53,795 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:52:53,815 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:52:53,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2019-02-18 09:52:53,815 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:52:53,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-02-18 09:52:53,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-02-18 09:52:53,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-02-18 09:52:53,816 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2019-02-18 09:52:53,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:52:53,844 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-02-18 09:52:53,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-02-18 09:52:53,846 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-02-18 09:52:53,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:52:53,847 INFO L225 Difference]: With dead ends: 24 [2019-02-18 09:52:53,847 INFO L226 Difference]: Without dead ends: 22 [2019-02-18 09:52:53,848 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-02-18 09:52:53,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-02-18 09:52:53,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-02-18 09:52:53,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-02-18 09:52:53,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-02-18 09:52:53,851 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-02-18 09:52:53,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:52:53,851 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-02-18 09:52:53,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-02-18 09:52:53,851 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-02-18 09:52:53,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-02-18 09:52:53,852 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:52:53,852 INFO L402 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2019-02-18 09:52:53,852 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:52:53,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:52:53,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1129747677, now seen corresponding path program 18 times [2019-02-18 09:52:53,853 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:52:53,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:53,854 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:52:53,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:53,854 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:52:53,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:52:54,616 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:52:54,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:54,616 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:52:54,616 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:52:54,616 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:52:54,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:54,616 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:52:54,625 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:52:54,625 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:52:54,658 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:52:54,658 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:52:54,660 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:52:54,674 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:52:54,674 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:52:55,129 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:52:55,148 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:52:55,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2019-02-18 09:52:55,149 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:52:55,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-02-18 09:52:55,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-02-18 09:52:55,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-02-18 09:52:55,150 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2019-02-18 09:52:55,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:52:55,183 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-02-18 09:52:55,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-02-18 09:52:55,183 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-02-18 09:52:55,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:52:55,184 INFO L225 Difference]: With dead ends: 25 [2019-02-18 09:52:55,184 INFO L226 Difference]: Without dead ends: 23 [2019-02-18 09:52:55,186 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-02-18 09:52:55,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-02-18 09:52:55,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-02-18 09:52:55,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-02-18 09:52:55,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-02-18 09:52:55,189 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-02-18 09:52:55,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:52:55,189 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-02-18 09:52:55,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-02-18 09:52:55,189 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-02-18 09:52:55,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-02-18 09:52:55,190 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:52:55,190 INFO L402 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2019-02-18 09:52:55,190 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:52:55,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:52:55,190 INFO L82 PathProgramCache]: Analyzing trace with hash -662437812, now seen corresponding path program 19 times [2019-02-18 09:52:55,191 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:52:55,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:55,191 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:52:55,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:55,192 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:52:55,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:52:55,486 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:52:55,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:55,486 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:52:55,487 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:52:55,487 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:52:55,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:55,487 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:52:55,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:52:55,497 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:52:55,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:52:55,529 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:52:55,536 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:52:55,536 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:52:56,000 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:52:56,019 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:52:56,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2019-02-18 09:52:56,019 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:52:56,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-02-18 09:52:56,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-02-18 09:52:56,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-02-18 09:52:56,020 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2019-02-18 09:52:56,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:52:56,059 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-02-18 09:52:56,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-02-18 09:52:56,060 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-02-18 09:52:56,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:52:56,061 INFO L225 Difference]: With dead ends: 26 [2019-02-18 09:52:56,061 INFO L226 Difference]: Without dead ends: 24 [2019-02-18 09:52:56,063 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-02-18 09:52:56,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-02-18 09:52:56,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-02-18 09:52:56,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-02-18 09:52:56,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-02-18 09:52:56,066 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-02-18 09:52:56,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:52:56,067 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-02-18 09:52:56,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-02-18 09:52:56,067 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-02-18 09:52:56,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-02-18 09:52:56,068 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:52:56,068 INFO L402 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2019-02-18 09:52:56,068 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:52:56,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:52:56,068 INFO L82 PathProgramCache]: Analyzing trace with hash 939266115, now seen corresponding path program 20 times [2019-02-18 09:52:56,068 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:52:56,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:56,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:52:56,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:56,069 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:52:56,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:52:56,316 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:52:56,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:56,317 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:52:56,317 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:52:56,317 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:52:56,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:56,317 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:52:56,326 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:52:56,326 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:52:56,360 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-02-18 09:52:56,360 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:52:56,362 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:52:56,370 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:52:56,371 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:52:57,066 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:52:57,084 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:52:57,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2019-02-18 09:52:57,084 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:52:57,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-02-18 09:52:57,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-02-18 09:52:57,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-02-18 09:52:57,086 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2019-02-18 09:52:57,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:52:57,161 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-02-18 09:52:57,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-02-18 09:52:57,161 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-02-18 09:52:57,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:52:57,162 INFO L225 Difference]: With dead ends: 27 [2019-02-18 09:52:57,162 INFO L226 Difference]: Without dead ends: 25 [2019-02-18 09:52:57,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-02-18 09:52:57,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-02-18 09:52:57,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-02-18 09:52:57,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-02-18 09:52:57,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-02-18 09:52:57,165 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-02-18 09:52:57,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:52:57,166 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-02-18 09:52:57,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-02-18 09:52:57,166 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-02-18 09:52:57,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-02-18 09:52:57,166 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:52:57,167 INFO L402 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2019-02-18 09:52:57,167 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:52:57,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:52:57,167 INFO L82 PathProgramCache]: Analyzing trace with hash -947519700, now seen corresponding path program 21 times [2019-02-18 09:52:57,167 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:52:57,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:57,168 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:52:57,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:57,168 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:52:57,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:52:58,023 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:52:58,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:58,024 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:52:58,024 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:52:58,024 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:52:58,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:58,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 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:52:58,033 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:52:58,034 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:52:58,055 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:52:58,056 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:52:58,058 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:52:58,065 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:52:58,065 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:52:58,643 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:52:58,662 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:52:58,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2019-02-18 09:52:58,662 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:52:58,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-02-18 09:52:58,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-02-18 09:52:58,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-02-18 09:52:58,663 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2019-02-18 09:52:58,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:52:58,752 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-02-18 09:52:58,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-02-18 09:52:58,754 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-02-18 09:52:58,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:52:58,755 INFO L225 Difference]: With dead ends: 28 [2019-02-18 09:52:58,755 INFO L226 Difference]: Without dead ends: 26 [2019-02-18 09:52:58,756 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 25 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-02-18 09:52:58,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-02-18 09:52:58,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-02-18 09:52:58,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-02-18 09:52:58,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-02-18 09:52:58,759 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-02-18 09:52:58,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:52:58,759 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-02-18 09:52:58,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-02-18 09:52:58,759 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-02-18 09:52:58,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-02-18 09:52:58,760 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:52:58,760 INFO L402 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2019-02-18 09:52:58,760 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:52:58,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:52:58,760 INFO L82 PathProgramCache]: Analyzing trace with hash 691662179, now seen corresponding path program 22 times [2019-02-18 09:52:58,760 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:52:58,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:58,761 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:52:58,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:58,761 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:52:58,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:52:59,087 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:52:59,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:59,087 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:52:59,087 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:52:59,087 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:52:59,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:59,088 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:52:59,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:52:59,096 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:52:59,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:52:59,118 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:52:59,125 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:52:59,125 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:52:59,696 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:52:59,717 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:52:59,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2019-02-18 09:52:59,717 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:52:59,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-02-18 09:52:59,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-02-18 09:52:59,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-02-18 09:52:59,719 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2019-02-18 09:52:59,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:52:59,753 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-02-18 09:52:59,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-02-18 09:52:59,753 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2019-02-18 09:52:59,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:52:59,754 INFO L225 Difference]: With dead ends: 29 [2019-02-18 09:52:59,754 INFO L226 Difference]: Without dead ends: 27 [2019-02-18 09:52:59,755 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 26 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-02-18 09:52:59,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-02-18 09:52:59,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-02-18 09:52:59,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-02-18 09:52:59,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-02-18 09:52:59,759 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-02-18 09:52:59,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:52:59,759 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-02-18 09:52:59,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-02-18 09:52:59,759 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-02-18 09:52:59,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-02-18 09:52:59,760 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:52:59,760 INFO L402 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2019-02-18 09:52:59,760 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:52:59,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:52:59,761 INFO L82 PathProgramCache]: Analyzing trace with hash -33307124, now seen corresponding path program 23 times [2019-02-18 09:52:59,761 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:52:59,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:59,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:52:59,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:59,762 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:52:59,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:00,111 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:00,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:00,112 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:53:00,112 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:53:00,112 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:53:00,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:00,112 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:53:00,120 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:53:00,120 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:53:00,161 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-02-18 09:53:00,161 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:53:00,163 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:53:00,171 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:00,171 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:53:00,855 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:00,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:53:00,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2019-02-18 09:53:00,874 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:53:00,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-02-18 09:53:00,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-02-18 09:53:00,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-02-18 09:53:00,876 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2019-02-18 09:53:00,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:53:00,921 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-02-18 09:53:00,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-02-18 09:53:00,921 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-02-18 09:53:00,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:53:00,922 INFO L225 Difference]: With dead ends: 30 [2019-02-18 09:53:00,922 INFO L226 Difference]: Without dead ends: 28 [2019-02-18 09:53:00,923 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-02-18 09:53:00,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-02-18 09:53:00,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-02-18 09:53:00,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-02-18 09:53:00,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-02-18 09:53:00,926 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-02-18 09:53:00,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:53:00,927 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-02-18 09:53:00,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-02-18 09:53:00,927 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-02-18 09:53:00,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-02-18 09:53:00,927 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:53:00,928 INFO L402 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2019-02-18 09:53:00,928 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:53:00,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:00,928 INFO L82 PathProgramCache]: Analyzing trace with hash -1032519037, now seen corresponding path program 24 times [2019-02-18 09:53:00,928 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:53:00,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:00,929 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:53:00,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:00,929 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:53:00,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:01,410 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:01,410 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:01,410 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:53:01,410 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:53:01,410 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:53:01,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:01,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 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:53:01,418 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:53:01,419 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:53:01,442 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:53:01,442 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:53:01,444 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:53:01,450 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:01,451 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:53:02,410 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:02,428 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:53:02,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2019-02-18 09:53:02,428 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:53:02,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-02-18 09:53:02,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-02-18 09:53:02,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-02-18 09:53:02,430 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2019-02-18 09:53:02,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:53:02,480 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-02-18 09:53:02,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-02-18 09:53:02,481 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2019-02-18 09:53:02,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:53:02,482 INFO L225 Difference]: With dead ends: 31 [2019-02-18 09:53:02,482 INFO L226 Difference]: Without dead ends: 29 [2019-02-18 09:53:02,484 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-02-18 09:53:02,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-02-18 09:53:02,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-02-18 09:53:02,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-02-18 09:53:02,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-02-18 09:53:02,487 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-02-18 09:53:02,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:53:02,488 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-02-18 09:53:02,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-02-18 09:53:02,488 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-02-18 09:53:02,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-02-18 09:53:02,488 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:53:02,489 INFO L402 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2019-02-18 09:53:02,489 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:53:02,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:02,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1943317268, now seen corresponding path program 25 times [2019-02-18 09:53:02,489 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:53:02,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:02,490 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:53:02,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:02,490 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:53:02,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:02,873 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:02,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:02,874 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:53:02,874 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:53:02,874 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:53:02,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:02,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 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:53:02,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:53:02,884 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:53:02,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:02,909 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:53:02,916 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:02,917 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:53:04,241 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:04,260 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:53:04,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2019-02-18 09:53:04,261 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:53:04,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-02-18 09:53:04,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-02-18 09:53:04,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-02-18 09:53:04,262 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2019-02-18 09:53:04,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:53:04,326 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-02-18 09:53:04,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-02-18 09:53:04,327 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2019-02-18 09:53:04,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:53:04,327 INFO L225 Difference]: With dead ends: 32 [2019-02-18 09:53:04,328 INFO L226 Difference]: Without dead ends: 30 [2019-02-18 09:53:04,329 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-02-18 09:53:04,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-02-18 09:53:04,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-02-18 09:53:04,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-02-18 09:53:04,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-02-18 09:53:04,332 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-02-18 09:53:04,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:53:04,332 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-02-18 09:53:04,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-02-18 09:53:04,332 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-02-18 09:53:04,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-02-18 09:53:04,333 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:53:04,333 INFO L402 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2019-02-18 09:53:04,333 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:53:04,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:04,333 INFO L82 PathProgramCache]: Analyzing trace with hash -113291357, now seen corresponding path program 26 times [2019-02-18 09:53:04,333 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:53:04,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:04,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:53:04,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:04,334 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:53:04,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:04,971 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:04,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:04,971 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:53:04,971 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:53:04,972 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:53:04,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:04,972 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:53:04,982 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:53:04,982 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:53:05,032 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-02-18 09:53:05,033 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:53:05,035 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:53:05,045 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:05,045 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:53:05,850 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:05,869 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:53:05,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2019-02-18 09:53:05,869 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:53:05,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-02-18 09:53:05,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-02-18 09:53:05,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-02-18 09:53:05,871 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2019-02-18 09:53:06,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:53:06,086 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-02-18 09:53:06,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-02-18 09:53:06,087 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2019-02-18 09:53:06,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:53:06,087 INFO L225 Difference]: With dead ends: 33 [2019-02-18 09:53:06,088 INFO L226 Difference]: Without dead ends: 31 [2019-02-18 09:53:06,089 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-02-18 09:53:06,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-02-18 09:53:06,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-02-18 09:53:06,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-02-18 09:53:06,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-02-18 09:53:06,093 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-02-18 09:53:06,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:53:06,093 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-02-18 09:53:06,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-02-18 09:53:06,093 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-02-18 09:53:06,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-02-18 09:53:06,093 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:53:06,094 INFO L402 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2019-02-18 09:53:06,094 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:53:06,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:06,094 INFO L82 PathProgramCache]: Analyzing trace with hash 782937036, now seen corresponding path program 27 times [2019-02-18 09:53:06,094 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:53:06,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:06,095 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:53:06,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:06,095 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:53:06,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:06,656 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:06,656 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:06,657 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:53:06,657 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:53:06,657 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:53:06,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:06,657 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:53:06,668 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:53:06,669 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:53:06,706 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:53:06,706 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:53:06,708 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:53:06,717 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:06,717 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:53:07,979 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:07,997 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:53:07,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2019-02-18 09:53:07,998 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:53:07,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-02-18 09:53:07,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-02-18 09:53:07,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-02-18 09:53:08,000 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2019-02-18 09:53:08,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:53:08,034 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-02-18 09:53:08,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-02-18 09:53:08,034 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2019-02-18 09:53:08,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:53:08,035 INFO L225 Difference]: With dead ends: 34 [2019-02-18 09:53:08,035 INFO L226 Difference]: Without dead ends: 32 [2019-02-18 09:53:08,036 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-02-18 09:53:08,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-02-18 09:53:08,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-02-18 09:53:08,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-02-18 09:53:08,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-02-18 09:53:08,040 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-02-18 09:53:08,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:53:08,040 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-02-18 09:53:08,040 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-02-18 09:53:08,041 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-02-18 09:53:08,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-02-18 09:53:08,041 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:53:08,041 INFO L402 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2019-02-18 09:53:08,041 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:53:08,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:08,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1498753853, now seen corresponding path program 28 times [2019-02-18 09:53:08,042 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:53:08,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:08,042 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:53:08,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:08,043 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:53:08,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:08,531 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:08,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:08,532 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:53:08,532 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:53:08,532 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:53:08,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:08,532 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:53:08,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:53:08,542 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:53:08,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:08,572 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:53:08,578 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:08,578 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:53:09,465 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:09,483 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:53:09,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 59 [2019-02-18 09:53:09,483 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:53:09,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-02-18 09:53:09,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-02-18 09:53:09,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-02-18 09:53:09,485 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2019-02-18 09:53:09,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:53:09,559 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-02-18 09:53:09,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-02-18 09:53:09,559 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2019-02-18 09:53:09,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:53:09,560 INFO L225 Difference]: With dead ends: 35 [2019-02-18 09:53:09,560 INFO L226 Difference]: Without dead ends: 33 [2019-02-18 09:53:09,561 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-02-18 09:53:09,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-02-18 09:53:09,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-02-18 09:53:09,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-02-18 09:53:09,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-02-18 09:53:09,564 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-02-18 09:53:09,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:53:09,564 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-02-18 09:53:09,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-02-18 09:53:09,564 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-02-18 09:53:09,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-02-18 09:53:09,565 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:53:09,565 INFO L402 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2019-02-18 09:53:09,565 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:53:09,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:09,565 INFO L82 PathProgramCache]: Analyzing trace with hash 783272620, now seen corresponding path program 29 times [2019-02-18 09:53:09,565 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:53:09,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:09,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:53:09,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:09,566 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:53:09,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:10,146 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:10,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:10,147 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:53:10,147 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:53:10,147 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:53:10,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:10,148 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:53:10,158 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:53:10,158 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:53:10,220 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-02-18 09:53:10,220 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:53:10,222 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:53:10,232 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:10,232 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:53:11,284 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:11,305 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:53:11,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2019-02-18 09:53:11,305 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:53:11,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-02-18 09:53:11,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-02-18 09:53:11,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-02-18 09:53:11,307 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2019-02-18 09:53:11,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:53:11,359 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-02-18 09:53:11,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-02-18 09:53:11,360 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2019-02-18 09:53:11,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:53:11,360 INFO L225 Difference]: With dead ends: 36 [2019-02-18 09:53:11,360 INFO L226 Difference]: Without dead ends: 34 [2019-02-18 09:53:11,362 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-02-18 09:53:11,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-02-18 09:53:11,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-02-18 09:53:11,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-02-18 09:53:11,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-02-18 09:53:11,364 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-02-18 09:53:11,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:53:11,364 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-02-18 09:53:11,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-02-18 09:53:11,365 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-02-18 09:53:11,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-02-18 09:53:11,365 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:53:11,365 INFO L402 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2019-02-18 09:53:11,365 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:53:11,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:11,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1488350749, now seen corresponding path program 30 times [2019-02-18 09:53:11,366 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:53:11,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:11,366 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:53:11,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:11,366 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:53:11,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:11,766 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:11,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:11,767 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:53:11,767 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:53:11,767 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:53:11,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:11,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 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:53:11,780 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:53:11,780 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:53:11,826 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:53:11,826 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:53:11,829 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:53:11,846 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:11,847 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:53:13,139 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:13,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:53:13,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2019-02-18 09:53:13,159 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:53:13,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-02-18 09:53:13,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-02-18 09:53:13,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-02-18 09:53:13,161 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2019-02-18 09:53:13,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:53:13,238 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-02-18 09:53:13,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-02-18 09:53:13,239 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2019-02-18 09:53:13,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:53:13,240 INFO L225 Difference]: With dead ends: 37 [2019-02-18 09:53:13,240 INFO L226 Difference]: Without dead ends: 35 [2019-02-18 09:53:13,241 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-02-18 09:53:13,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-02-18 09:53:13,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-02-18 09:53:13,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-02-18 09:53:13,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-02-18 09:53:13,243 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-02-18 09:53:13,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:53:13,243 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-02-18 09:53:13,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-02-18 09:53:13,243 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-02-18 09:53:13,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-02-18 09:53:13,243 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:53:13,243 INFO L402 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2019-02-18 09:53:13,244 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:53:13,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:13,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1105768844, now seen corresponding path program 31 times [2019-02-18 09:53:13,244 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:53:13,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:13,245 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:53:13,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:13,245 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:53:13,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:13,738 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:13,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:13,738 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:53:13,739 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:53:13,739 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:53:13,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:13,739 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:53:13,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:53:13,748 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:53:13,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:13,777 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:53:13,785 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:13,785 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:53:14,890 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:14,908 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:53:14,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2019-02-18 09:53:14,909 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:53:14,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-02-18 09:53:14,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-02-18 09:53:14,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-02-18 09:53:14,910 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2019-02-18 09:53:14,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:53:14,981 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-02-18 09:53:14,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-02-18 09:53:14,981 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2019-02-18 09:53:14,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:53:14,982 INFO L225 Difference]: With dead ends: 38 [2019-02-18 09:53:14,982 INFO L226 Difference]: Without dead ends: 36 [2019-02-18 09:53:14,983 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-02-18 09:53:14,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-02-18 09:53:14,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-02-18 09:53:14,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-02-18 09:53:14,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-02-18 09:53:14,987 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-02-18 09:53:14,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:53:14,987 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-02-18 09:53:14,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-02-18 09:53:14,987 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-02-18 09:53:14,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-02-18 09:53:14,988 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:53:14,988 INFO L402 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2019-02-18 09:53:14,988 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:53:14,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:14,988 INFO L82 PathProgramCache]: Analyzing trace with hash -80902397, now seen corresponding path program 32 times [2019-02-18 09:53:14,988 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:53:14,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:14,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:53:14,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:14,989 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:53:14,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:15,523 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:15,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:15,523 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:53:15,523 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:53:15,524 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:53:15,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:15,524 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:53:15,532 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:53:15,533 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:53:15,610 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-02-18 09:53:15,611 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:53:15,613 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:53:15,623 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:15,623 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:53:16,817 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:16,836 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:53:16,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 67 [2019-02-18 09:53:16,836 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:53:16,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-02-18 09:53:16,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-02-18 09:53:16,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-02-18 09:53:16,837 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2019-02-18 09:53:16,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:53:16,904 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-02-18 09:53:16,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-02-18 09:53:16,904 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2019-02-18 09:53:16,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:53:16,905 INFO L225 Difference]: With dead ends: 39 [2019-02-18 09:53:16,905 INFO L226 Difference]: Without dead ends: 37 [2019-02-18 09:53:16,906 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-02-18 09:53:16,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-02-18 09:53:16,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-02-18 09:53:16,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-02-18 09:53:16,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-02-18 09:53:16,909 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-02-18 09:53:16,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:53:16,909 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-02-18 09:53:16,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-02-18 09:53:16,910 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-02-18 09:53:16,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-02-18 09:53:16,910 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:53:16,910 INFO L402 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2019-02-18 09:53:16,910 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:53:16,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:16,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1786994796, now seen corresponding path program 33 times [2019-02-18 09:53:16,911 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:53:16,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:16,911 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:53:16,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:16,911 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:53:16,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:17,868 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:17,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:17,869 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:53:17,869 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:53:17,869 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:53:17,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:17,869 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:53:17,879 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:53:17,879 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:53:17,920 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:53:17,920 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:53:17,922 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:53:17,939 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:17,940 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:53:19,149 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:19,168 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:53:19,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2019-02-18 09:53:19,169 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:53:19,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-02-18 09:53:19,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-02-18 09:53:19,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-02-18 09:53:19,170 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2019-02-18 09:53:19,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:53:19,268 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-02-18 09:53:19,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-02-18 09:53:19,269 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2019-02-18 09:53:19,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:53:19,270 INFO L225 Difference]: With dead ends: 40 [2019-02-18 09:53:19,270 INFO L226 Difference]: Without dead ends: 38 [2019-02-18 09:53:19,270 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-02-18 09:53:19,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-02-18 09:53:19,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-02-18 09:53:19,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-02-18 09:53:19,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-02-18 09:53:19,273 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-02-18 09:53:19,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:53:19,273 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-02-18 09:53:19,273 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-02-18 09:53:19,273 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-02-18 09:53:19,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-02-18 09:53:19,274 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:53:19,274 INFO L402 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2019-02-18 09:53:19,274 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:53:19,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:19,274 INFO L82 PathProgramCache]: Analyzing trace with hash -437734365, now seen corresponding path program 34 times [2019-02-18 09:53:19,274 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:53:19,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:19,275 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:53:19,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:19,275 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:53:19,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:20,935 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:20,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:20,935 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:53:20,935 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:53:20,935 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:53:20,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:20,936 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:53:20,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:53:20,952 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:53:20,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:20,983 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:53:20,990 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:20,991 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:53:22,302 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:22,322 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:53:22,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 71 [2019-02-18 09:53:22,323 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:53:22,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-02-18 09:53:22,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-02-18 09:53:22,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-02-18 09:53:22,324 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2019-02-18 09:53:22,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:53:22,432 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-02-18 09:53:22,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-02-18 09:53:22,432 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2019-02-18 09:53:22,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:53:22,433 INFO L225 Difference]: With dead ends: 41 [2019-02-18 09:53:22,433 INFO L226 Difference]: Without dead ends: 39 [2019-02-18 09:53:22,433 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-02-18 09:53:22,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-02-18 09:53:22,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-02-18 09:53:22,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-02-18 09:53:22,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-02-18 09:53:22,435 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-02-18 09:53:22,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:53:22,436 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-02-18 09:53:22,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-02-18 09:53:22,436 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-02-18 09:53:22,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-02-18 09:53:22,436 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:53:22,437 INFO L402 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2019-02-18 09:53:22,437 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:53:22,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:22,437 INFO L82 PathProgramCache]: Analyzing trace with hash -684861620, now seen corresponding path program 35 times [2019-02-18 09:53:22,437 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:53:22,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:22,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:53:22,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:22,438 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:53:22,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:23,208 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:23,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:23,209 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:53:23,209 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:53:23,209 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:53:23,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:23,209 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:53:23,218 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:53:23,218 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:53:23,308 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2019-02-18 09:53:23,309 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:53:23,311 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:53:23,320 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:23,320 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:53:24,783 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:24,803 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:53:24,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2019-02-18 09:53:24,804 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:53:24,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-02-18 09:53:24,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-02-18 09:53:24,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-02-18 09:53:24,805 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2019-02-18 09:53:24,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:53:24,855 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-02-18 09:53:24,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-02-18 09:53:24,856 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2019-02-18 09:53:24,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:53:24,856 INFO L225 Difference]: With dead ends: 42 [2019-02-18 09:53:24,857 INFO L226 Difference]: Without dead ends: 40 [2019-02-18 09:53:24,857 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 39 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-02-18 09:53:24,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-02-18 09:53:24,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-02-18 09:53:24,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-02-18 09:53:24,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-02-18 09:53:24,860 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-02-18 09:53:24,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:53:24,860 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-02-18 09:53:24,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-02-18 09:53:24,860 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-02-18 09:53:24,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-02-18 09:53:24,860 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:53:24,860 INFO L402 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2019-02-18 09:53:24,861 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:53:24,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:24,861 INFO L82 PathProgramCache]: Analyzing trace with hash 244128067, now seen corresponding path program 36 times [2019-02-18 09:53:24,861 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:53:24,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:24,861 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:53:24,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:24,862 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:53:24,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:25,736 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:25,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:25,736 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:53:25,736 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:53:25,736 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:53:25,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:25,736 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:53:25,746 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:53:25,746 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:53:25,780 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:53:25,780 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:53:25,782 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:53:25,788 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:25,788 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:53:27,246 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:27,265 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:53:27,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 75 [2019-02-18 09:53:27,265 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:53:27,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-02-18 09:53:27,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-02-18 09:53:27,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-02-18 09:53:27,266 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2019-02-18 09:53:27,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:53:27,324 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-02-18 09:53:27,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-02-18 09:53:27,324 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2019-02-18 09:53:27,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:53:27,325 INFO L225 Difference]: With dead ends: 43 [2019-02-18 09:53:27,325 INFO L226 Difference]: Without dead ends: 41 [2019-02-18 09:53:27,326 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-02-18 09:53:27,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-02-18 09:53:27,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-02-18 09:53:27,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-02-18 09:53:27,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-02-18 09:53:27,328 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-02-18 09:53:27,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:53:27,329 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-02-18 09:53:27,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-02-18 09:53:27,329 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-02-18 09:53:27,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-02-18 09:53:27,330 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:53:27,330 INFO L402 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2019-02-18 09:53:27,330 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:53:27,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:27,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1021962708, now seen corresponding path program 37 times [2019-02-18 09:53:27,330 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:53:27,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:27,331 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:53:27,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:27,331 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:53:27,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:28,184 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:28,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:28,184 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:53:28,184 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:53:28,184 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:53:28,185 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:28,185 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:53:28,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:53:28,193 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:53:28,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:28,222 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:53:28,229 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:28,229 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:53:29,746 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:29,766 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:53:29,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 77 [2019-02-18 09:53:29,766 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:53:29,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-02-18 09:53:29,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-02-18 09:53:29,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-02-18 09:53:29,767 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2019-02-18 09:53:29,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:53:29,849 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-02-18 09:53:29,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-02-18 09:53:29,850 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2019-02-18 09:53:29,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:53:29,850 INFO L225 Difference]: With dead ends: 44 [2019-02-18 09:53:29,850 INFO L226 Difference]: Without dead ends: 42 [2019-02-18 09:53:29,851 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-02-18 09:53:29,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-02-18 09:53:29,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-02-18 09:53:29,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-02-18 09:53:29,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-02-18 09:53:29,854 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2019-02-18 09:53:29,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:53:29,854 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-02-18 09:53:29,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-02-18 09:53:29,854 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-02-18 09:53:29,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-02-18 09:53:29,855 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:53:29,855 INFO L402 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2019-02-18 09:53:29,855 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:53:29,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:29,856 INFO L82 PathProgramCache]: Analyzing trace with hash -1616071069, now seen corresponding path program 38 times [2019-02-18 09:53:29,856 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:53:29,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:29,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:53:29,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:29,857 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:53:29,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:30,512 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:30,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:30,513 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:53:30,513 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:53:30,513 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:53:30,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:30,513 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:53:30,521 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:53:30,521 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:53:30,630 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-02-18 09:53:30,630 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:53:30,632 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:53:30,642 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:30,642 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:53:32,291 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:32,309 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:53:32,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 79 [2019-02-18 09:53:32,310 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:53:32,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-02-18 09:53:32,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-02-18 09:53:32,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-02-18 09:53:32,311 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2019-02-18 09:53:32,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:53:32,374 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-02-18 09:53:32,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-02-18 09:53:32,374 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2019-02-18 09:53:32,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:53:32,375 INFO L225 Difference]: With dead ends: 45 [2019-02-18 09:53:32,375 INFO L226 Difference]: Without dead ends: 43 [2019-02-18 09:53:32,376 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-02-18 09:53:32,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-02-18 09:53:32,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-02-18 09:53:32,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-02-18 09:53:32,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-02-18 09:53:32,378 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2019-02-18 09:53:32,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:53:32,378 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-02-18 09:53:32,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-02-18 09:53:32,378 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-02-18 09:53:32,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-02-18 09:53:32,378 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:53:32,379 INFO L402 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2019-02-18 09:53:32,379 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:53:32,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:32,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1441406220, now seen corresponding path program 39 times [2019-02-18 09:53:32,379 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:53:32,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:32,380 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:53:32,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:32,380 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:53:32,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:33,358 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:33,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:33,359 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:53:33,359 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:53:33,359 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:53:33,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:33,359 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:53:33,369 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:53:33,369 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:53:33,404 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:53:33,405 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:53:33,406 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:53:33,413 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:33,414 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:53:35,062 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:35,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:53:35,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 81 [2019-02-18 09:53:35,080 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:53:35,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-02-18 09:53:35,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-02-18 09:53:35,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-02-18 09:53:35,081 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2019-02-18 09:53:35,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:53:35,153 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-02-18 09:53:35,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-02-18 09:53:35,153 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2019-02-18 09:53:35,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:53:35,154 INFO L225 Difference]: With dead ends: 46 [2019-02-18 09:53:35,154 INFO L226 Difference]: Without dead ends: 44 [2019-02-18 09:53:35,155 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-02-18 09:53:35,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-02-18 09:53:35,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-02-18 09:53:35,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-02-18 09:53:35,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-02-18 09:53:35,156 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2019-02-18 09:53:35,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:53:35,157 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-02-18 09:53:35,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-02-18 09:53:35,157 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-02-18 09:53:35,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-02-18 09:53:35,157 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:53:35,157 INFO L402 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2019-02-18 09:53:35,157 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:53:35,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:35,158 INFO L82 PathProgramCache]: Analyzing trace with hash 1733921667, now seen corresponding path program 40 times [2019-02-18 09:53:35,158 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:53:35,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:35,158 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:53:35,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:35,159 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:53:35,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:35,863 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:35,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:35,864 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:53:35,864 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:53:35,864 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:53:35,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:35,864 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:53:35,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:53:35,874 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:53:35,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:35,910 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:53:35,930 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:35,931 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:53:38,100 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:38,118 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:53:38,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 83 [2019-02-18 09:53:38,118 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:53:38,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-02-18 09:53:38,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-02-18 09:53:38,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-02-18 09:53:38,119 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2019-02-18 09:53:38,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:53:38,242 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-02-18 09:53:38,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-02-18 09:53:38,243 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2019-02-18 09:53:38,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:53:38,244 INFO L225 Difference]: With dead ends: 47 [2019-02-18 09:53:38,244 INFO L226 Difference]: Without dead ends: 45 [2019-02-18 09:53:38,244 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-02-18 09:53:38,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-02-18 09:53:38,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-02-18 09:53:38,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-02-18 09:53:38,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-02-18 09:53:38,246 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2019-02-18 09:53:38,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:53:38,246 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-02-18 09:53:38,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-02-18 09:53:38,247 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-02-18 09:53:38,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-02-18 09:53:38,247 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:53:38,247 INFO L402 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2019-02-18 09:53:38,247 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:53:38,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:38,247 INFO L82 PathProgramCache]: Analyzing trace with hash -2083001364, now seen corresponding path program 41 times [2019-02-18 09:53:38,247 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:53:38,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:38,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:53:38,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:38,248 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:53:38,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:39,117 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:39,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:39,118 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:53:39,118 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:53:39,118 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:53:39,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:39,118 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:53:39,127 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:53:39,127 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:53:39,271 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-02-18 09:53:39,272 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:53:39,274 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:53:39,281 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:39,281 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:53:41,159 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:41,178 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:53:41,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 85 [2019-02-18 09:53:41,179 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:53:41,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-02-18 09:53:41,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-02-18 09:53:41,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-02-18 09:53:41,180 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2019-02-18 09:53:41,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:53:41,253 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-02-18 09:53:41,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-02-18 09:53:41,253 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2019-02-18 09:53:41,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:53:41,254 INFO L225 Difference]: With dead ends: 48 [2019-02-18 09:53:41,254 INFO L226 Difference]: Without dead ends: 46 [2019-02-18 09:53:41,254 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-02-18 09:53:41,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-02-18 09:53:41,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-02-18 09:53:41,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-02-18 09:53:41,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-02-18 09:53:41,256 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2019-02-18 09:53:41,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:53:41,256 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-02-18 09:53:41,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-02-18 09:53:41,256 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-02-18 09:53:41,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-02-18 09:53:41,257 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:53:41,257 INFO L402 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2019-02-18 09:53:41,257 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:53:41,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:41,257 INFO L82 PathProgramCache]: Analyzing trace with hash -148531037, now seen corresponding path program 42 times [2019-02-18 09:53:41,257 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:53:41,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:41,258 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:53:41,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:41,258 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:53:41,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:41,988 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:41,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:41,988 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:53:41,988 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:53:41,989 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:53:41,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:41,989 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:53:41,997 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:53:41,997 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:53:42,037 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:53:42,037 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:53:42,039 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:53:42,047 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:42,048 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:53:44,313 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:44,332 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:53:44,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 87 [2019-02-18 09:53:44,332 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:53:44,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-02-18 09:53:44,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-02-18 09:53:44,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-02-18 09:53:44,333 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2019-02-18 09:53:44,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:53:44,389 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-02-18 09:53:44,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-02-18 09:53:44,389 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2019-02-18 09:53:44,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:53:44,390 INFO L225 Difference]: With dead ends: 49 [2019-02-18 09:53:44,390 INFO L226 Difference]: Without dead ends: 47 [2019-02-18 09:53:44,391 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-02-18 09:53:44,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-02-18 09:53:44,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-02-18 09:53:44,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-02-18 09:53:44,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-02-18 09:53:44,394 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2019-02-18 09:53:44,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:53:44,395 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-02-18 09:53:44,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-02-18 09:53:44,395 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-02-18 09:53:44,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-02-18 09:53:44,395 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:53:44,395 INFO L402 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2019-02-18 09:53:44,396 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:53:44,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:44,396 INFO L82 PathProgramCache]: Analyzing trace with hash -309493044, now seen corresponding path program 43 times [2019-02-18 09:53:44,396 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:53:44,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:44,397 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:53:44,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:44,397 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:53:44,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:45,455 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:45,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:45,455 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:53:45,456 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:53:45,456 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:53:45,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:45,456 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:53:45,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:53:45,467 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:53:45,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:45,511 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:53:45,521 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:45,522 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:53:47,546 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:47,564 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:53:47,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 89 [2019-02-18 09:53:47,564 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:53:47,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-02-18 09:53:47,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-02-18 09:53:47,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-02-18 09:53:47,566 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2019-02-18 09:53:47,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:53:47,704 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-02-18 09:53:47,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-02-18 09:53:47,704 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2019-02-18 09:53:47,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:53:47,705 INFO L225 Difference]: With dead ends: 50 [2019-02-18 09:53:47,705 INFO L226 Difference]: Without dead ends: 48 [2019-02-18 09:53:47,706 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-02-18 09:53:47,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-02-18 09:53:47,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-02-18 09:53:47,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-02-18 09:53:47,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-02-18 09:53:47,708 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2019-02-18 09:53:47,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:53:47,709 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-02-18 09:53:47,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-02-18 09:53:47,709 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-02-18 09:53:47,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-02-18 09:53:47,709 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:53:47,709 INFO L402 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2019-02-18 09:53:47,710 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:53:47,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:47,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1004347965, now seen corresponding path program 44 times [2019-02-18 09:53:47,710 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:53:47,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:47,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:53:47,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:47,711 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:53:47,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:48,899 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:48,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:48,899 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:53:48,899 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:53:48,899 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:53:48,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:48,899 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:53:48,908 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:53:48,908 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:53:49,059 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2019-02-18 09:53:49,059 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:53:49,062 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:53:49,074 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:49,074 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:53:51,161 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:51,180 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:53:51,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 91 [2019-02-18 09:53:51,180 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:53:51,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-02-18 09:53:51,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-02-18 09:53:51,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-02-18 09:53:51,181 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2019-02-18 09:53:51,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:53:51,240 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-02-18 09:53:51,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-02-18 09:53:51,240 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2019-02-18 09:53:51,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:53:51,241 INFO L225 Difference]: With dead ends: 51 [2019-02-18 09:53:51,241 INFO L226 Difference]: Without dead ends: 49 [2019-02-18 09:53:51,242 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-02-18 09:53:51,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-02-18 09:53:51,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-02-18 09:53:51,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-02-18 09:53:51,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-02-18 09:53:51,245 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2019-02-18 09:53:51,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:53:51,245 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-02-18 09:53:51,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-02-18 09:53:51,245 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-02-18 09:53:51,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-02-18 09:53:51,245 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:53:51,245 INFO L402 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2019-02-18 09:53:51,246 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:53:51,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:51,246 INFO L82 PathProgramCache]: Analyzing trace with hash -1070014036, now seen corresponding path program 45 times [2019-02-18 09:53:51,246 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:53:51,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:51,247 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:53:51,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:51,247 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:53:51,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:52,089 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:52,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:52,089 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:53:52,089 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:53:52,089 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:53:52,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:52,090 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:53:52,100 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:53:52,100 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:53:52,144 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:53:52,144 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:53:52,147 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:53:52,158 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:52,158 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:53:54,735 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:54,753 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:53:54,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 93 [2019-02-18 09:53:54,754 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:53:54,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-02-18 09:53:54,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-02-18 09:53:54,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-02-18 09:53:54,755 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2019-02-18 09:53:54,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:53:54,961 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-02-18 09:53:54,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-02-18 09:53:54,961 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2019-02-18 09:53:54,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:53:54,962 INFO L225 Difference]: With dead ends: 52 [2019-02-18 09:53:54,962 INFO L226 Difference]: Without dead ends: 50 [2019-02-18 09:53:54,963 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-02-18 09:53:54,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-02-18 09:53:54,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-02-18 09:53:54,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-02-18 09:53:54,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-02-18 09:53:54,966 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2019-02-18 09:53:54,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:53:54,966 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-02-18 09:53:54,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-02-18 09:53:54,966 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-02-18 09:53:54,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-02-18 09:53:54,967 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:53:54,967 INFO L402 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2019-02-18 09:53:54,967 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:53:54,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:54,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1189305059, now seen corresponding path program 46 times [2019-02-18 09:53:54,968 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:53:54,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:54,968 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:53:54,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:54,969 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:53:54,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:55,923 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:55,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:55,923 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:53:55,923 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:53:55,923 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:53:55,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:55,923 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:53:55,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:53:55,933 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:53:55,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:55,977 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:53:55,985 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:55,985 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:53:58,601 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:58,619 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:53:58,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2019-02-18 09:53:58,620 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:53:58,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-02-18 09:53:58,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-02-18 09:53:58,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-02-18 09:53:58,621 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2019-02-18 09:53:58,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:53:58,711 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-02-18 09:53:58,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-02-18 09:53:58,711 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2019-02-18 09:53:58,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:53:58,712 INFO L225 Difference]: With dead ends: 53 [2019-02-18 09:53:58,712 INFO L226 Difference]: Without dead ends: 51 [2019-02-18 09:53:58,713 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 50 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-02-18 09:53:58,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-02-18 09:53:58,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-02-18 09:53:58,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-02-18 09:53:58,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-02-18 09:53:58,715 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2019-02-18 09:53:58,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:53:58,715 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-02-18 09:53:58,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-02-18 09:53:58,715 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-02-18 09:53:58,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-02-18 09:53:58,715 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:53:58,715 INFO L402 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2019-02-18 09:53:58,716 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:53:58,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:58,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1786247028, now seen corresponding path program 47 times [2019-02-18 09:53:58,716 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:53:58,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:58,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:53:58,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:58,717 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:53:58,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:59,768 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:59,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:59,769 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:53:59,769 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:53:59,769 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:53:59,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:59,769 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:53:59,778 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:53:59,778 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:53:59,962 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2019-02-18 09:53:59,962 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:53:59,966 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:53:59,973 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:59,974 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:54:02,651 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:54:02,672 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:54:02,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2019-02-18 09:54:02,672 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:54:02,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-02-18 09:54:02,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-02-18 09:54:02,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-02-18 09:54:02,673 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2019-02-18 09:54:02,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:54:02,738 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-02-18 09:54:02,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-02-18 09:54:02,739 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2019-02-18 09:54:02,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:54:02,739 INFO L225 Difference]: With dead ends: 54 [2019-02-18 09:54:02,740 INFO L226 Difference]: Without dead ends: 52 [2019-02-18 09:54:02,740 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-02-18 09:54:02,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-02-18 09:54:02,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-02-18 09:54:02,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-02-18 09:54:02,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-02-18 09:54:02,743 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2019-02-18 09:54:02,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:54:02,743 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-02-18 09:54:02,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-02-18 09:54:02,743 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-02-18 09:54:02,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-02-18 09:54:02,744 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:54:02,744 INFO L402 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2019-02-18 09:54:02,744 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:54:02,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:54:02,744 INFO L82 PathProgramCache]: Analyzing trace with hash 460918787, now seen corresponding path program 48 times [2019-02-18 09:54:02,745 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:54:02,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:54:02,745 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:54:02,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:54:02,746 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:54:02,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:54:04,170 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:54:04,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:54:04,170 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:54:04,171 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:54:04,171 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:54:04,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:54:04,171 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:54:04,180 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:54:04,181 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:54:04,228 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:54:04,228 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:54:04,231 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:54:04,239 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:54:04,239 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:54:06,745 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:54:06,774 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:54:06,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 99 [2019-02-18 09:54:06,775 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:54:06,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-02-18 09:54:06,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-02-18 09:54:06,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-02-18 09:54:06,777 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2019-02-18 09:54:06,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:54:06,946 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-02-18 09:54:06,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-02-18 09:54:06,947 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2019-02-18 09:54:06,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:54:06,948 INFO L225 Difference]: With dead ends: 55 [2019-02-18 09:54:06,948 INFO L226 Difference]: Without dead ends: 53 [2019-02-18 09:54:06,949 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-02-18 09:54:06,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-02-18 09:54:06,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-02-18 09:54:06,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-02-18 09:54:06,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-02-18 09:54:06,952 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2019-02-18 09:54:06,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:54:06,952 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-02-18 09:54:06,952 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-02-18 09:54:06,952 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-02-18 09:54:06,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-02-18 09:54:06,952 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:54:06,952 INFO L402 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2019-02-18 09:54:06,953 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:54:06,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:54:06,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1403582316, now seen corresponding path program 49 times [2019-02-18 09:54:06,953 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:54:06,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:54:06,954 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:54:06,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:54:06,954 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:54:06,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:54:08,024 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:54:08,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:54:08,024 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:54:08,025 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:54:08,025 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:54:08,025 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:54:08,025 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:54:08,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:54:08,035 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:54:08,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:54:08,082 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:54:08,090 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:54:08,090 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:54:10,914 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:54:10,932 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:54:10,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 101 [2019-02-18 09:54:10,933 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:54:10,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-02-18 09:54:10,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-02-18 09:54:10,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-02-18 09:54:10,934 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2019-02-18 09:54:10,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:54:10,997 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-02-18 09:54:10,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-02-18 09:54:10,997 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2019-02-18 09:54:10,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:54:10,998 INFO L225 Difference]: With dead ends: 56 [2019-02-18 09:54:10,998 INFO L226 Difference]: Without dead ends: 54 [2019-02-18 09:54:10,999 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 53 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-02-18 09:54:10,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-02-18 09:54:11,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-02-18 09:54:11,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-02-18 09:54:11,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-02-18 09:54:11,002 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2019-02-18 09:54:11,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:54:11,002 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-02-18 09:54:11,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-02-18 09:54:11,002 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-02-18 09:54:11,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-02-18 09:54:11,003 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:54:11,003 INFO L402 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2019-02-18 09:54:11,003 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:54:11,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:54:11,003 INFO L82 PathProgramCache]: Analyzing trace with hash 561380643, now seen corresponding path program 50 times [2019-02-18 09:54:11,003 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:54:11,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:54:11,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:54:11,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:54:11,005 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:54:11,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:54:12,042 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:54:12,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:54:12,042 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:54:12,043 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:54:12,043 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:54:12,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:54:12,043 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:54:12,054 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:54:12,054 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:54:12,271 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2019-02-18 09:54:12,272 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:54:12,276 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:54:12,288 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:54:12,288 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:54:15,430 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:54:15,459 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:54:15,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 103 [2019-02-18 09:54:15,459 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:54:15,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-02-18 09:54:15,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-02-18 09:54:15,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-02-18 09:54:15,461 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 53 states. [2019-02-18 09:54:15,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:54:15,616 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-02-18 09:54:15,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-02-18 09:54:15,617 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2019-02-18 09:54:15,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:54:15,617 INFO L225 Difference]: With dead ends: 57 [2019-02-18 09:54:15,617 INFO L226 Difference]: Without dead ends: 55 [2019-02-18 09:54:15,618 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-02-18 09:54:15,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-02-18 09:54:15,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-02-18 09:54:15,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-02-18 09:54:15,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-02-18 09:54:15,620 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2019-02-18 09:54:15,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:54:15,620 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-02-18 09:54:15,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-02-18 09:54:15,621 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-02-18 09:54:15,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-02-18 09:54:15,621 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:54:15,621 INFO L402 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2019-02-18 09:54:15,621 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:54:15,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:54:15,622 INFO L82 PathProgramCache]: Analyzing trace with hash 222932556, now seen corresponding path program 51 times [2019-02-18 09:54:15,622 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:54:15,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:54:15,622 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:54:15,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:54:15,623 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:54:15,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:54:16,701 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:54:16,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:54:16,702 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:54:16,702 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:54:16,702 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:54:16,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:54:16,702 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:54:16,710 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:54:16,711 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:54:16,760 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:54:16,760 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:54:16,763 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:54:16,770 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:54:16,771 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:54:19,818 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:54:19,837 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:54:19,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 105 [2019-02-18 09:54:19,837 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:54:19,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-02-18 09:54:19,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-02-18 09:54:19,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-02-18 09:54:19,839 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 54 states. [2019-02-18 09:54:19,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:54:19,936 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-02-18 09:54:19,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-02-18 09:54:19,937 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2019-02-18 09:54:19,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:54:19,937 INFO L225 Difference]: With dead ends: 58 [2019-02-18 09:54:19,937 INFO L226 Difference]: Without dead ends: 56 [2019-02-18 09:54:19,938 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-02-18 09:54:19,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-02-18 09:54:19,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-02-18 09:54:19,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-02-18 09:54:19,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-02-18 09:54:19,940 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2019-02-18 09:54:19,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:54:19,940 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-02-18 09:54:19,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-02-18 09:54:19,941 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-02-18 09:54:19,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-02-18 09:54:19,941 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:54:19,942 INFO L402 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2019-02-18 09:54:19,942 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:54:19,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:54:19,942 INFO L82 PathProgramCache]: Analyzing trace with hash -1679023549, now seen corresponding path program 52 times [2019-02-18 09:54:19,942 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:54:19,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:54:19,943 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:54:19,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:54:19,943 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:54:19,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:54:21,024 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:54:21,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:54:21,024 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:54:21,024 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:54:21,025 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:54:21,025 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:54:21,025 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:54:21,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:54:21,034 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:54:21,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:54:21,085 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:54:21,095 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:54:21,095 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:54:24,267 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:54:24,285 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:54:24,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 107 [2019-02-18 09:54:24,285 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:54:24,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-02-18 09:54:24,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-02-18 09:54:24,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-02-18 09:54:24,287 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 55 states. [2019-02-18 09:54:24,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:54:24,385 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-02-18 09:54:24,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-02-18 09:54:24,386 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2019-02-18 09:54:24,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:54:24,387 INFO L225 Difference]: With dead ends: 59 [2019-02-18 09:54:24,387 INFO L226 Difference]: Without dead ends: 57 [2019-02-18 09:54:24,388 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-02-18 09:54:24,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-02-18 09:54:24,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-02-18 09:54:24,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-02-18 09:54:24,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-02-18 09:54:24,391 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2019-02-18 09:54:24,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:54:24,391 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-02-18 09:54:24,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-02-18 09:54:24,391 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-02-18 09:54:24,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-02-18 09:54:24,392 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:54:24,392 INFO L402 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2019-02-18 09:54:24,392 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:54:24,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:54:24,393 INFO L82 PathProgramCache]: Analyzing trace with hash -510120660, now seen corresponding path program 53 times [2019-02-18 09:54:24,393 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:54:24,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:54:24,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:54:24,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:54:24,394 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:54:24,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:54:25,514 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:54:25,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:54:25,515 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:54:25,515 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:54:25,515 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:54:25,515 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:54:25,515 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:54:25,525 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:54:25,525 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:54:25,788 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2019-02-18 09:54:25,788 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:54:25,793 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:54:25,802 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:54:25,802 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:54:28,832 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:54:28,852 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:54:28,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 109 [2019-02-18 09:54:28,852 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:54:28,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-02-18 09:54:28,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-02-18 09:54:28,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-02-18 09:54:28,854 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 56 states. [2019-02-18 09:54:28,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:54:28,945 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-02-18 09:54:28,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-02-18 09:54:28,946 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2019-02-18 09:54:28,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:54:28,946 INFO L225 Difference]: With dead ends: 60 [2019-02-18 09:54:28,947 INFO L226 Difference]: Without dead ends: 58 [2019-02-18 09:54:28,947 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-02-18 09:54:28,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-02-18 09:54:28,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-02-18 09:54:28,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-02-18 09:54:28,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-02-18 09:54:28,949 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2019-02-18 09:54:28,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:54:28,949 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-02-18 09:54:28,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-02-18 09:54:28,950 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-02-18 09:54:28,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-02-18 09:54:28,950 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:54:28,950 INFO L402 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2019-02-18 09:54:28,950 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:54:28,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:54:28,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1366130531, now seen corresponding path program 54 times [2019-02-18 09:54:28,950 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:54:28,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:54:28,951 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:54:28,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:54:28,951 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:54:28,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:54:30,285 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:54:30,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:54:30,286 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:54:30,286 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:54:30,286 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:54:30,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:54:30,286 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:54:30,301 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:54:30,301 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:54:30,350 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:54:30,350 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:54:30,353 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:54:30,363 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:54:30,363 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:54:33,450 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:54:33,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:54:33,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 111 [2019-02-18 09:54:33,470 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:54:33,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-02-18 09:54:33,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-02-18 09:54:33,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-02-18 09:54:33,472 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 57 states. [2019-02-18 09:54:33,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:54:33,564 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-02-18 09:54:33,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-02-18 09:54:33,564 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2019-02-18 09:54:33,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:54:33,565 INFO L225 Difference]: With dead ends: 61 [2019-02-18 09:54:33,565 INFO L226 Difference]: Without dead ends: 59 [2019-02-18 09:54:33,566 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-02-18 09:54:33,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-02-18 09:54:33,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-02-18 09:54:33,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-02-18 09:54:33,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-02-18 09:54:33,567 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2019-02-18 09:54:33,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:54:33,568 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-02-18 09:54:33,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-02-18 09:54:33,568 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-02-18 09:54:33,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-02-18 09:54:33,568 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:54:33,568 INFO L402 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2019-02-18 09:54:33,568 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:54:33,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:54:33,569 INFO L82 PathProgramCache]: Analyzing trace with hash -599624692, now seen corresponding path program 55 times [2019-02-18 09:54:33,569 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:54:33,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:54:33,570 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:54:33,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:54:33,570 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:54:33,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:54:35,518 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:54:35,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:54:35,519 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:54:35,519 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:54:35,519 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:54:35,519 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:54:35,519 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:54:35,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:54:35,528 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:54:35,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:54:35,581 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:54:35,591 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:54:35,591 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:54:38,787 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:54:38,807 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:54:38,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 113 [2019-02-18 09:54:38,807 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:54:38,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-02-18 09:54:38,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-02-18 09:54:38,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-02-18 09:54:38,808 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 58 states. [2019-02-18 09:54:38,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:54:38,925 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-02-18 09:54:38,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-02-18 09:54:38,926 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2019-02-18 09:54:38,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:54:38,926 INFO L225 Difference]: With dead ends: 62 [2019-02-18 09:54:38,926 INFO L226 Difference]: Without dead ends: 60 [2019-02-18 09:54:38,927 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-02-18 09:54:38,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-02-18 09:54:38,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-02-18 09:54:38,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-02-18 09:54:38,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-02-18 09:54:38,930 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2019-02-18 09:54:38,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:54:38,930 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-02-18 09:54:38,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-02-18 09:54:38,930 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-02-18 09:54:38,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-02-18 09:54:38,931 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:54:38,931 INFO L402 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2019-02-18 09:54:38,931 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:54:38,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:54:38,931 INFO L82 PathProgramCache]: Analyzing trace with hash -1408494461, now seen corresponding path program 56 times [2019-02-18 09:54:38,931 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:54:38,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:54:38,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:54:38,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:54:38,932 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:54:38,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:54:40,449 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:54:40,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:54:40,449 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:54:40,450 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:54:40,450 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:54:40,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:54:40,450 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:54:40,460 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:54:40,460 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:54:40,743 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2019-02-18 09:54:40,743 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:54:40,747 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:54:40,758 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:54:40,758 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:54:44,125 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:54:44,145 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:54:44,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 115 [2019-02-18 09:54:44,145 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:54:44,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-02-18 09:54:44,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-02-18 09:54:44,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-02-18 09:54:44,146 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2019-02-18 09:54:44,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:54:44,224 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-02-18 09:54:44,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-02-18 09:54:44,224 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2019-02-18 09:54:44,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:54:44,225 INFO L225 Difference]: With dead ends: 63 [2019-02-18 09:54:44,225 INFO L226 Difference]: Without dead ends: 61 [2019-02-18 09:54:44,226 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 60 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-02-18 09:54:44,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-02-18 09:54:44,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-02-18 09:54:44,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-02-18 09:54:44,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-02-18 09:54:44,229 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2019-02-18 09:54:44,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:54:44,229 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-02-18 09:54:44,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-02-18 09:54:44,229 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-02-18 09:54:44,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-02-18 09:54:44,230 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:54:44,230 INFO L402 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2019-02-18 09:54:44,230 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:54:44,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:54:44,231 INFO L82 PathProgramCache]: Analyzing trace with hash -713653524, now seen corresponding path program 57 times [2019-02-18 09:54:44,231 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:54:44,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:54:44,231 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:54:44,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:54:44,231 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:54:44,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:54:45,666 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:54:45,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:54:45,667 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:54:45,667 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:54:45,667 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:54:45,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:54:45,667 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:54:45,675 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:54:45,675 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:54:45,726 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:54:45,726 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:54:45,729 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:54:45,744 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:54:45,744 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:54:49,843 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:54:49,861 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:54:49,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 117 [2019-02-18 09:54:49,862 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:54:49,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-02-18 09:54:49,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-02-18 09:54:49,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-02-18 09:54:49,863 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2019-02-18 09:54:49,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:54:49,970 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-02-18 09:54:49,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-02-18 09:54:49,971 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2019-02-18 09:54:49,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:54:49,971 INFO L225 Difference]: With dead ends: 64 [2019-02-18 09:54:49,971 INFO L226 Difference]: Without dead ends: 62 [2019-02-18 09:54:49,972 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-02-18 09:54:49,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-02-18 09:54:49,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-02-18 09:54:49,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-02-18 09:54:49,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-02-18 09:54:49,974 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2019-02-18 09:54:49,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:54:49,974 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-02-18 09:54:49,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-02-18 09:54:49,974 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-02-18 09:54:49,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-02-18 09:54:49,974 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:54:49,974 INFO L402 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2019-02-18 09:54:49,974 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:54:49,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:54:49,975 INFO L82 PathProgramCache]: Analyzing trace with hash -648420957, now seen corresponding path program 58 times [2019-02-18 09:54:49,975 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:54:49,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:54:49,975 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:54:49,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:54:49,975 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:54:49,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:54:51,649 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:54:51,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:54:51,650 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:54:51,650 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:54:51,650 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:54:51,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:54:51,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 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:54:51,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:54:51,661 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:54:51,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:54:51,718 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:54:51,733 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:54:51,733 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:54:55,683 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:54:55,701 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:54:55,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 119 [2019-02-18 09:54:55,702 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:54:55,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-02-18 09:54:55,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-02-18 09:54:55,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-02-18 09:54:55,703 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 61 states. [2019-02-18 09:54:55,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:54:55,810 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-02-18 09:54:55,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-02-18 09:54:55,811 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2019-02-18 09:54:55,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:54:55,811 INFO L225 Difference]: With dead ends: 65 [2019-02-18 09:54:55,811 INFO L226 Difference]: Without dead ends: 63 [2019-02-18 09:54:55,812 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-02-18 09:54:55,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-02-18 09:54:55,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-02-18 09:54:55,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-02-18 09:54:55,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-02-18 09:54:55,815 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2019-02-18 09:54:55,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:54:55,815 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-02-18 09:54:55,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-02-18 09:54:55,815 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-02-18 09:54:55,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-02-18 09:54:55,815 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:54:55,816 INFO L402 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2019-02-18 09:54:55,816 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:54:55,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:54:55,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1373788620, now seen corresponding path program 59 times [2019-02-18 09:54:55,816 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:54:55,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:54:55,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:54:55,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:54:55,817 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:54:55,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:54:57,223 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:54:57,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:54:57,223 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:54:57,224 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:54:57,224 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:54:57,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:54:57,224 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:54:57,233 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:54:57,233 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:54:57,581 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2019-02-18 09:54:57,581 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:54:57,585 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:54:57,595 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:54:57,595 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:55:01,593 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:55:01,613 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:55:01,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 121 [2019-02-18 09:55:01,614 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:55:01,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-02-18 09:55:01,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-02-18 09:55:01,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2019-02-18 09:55:01,615 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 62 states. [2019-02-18 09:55:01,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:55:01,695 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-02-18 09:55:01,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-02-18 09:55:01,695 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2019-02-18 09:55:01,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:55:01,696 INFO L225 Difference]: With dead ends: 66 [2019-02-18 09:55:01,696 INFO L226 Difference]: Without dead ends: 64 [2019-02-18 09:55:01,697 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 63 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-02-18 09:55:01,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-02-18 09:55:01,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-02-18 09:55:01,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-02-18 09:55:01,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-02-18 09:55:01,700 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2019-02-18 09:55:01,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:55:01,700 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-02-18 09:55:01,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-02-18 09:55:01,700 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-02-18 09:55:01,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-02-18 09:55:01,701 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:55:01,701 INFO L402 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2019-02-18 09:55:01,701 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:55:01,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:55:01,701 INFO L82 PathProgramCache]: Analyzing trace with hash -362223933, now seen corresponding path program 60 times [2019-02-18 09:55:01,701 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:55:01,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:55:01,702 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:55:01,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:55:01,702 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:55:01,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:55:03,078 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:55:03,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:55:03,079 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:55:03,079 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:55:03,079 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:55:03,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:55:03,079 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:55:03,090 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:55:03,091 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:55:03,146 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:55:03,146 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:55:03,149 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:55:03,159 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:55:03,159 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:55:07,269 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:55:07,288 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:55:07,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 123 [2019-02-18 09:55:07,288 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:55:07,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-02-18 09:55:07,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-02-18 09:55:07,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2019-02-18 09:55:07,290 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 63 states. [2019-02-18 09:55:07,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:55:07,419 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-02-18 09:55:07,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-02-18 09:55:07,420 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2019-02-18 09:55:07,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:55:07,420 INFO L225 Difference]: With dead ends: 67 [2019-02-18 09:55:07,420 INFO L226 Difference]: Without dead ends: 65 [2019-02-18 09:55:07,421 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 64 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-02-18 09:55:07,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-02-18 09:55:07,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-02-18 09:55:07,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-02-18 09:55:07,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-02-18 09:55:07,423 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2019-02-18 09:55:07,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:55:07,423 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-02-18 09:55:07,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-02-18 09:55:07,423 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-02-18 09:55:07,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-02-18 09:55:07,423 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:55:07,423 INFO L402 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2019-02-18 09:55:07,424 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:55:07,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:55:07,424 INFO L82 PathProgramCache]: Analyzing trace with hash 1655961772, now seen corresponding path program 61 times [2019-02-18 09:55:07,424 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:55:07,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:55:07,424 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:55:07,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:55:07,425 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:55:07,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:55:08,856 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:55:08,856 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:55:08,856 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:55:08,856 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:55:08,856 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:55:08,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:55:08,857 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:55:08,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:55:08,867 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:55:08,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:55:08,926 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:55:08,942 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:55:08,942 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:55:13,285 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:55:13,303 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:55:13,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 125 [2019-02-18 09:55:13,304 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:55:13,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-02-18 09:55:13,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-02-18 09:55:13,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2019-02-18 09:55:13,306 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 64 states. [2019-02-18 09:55:13,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:55:13,443 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-02-18 09:55:13,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-02-18 09:55:13,444 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2019-02-18 09:55:13,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:55:13,444 INFO L225 Difference]: With dead ends: 68 [2019-02-18 09:55:13,444 INFO L226 Difference]: Without dead ends: 66 [2019-02-18 09:55:13,445 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2019-02-18 09:55:13,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-02-18 09:55:13,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-02-18 09:55:13,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-02-18 09:55:13,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-02-18 09:55:13,447 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2019-02-18 09:55:13,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:55:13,447 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-02-18 09:55:13,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-02-18 09:55:13,447 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-02-18 09:55:13,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-02-18 09:55:13,447 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:55:13,447 INFO L402 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2019-02-18 09:55:13,447 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:55:13,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:55:13,448 INFO L82 PathProgramCache]: Analyzing trace with hash -204790813, now seen corresponding path program 62 times [2019-02-18 09:55:13,448 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:55:13,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:55:13,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:55:13,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:55:13,449 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:55:13,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:55:14,943 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:55:14,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:55:14,943 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:55:14,943 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:55:14,943 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:55:14,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:55:14,943 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:55:14,952 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:55:14,953 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:55:15,346 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2019-02-18 09:55:15,346 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:55:15,351 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:55:15,361 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:55:15,361 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:55:19,483 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:55:19,504 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:55:19,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 127 [2019-02-18 09:55:19,504 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:55:19,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-02-18 09:55:19,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-02-18 09:55:19,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2019-02-18 09:55:19,506 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 65 states. [2019-02-18 09:55:19,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:55:19,623 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-02-18 09:55:19,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-02-18 09:55:19,624 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2019-02-18 09:55:19,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:55:19,624 INFO L225 Difference]: With dead ends: 69 [2019-02-18 09:55:19,624 INFO L226 Difference]: Without dead ends: 67 [2019-02-18 09:55:19,625 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2019-02-18 09:55:19,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-02-18 09:55:19,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-02-18 09:55:19,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-02-18 09:55:19,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-02-18 09:55:19,628 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2019-02-18 09:55:19,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:55:19,628 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-02-18 09:55:19,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-02-18 09:55:19,629 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-02-18 09:55:19,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-02-18 09:55:19,629 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:55:19,629 INFO L402 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2019-02-18 09:55:19,629 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:55:19,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:55:19,630 INFO L82 PathProgramCache]: Analyzing trace with hash -2053546100, now seen corresponding path program 63 times [2019-02-18 09:55:19,630 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:55:19,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:55:19,631 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:55:19,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:55:19,631 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:55:19,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:55:21,471 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:55:21,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:55:21,472 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:55:21,472 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:55:21,472 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:55:21,472 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:55:21,472 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:55:21,483 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:55:21,483 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:55:21,563 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:55:21,563 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:55:21,567 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:55:21,580 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:55:21,580 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:55:26,067 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:55:26,086 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:55:26,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 129 [2019-02-18 09:55:26,086 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:55:26,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-02-18 09:55:26,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-02-18 09:55:26,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2019-02-18 09:55:26,088 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 66 states. [2019-02-18 09:55:26,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:55:26,207 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-02-18 09:55:26,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-02-18 09:55:26,209 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2019-02-18 09:55:26,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:55:26,210 INFO L225 Difference]: With dead ends: 70 [2019-02-18 09:55:26,210 INFO L226 Difference]: Without dead ends: 68 [2019-02-18 09:55:26,211 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2019-02-18 09:55:26,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-02-18 09:55:26,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-02-18 09:55:26,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-02-18 09:55:26,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-02-18 09:55:26,215 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2019-02-18 09:55:26,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:55:26,215 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-02-18 09:55:26,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-02-18 09:55:26,215 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-02-18 09:55:26,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-02-18 09:55:26,216 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:55:26,216 INFO L402 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2019-02-18 09:55:26,216 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:55:26,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:55:26,217 INFO L82 PathProgramCache]: Analyzing trace with hash 764582147, now seen corresponding path program 64 times [2019-02-18 09:55:26,217 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:55:26,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:55:26,218 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:55:26,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:55:26,218 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:55:26,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:55:27,778 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:55:27,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:55:27,778 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:55:27,778 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:55:27,779 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:55:27,779 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:55:27,779 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:55:27,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:55:27,789 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:55:27,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:55:27,848 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:55:27,862 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:55:27,862 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:55:32,564 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:55:32,583 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:55:32,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 131 [2019-02-18 09:55:32,584 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:55:32,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-02-18 09:55:32,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-02-18 09:55:32,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2019-02-18 09:55:32,585 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2019-02-18 09:55:32,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:55:32,682 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-02-18 09:55:32,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-02-18 09:55:32,682 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2019-02-18 09:55:32,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:55:32,683 INFO L225 Difference]: With dead ends: 71 [2019-02-18 09:55:32,683 INFO L226 Difference]: Without dead ends: 69 [2019-02-18 09:55:32,684 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2019-02-18 09:55:32,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-02-18 09:55:32,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-02-18 09:55:32,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-02-18 09:55:32,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-02-18 09:55:32,688 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2019-02-18 09:55:32,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:55:32,688 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-02-18 09:55:32,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-02-18 09:55:32,688 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-02-18 09:55:32,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-02-18 09:55:32,688 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:55:32,688 INFO L402 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2019-02-18 09:55:32,689 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:55:32,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:55:32,689 INFO L82 PathProgramCache]: Analyzing trace with hash -2067755412, now seen corresponding path program 65 times [2019-02-18 09:55:32,689 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:55:32,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:55:32,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:55:32,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:55:32,690 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:55:32,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:55:34,967 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:55:34,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:55:34,967 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:55:34,967 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:55:34,967 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:55:34,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:55:34,968 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:55:34,976 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:55:34,976 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:55:35,434 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2019-02-18 09:55:35,434 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:55:35,439 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:55:35,449 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:55:35,450 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:55:40,120 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:55:40,142 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:55:40,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 133 [2019-02-18 09:55:40,142 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:55:40,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-02-18 09:55:40,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-02-18 09:55:40,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2019-02-18 09:55:40,144 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 68 states. [2019-02-18 09:55:40,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:55:40,267 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-02-18 09:55:40,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-02-18 09:55:40,267 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2019-02-18 09:55:40,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:55:40,268 INFO L225 Difference]: With dead ends: 72 [2019-02-18 09:55:40,268 INFO L226 Difference]: Without dead ends: 70 [2019-02-18 09:55:40,269 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2019-02-18 09:55:40,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-02-18 09:55:40,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-02-18 09:55:40,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-02-18 09:55:40,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-02-18 09:55:40,272 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2019-02-18 09:55:40,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:55:40,272 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-02-18 09:55:40,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-02-18 09:55:40,273 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-02-18 09:55:40,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-02-18 09:55:40,273 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:55:40,273 INFO L402 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2019-02-18 09:55:40,273 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:55:40,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:55:40,274 INFO L82 PathProgramCache]: Analyzing trace with hash 324093475, now seen corresponding path program 66 times [2019-02-18 09:55:40,274 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:55:40,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:55:40,275 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:55:40,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:55:40,275 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:55:40,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:55:42,229 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:55:42,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:55:42,230 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:55:42,230 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:55:42,230 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:55:42,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:55:42,230 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:55:42,242 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:55:42,242 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:55:42,300 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:55:42,300 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:55:42,304 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:55:42,318 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:55:42,319 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:55:48,554 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:55:48,572 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:55:48,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 135 [2019-02-18 09:55:48,573 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:55:48,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-02-18 09:55:48,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-02-18 09:55:48,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2019-02-18 09:55:48,574 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 69 states. [2019-02-18 09:55:48,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:55:48,931 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-02-18 09:55:48,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-02-18 09:55:48,931 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2019-02-18 09:55:48,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:55:48,932 INFO L225 Difference]: With dead ends: 73 [2019-02-18 09:55:48,932 INFO L226 Difference]: Without dead ends: 71 [2019-02-18 09:55:48,932 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2019-02-18 09:55:48,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-02-18 09:55:48,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-02-18 09:55:48,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-02-18 09:55:48,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-02-18 09:55:48,935 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2019-02-18 09:55:48,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:55:48,935 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-02-18 09:55:48,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-02-18 09:55:48,936 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-02-18 09:55:48,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-02-18 09:55:48,936 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:55:48,936 INFO L402 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2019-02-18 09:55:48,936 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:55:48,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:55:48,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1456964940, now seen corresponding path program 67 times [2019-02-18 09:55:48,937 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:55:48,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:55:48,937 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:55:48,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:55:48,938 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:55:48,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:55:50,702 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:55:50,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:55:50,702 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:55:50,702 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:55:50,703 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:55:50,703 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:55:50,703 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:55:50,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:55:50,711 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:55:50,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:55:50,773 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:55:50,790 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:55:50,790 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:55:55,836 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:55:55,855 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:55:55,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 137 [2019-02-18 09:55:55,856 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:55:55,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-02-18 09:55:55,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-02-18 09:55:55,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2019-02-18 09:55:55,858 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 70 states. [2019-02-18 09:55:55,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:55:55,967 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-02-18 09:55:55,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-02-18 09:55:55,968 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2019-02-18 09:55:55,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:55:55,968 INFO L225 Difference]: With dead ends: 74 [2019-02-18 09:55:55,968 INFO L226 Difference]: Without dead ends: 72 [2019-02-18 09:55:55,969 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2019-02-18 09:55:55,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-02-18 09:55:55,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-02-18 09:55:55,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-02-18 09:55:55,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-02-18 09:55:55,972 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2019-02-18 09:55:55,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:55:55,973 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-02-18 09:55:55,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-02-18 09:55:55,973 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-02-18 09:55:55,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-02-18 09:55:55,973 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:55:55,973 INFO L402 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2019-02-18 09:55:55,974 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:55:55,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:55:55,974 INFO L82 PathProgramCache]: Analyzing trace with hash -2078725309, now seen corresponding path program 68 times [2019-02-18 09:55:55,974 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:55:55,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:55:55,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:55:55,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:55:55,975 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:55:55,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:55:57,949 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:55:57,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:55:57,950 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:55:57,950 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:55:57,950 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:55:57,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:55:57,950 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:55:57,958 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:55:57,959 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:55:58,480 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2019-02-18 09:55:58,480 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:55:58,485 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:55:58,495 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:55:58,496 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:56:03,810 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:56:03,831 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:56:03,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 139 [2019-02-18 09:56:03,832 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:56:03,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-02-18 09:56:03,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-02-18 09:56:03,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2019-02-18 09:56:03,833 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 71 states. [2019-02-18 09:56:04,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:56:04,036 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-02-18 09:56:04,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-02-18 09:56:04,037 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2019-02-18 09:56:04,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:56:04,037 INFO L225 Difference]: With dead ends: 75 [2019-02-18 09:56:04,037 INFO L226 Difference]: Without dead ends: 73 [2019-02-18 09:56:04,038 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2019-02-18 09:56:04,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-02-18 09:56:04,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-02-18 09:56:04,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-02-18 09:56:04,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-02-18 09:56:04,040 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2019-02-18 09:56:04,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:56:04,040 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-02-18 09:56:04,040 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-02-18 09:56:04,040 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-02-18 09:56:04,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-02-18 09:56:04,040 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:56:04,041 INFO L402 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2019-02-18 09:56:04,041 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:56:04,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:56:04,041 INFO L82 PathProgramCache]: Analyzing trace with hash -15973332, now seen corresponding path program 69 times [2019-02-18 09:56:04,041 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:56:04,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:56:04,042 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:56:04,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:56:04,042 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:56:04,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:56:05,846 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:56:05,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:56:05,846 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:56:05,846 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:56:05,847 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:56:05,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:56:05,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 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:56:05,855 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:56:05,855 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:56:05,917 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:56:05,918 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:56:05,920 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:56:05,931 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:56:05,931 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:56:11,449 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:56:11,467 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:56:11,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 141 [2019-02-18 09:56:11,467 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:56:11,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-02-18 09:56:11,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-02-18 09:56:11,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2019-02-18 09:56:11,469 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 72 states. [2019-02-18 09:56:11,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:56:11,697 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-02-18 09:56:11,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-02-18 09:56:11,697 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2019-02-18 09:56:11,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:56:11,698 INFO L225 Difference]: With dead ends: 76 [2019-02-18 09:56:11,698 INFO L226 Difference]: Without dead ends: 74 [2019-02-18 09:56:11,699 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2019-02-18 09:56:11,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-02-18 09:56:11,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-02-18 09:56:11,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-02-18 09:56:11,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-02-18 09:56:11,702 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2019-02-18 09:56:11,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:56:11,702 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-02-18 09:56:11,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-02-18 09:56:11,702 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-02-18 09:56:11,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-02-18 09:56:11,703 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:56:11,703 INFO L402 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2019-02-18 09:56:11,703 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:56:11,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:56:11,704 INFO L82 PathProgramCache]: Analyzing trace with hash -495171485, now seen corresponding path program 70 times [2019-02-18 09:56:11,704 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:56:11,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:56:11,704 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:56:11,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:56:11,705 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:56:11,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:56:13,878 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:56:13,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:56:13,879 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:56:13,879 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:56:13,879 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:56:13,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:56:13,879 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:56:13,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:56:13,887 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:56:13,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:56:13,950 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:56:13,961 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:56:13,961 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:56:19,498 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:56:19,518 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:56:19,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 143 [2019-02-18 09:56:19,518 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:56:19,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-02-18 09:56:19,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-02-18 09:56:19,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2019-02-18 09:56:19,520 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 73 states. [2019-02-18 09:56:19,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:56:19,686 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-02-18 09:56:19,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-02-18 09:56:19,686 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2019-02-18 09:56:19,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:56:19,687 INFO L225 Difference]: With dead ends: 77 [2019-02-18 09:56:19,687 INFO L226 Difference]: Without dead ends: 75 [2019-02-18 09:56:19,687 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2019-02-18 09:56:19,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-02-18 09:56:19,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-02-18 09:56:19,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-02-18 09:56:19,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-02-18 09:56:19,691 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2019-02-18 09:56:19,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:56:19,692 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-02-18 09:56:19,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-02-18 09:56:19,692 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-02-18 09:56:19,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-02-18 09:56:19,692 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:56:19,693 INFO L402 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2019-02-18 09:56:19,693 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:56:19,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:56:19,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1829554956, now seen corresponding path program 71 times [2019-02-18 09:56:19,693 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:56:19,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:56:19,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:56:19,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:56:19,694 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:56:19,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:56:22,100 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:56:22,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:56:22,100 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:56:22,100 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:56:22,100 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:56:22,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:56:22,100 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:56:22,108 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:56:22,108 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:56:22,755 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 37 check-sat command(s) [2019-02-18 09:56:22,755 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:56:22,762 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:56:22,779 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:56:22,779 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:56:28,313 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:56:28,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:56:28,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 145 [2019-02-18 09:56:28,334 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:56:28,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-02-18 09:56:28,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-02-18 09:56:28,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2019-02-18 09:56:28,336 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 74 states. [2019-02-18 09:56:28,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:56:28,489 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-02-18 09:56:28,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-02-18 09:56:28,489 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2019-02-18 09:56:28,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:56:28,490 INFO L225 Difference]: With dead ends: 78 [2019-02-18 09:56:28,490 INFO L226 Difference]: Without dead ends: 76 [2019-02-18 09:56:28,491 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2019-02-18 09:56:28,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-02-18 09:56:28,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-02-18 09:56:28,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-02-18 09:56:28,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-02-18 09:56:28,494 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2019-02-18 09:56:28,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:56:28,494 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-02-18 09:56:28,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-02-18 09:56:28,494 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-02-18 09:56:28,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-02-18 09:56:28,495 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:56:28,495 INFO L402 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2019-02-18 09:56:28,495 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:56:28,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:56:28,495 INFO L82 PathProgramCache]: Analyzing trace with hash 881630595, now seen corresponding path program 72 times [2019-02-18 09:56:28,496 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:56:28,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:56:28,496 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:56:28,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:56:28,496 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:56:28,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:56:30,429 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:56:30,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:56:30,430 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:56:30,430 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:56:30,430 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:56:30,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:56:30,430 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:56:30,446 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:56:30,447 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:56:30,512 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:56:30,512 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:56:30,515 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:56:30,535 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:56:30,535 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:56:36,404 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:56:36,422 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:56:36,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 147 [2019-02-18 09:56:36,422 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:56:36,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-02-18 09:56:36,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-02-18 09:56:36,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2019-02-18 09:56:36,424 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 75 states. [2019-02-18 09:56:36,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:56:36,576 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-02-18 09:56:36,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-02-18 09:56:36,577 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2019-02-18 09:56:36,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:56:36,577 INFO L225 Difference]: With dead ends: 79 [2019-02-18 09:56:36,578 INFO L226 Difference]: Without dead ends: 77 [2019-02-18 09:56:36,578 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2019-02-18 09:56:36,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-02-18 09:56:36,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-02-18 09:56:36,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-02-18 09:56:36,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-02-18 09:56:36,581 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2019-02-18 09:56:36,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:56:36,581 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-02-18 09:56:36,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-02-18 09:56:36,581 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-02-18 09:56:36,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-02-18 09:56:36,582 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:56:36,582 INFO L402 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2019-02-18 09:56:36,582 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:56:36,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:56:36,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1560746476, now seen corresponding path program 73 times [2019-02-18 09:56:36,583 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:56:36,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:56:36,583 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:56:36,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:56:36,583 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:56:36,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:56:38,882 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:56:38,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:56:38,882 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:56:38,882 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:56:38,883 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:56:38,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:56:38,883 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:56:38,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:56:38,892 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:56:38,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:56:38,961 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:56:38,978 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:56:38,978 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:56:44,804 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:56:44,822 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:56:44,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 149 [2019-02-18 09:56:44,823 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:56:44,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-02-18 09:56:44,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-02-18 09:56:44,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2019-02-18 09:56:44,824 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 76 states. [2019-02-18 09:56:44,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:56:44,980 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-02-18 09:56:44,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-02-18 09:56:44,980 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2019-02-18 09:56:44,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:56:44,980 INFO L225 Difference]: With dead ends: 80 [2019-02-18 09:56:44,981 INFO L226 Difference]: Without dead ends: 78 [2019-02-18 09:56:44,981 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 77 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-02-18 09:56:44,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-02-18 09:56:44,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-02-18 09:56:44,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-02-18 09:56:44,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-02-18 09:56:44,984 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2019-02-18 09:56:44,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:56:44,984 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-02-18 09:56:44,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-02-18 09:56:44,984 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-02-18 09:56:44,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-02-18 09:56:44,985 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:56:44,985 INFO L402 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2019-02-18 09:56:44,985 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:56:44,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:56:44,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1138502307, now seen corresponding path program 74 times [2019-02-18 09:56:44,985 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:56:44,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:56:44,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:56:44,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:56:44,986 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:56:45,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:56:46,979 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:56:46,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:56:46,980 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:56:46,980 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:56:46,980 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:56:46,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:56:46,980 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:56:46,988 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:56:46,989 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:56:47,671 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2019-02-18 09:56:47,671 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:56:47,676 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:56:47,688 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:56:47,689 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:56:53,775 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:56:53,796 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:56:53,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 151 [2019-02-18 09:56:53,796 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:56:53,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-02-18 09:56:53,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-02-18 09:56:53,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2019-02-18 09:56:53,798 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 77 states. [2019-02-18 09:56:53,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:56:53,928 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-02-18 09:56:53,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-02-18 09:56:53,929 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2019-02-18 09:56:53,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:56:53,930 INFO L225 Difference]: With dead ends: 81 [2019-02-18 09:56:53,930 INFO L226 Difference]: Without dead ends: 79 [2019-02-18 09:56:53,931 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2019-02-18 09:56:53,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-02-18 09:56:53,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-02-18 09:56:53,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-02-18 09:56:53,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-02-18 09:56:53,934 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2019-02-18 09:56:53,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:56:53,934 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-02-18 09:56:53,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-02-18 09:56:53,934 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-02-18 09:56:53,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-02-18 09:56:53,935 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:56:53,935 INFO L402 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2019-02-18 09:56:53,935 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:56:53,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:56:53,936 INFO L82 PathProgramCache]: Analyzing trace with hash 933834956, now seen corresponding path program 75 times [2019-02-18 09:56:53,936 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:56:53,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:56:53,937 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:56:53,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:56:53,937 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:56:53,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:56:56,068 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:56:56,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:56:56,068 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:56:56,069 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:56:56,069 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:56:56,069 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:56:56,069 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:56:56,078 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:56:56,078 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:56:56,147 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:56:56,147 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:56:56,150 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:56:56,169 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:56:56,169 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:57:02,383 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:02,402 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:57:02,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 153 [2019-02-18 09:57:02,402 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:57:02,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-02-18 09:57:02,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-02-18 09:57:02,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2019-02-18 09:57:02,404 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 78 states. [2019-02-18 09:57:02,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:57:02,552 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-02-18 09:57:02,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-02-18 09:57:02,552 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2019-02-18 09:57:02,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:57:02,553 INFO L225 Difference]: With dead ends: 82 [2019-02-18 09:57:02,553 INFO L226 Difference]: Without dead ends: 80 [2019-02-18 09:57:02,554 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2019-02-18 09:57:02,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-02-18 09:57:02,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-02-18 09:57:02,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-02-18 09:57:02,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-02-18 09:57:02,558 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2019-02-18 09:57:02,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:57:02,558 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-02-18 09:57:02,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-02-18 09:57:02,559 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-02-18 09:57:02,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-02-18 09:57:02,571 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:57:02,571 INFO L402 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2019-02-18 09:57:02,571 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:57:02,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:57:02,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1115885629, now seen corresponding path program 76 times [2019-02-18 09:57:02,572 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:57:02,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:02,572 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:57:02,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:02,573 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:57:02,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:57:04,820 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:04,821 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:04,821 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:57:04,821 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:57:04,821 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:57:04,821 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:04,821 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:57:04,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:57:04,829 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:57:04,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:57:04,897 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:57:04,910 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:04,910 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:57:11,280 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:11,299 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:57:11,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 155 [2019-02-18 09:57:11,299 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:57:11,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-02-18 09:57:11,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-02-18 09:57:11,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2019-02-18 09:57:11,301 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 79 states. [2019-02-18 09:57:12,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:57:12,158 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-02-18 09:57:12,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-02-18 09:57:12,159 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 79 [2019-02-18 09:57:12,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:57:12,159 INFO L225 Difference]: With dead ends: 83 [2019-02-18 09:57:12,159 INFO L226 Difference]: Without dead ends: 81 [2019-02-18 09:57:12,160 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2019-02-18 09:57:12,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-02-18 09:57:12,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-02-18 09:57:12,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-02-18 09:57:12,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-02-18 09:57:12,162 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2019-02-18 09:57:12,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:57:12,162 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-02-18 09:57:12,162 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-02-18 09:57:12,162 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-02-18 09:57:12,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-02-18 09:57:12,163 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:57:12,163 INFO L402 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2019-02-18 09:57:12,163 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:57:12,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:57:12,163 INFO L82 PathProgramCache]: Analyzing trace with hash -232714324, now seen corresponding path program 77 times [2019-02-18 09:57:12,163 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:57:12,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:12,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:57:12,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:12,164 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:57:12,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:57:14,665 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:14,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:14,665 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:57:14,665 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:57:14,665 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:57:14,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:14,665 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:57:14,673 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:57:14,674 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:57:15,492 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2019-02-18 09:57:15,493 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:57:15,499 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:57:15,511 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:15,511 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:57:22,093 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:22,114 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:57:22,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 157 [2019-02-18 09:57:22,115 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:57:22,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-02-18 09:57:22,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-02-18 09:57:22,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2019-02-18 09:57:22,116 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 80 states. [2019-02-18 09:57:22,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:57:22,777 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-02-18 09:57:22,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-02-18 09:57:22,777 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 80 [2019-02-18 09:57:22,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:57:22,778 INFO L225 Difference]: With dead ends: 84 [2019-02-18 09:57:22,778 INFO L226 Difference]: Without dead ends: 82 [2019-02-18 09:57:22,779 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2019-02-18 09:57:22,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-02-18 09:57:22,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-02-18 09:57:22,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-02-18 09:57:22,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-02-18 09:57:22,782 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2019-02-18 09:57:22,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:57:22,782 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-02-18 09:57:22,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-02-18 09:57:22,782 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-02-18 09:57:22,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-02-18 09:57:22,783 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:57:22,783 INFO L402 BasicCegarLoop]: trace histogram [78, 1, 1, 1] [2019-02-18 09:57:22,783 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:57:22,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:57:22,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1375792355, now seen corresponding path program 78 times [2019-02-18 09:57:22,784 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:57:22,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:22,784 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:57:22,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:22,785 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:57:22,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:57:25,261 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:25,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:25,262 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:57:25,262 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:57:25,262 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:57:25,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:25,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 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:57:25,271 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:57:25,272 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:57:25,351 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:57:25,351 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:57:25,356 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:57:25,378 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:25,379 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:57:32,167 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:32,186 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:57:32,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 159 [2019-02-18 09:57:32,187 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:57:32,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-02-18 09:57:32,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-02-18 09:57:32,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2019-02-18 09:57:32,189 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 81 states. [2019-02-18 09:57:32,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:57:32,335 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2019-02-18 09:57:32,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-02-18 09:57:32,335 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 81 [2019-02-18 09:57:32,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:57:32,336 INFO L225 Difference]: With dead ends: 85 [2019-02-18 09:57:32,336 INFO L226 Difference]: Without dead ends: 83 [2019-02-18 09:57:32,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2019-02-18 09:57:32,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-02-18 09:57:32,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-02-18 09:57:32,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-02-18 09:57:32,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2019-02-18 09:57:32,339 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2019-02-18 09:57:32,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:57:32,339 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2019-02-18 09:57:32,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-02-18 09:57:32,339 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2019-02-18 09:57:32,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-02-18 09:57:32,340 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:57:32,340 INFO L402 BasicCegarLoop]: trace histogram [79, 1, 1, 1] [2019-02-18 09:57:32,340 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:57:32,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:57:32,340 INFO L82 PathProgramCache]: Analyzing trace with hash -300108148, now seen corresponding path program 79 times [2019-02-18 09:57:32,340 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:57:32,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:32,341 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:57:32,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:32,341 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:57:32,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:57:35,067 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:35,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:35,067 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:57:35,067 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:57:35,068 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:57:35,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:35,068 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:57:35,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:57:35,076 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:57:35,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:57:35,149 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:57:35,169 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:35,169 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:57:42,049 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:42,067 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:57:42,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 161 [2019-02-18 09:57:42,068 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:57:42,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-02-18 09:57:42,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-02-18 09:57:42,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2019-02-18 09:57:42,070 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 82 states. [2019-02-18 09:57:42,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:57:42,191 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2019-02-18 09:57:42,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-02-18 09:57:42,192 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 82 [2019-02-18 09:57:42,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:57:42,193 INFO L225 Difference]: With dead ends: 86 [2019-02-18 09:57:42,193 INFO L226 Difference]: Without dead ends: 84 [2019-02-18 09:57:42,194 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2019-02-18 09:57:42,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-02-18 09:57:42,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-02-18 09:57:42,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-02-18 09:57:42,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2019-02-18 09:57:42,197 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2019-02-18 09:57:42,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:57:42,197 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2019-02-18 09:57:42,197 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-02-18 09:57:42,197 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2019-02-18 09:57:42,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-02-18 09:57:42,198 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:57:42,198 INFO L402 BasicCegarLoop]: trace histogram [80, 1, 1, 1] [2019-02-18 09:57:42,198 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:57:42,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:57:42,199 INFO L82 PathProgramCache]: Analyzing trace with hash -713416189, now seen corresponding path program 80 times [2019-02-18 09:57:42,199 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:57:42,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:42,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:57:42,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:42,200 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:57:42,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:57:44,853 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:44,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:44,854 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:57:44,854 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:57:44,854 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:57:44,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:44,854 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:57:44,863 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:57:44,863 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:57:45,768 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 41 check-sat command(s) [2019-02-18 09:57:45,768 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:57:45,774 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:57:45,794 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:45,794 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:57:52,935 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:52,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:57:52,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 163 [2019-02-18 09:57:52,957 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:57:52,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-02-18 09:57:52,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-02-18 09:57:52,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2019-02-18 09:57:52,959 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 83 states. [2019-02-18 09:57:53,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:57:53,173 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2019-02-18 09:57:53,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-02-18 09:57:53,173 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 83 [2019-02-18 09:57:53,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:57:53,174 INFO L225 Difference]: With dead ends: 87 [2019-02-18 09:57:53,174 INFO L226 Difference]: Without dead ends: 85 [2019-02-18 09:57:53,175 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 84 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-02-18 09:57:53,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-02-18 09:57:53,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-02-18 09:57:53,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-02-18 09:57:53,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-02-18 09:57:53,177 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2019-02-18 09:57:53,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:57:53,177 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-02-18 09:57:53,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-02-18 09:57:53,177 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-02-18 09:57:53,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-02-18 09:57:53,177 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:57:53,178 INFO L402 BasicCegarLoop]: trace histogram [81, 1, 1, 1] [2019-02-18 09:57:53,178 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:57:53,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:57:53,178 INFO L82 PathProgramCache]: Analyzing trace with hash -641063572, now seen corresponding path program 81 times [2019-02-18 09:57:53,178 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:57:53,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:53,179 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:57:53,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:53,179 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:57:53,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:57:55,938 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:55,939 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:55,939 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:57:55,939 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:57:55,939 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:57:55,939 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:55,939 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:57:55,948 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:57:55,948 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:57:56,022 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:57:56,022 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:57:56,025 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:57:56,038 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:56,038 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:58:03,161 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:58:03,181 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:58:03,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 165 [2019-02-18 09:58:03,182 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:58:03,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-02-18 09:58:03,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-02-18 09:58:03,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2019-02-18 09:58:03,183 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 84 states. [2019-02-18 09:58:03,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:58:03,359 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2019-02-18 09:58:03,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-02-18 09:58:03,359 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 84 [2019-02-18 09:58:03,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:58:03,360 INFO L225 Difference]: With dead ends: 88 [2019-02-18 09:58:03,360 INFO L226 Difference]: Without dead ends: 86 [2019-02-18 09:58:03,360 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 85 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-02-18 09:58:03,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-02-18 09:58:03,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-02-18 09:58:03,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-02-18 09:58:03,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2019-02-18 09:58:03,362 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 84 [2019-02-18 09:58:03,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:58:03,363 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2019-02-18 09:58:03,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-02-18 09:58:03,363 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2019-02-18 09:58:03,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-02-18 09:58:03,363 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:58:03,363 INFO L402 BasicCegarLoop]: trace histogram [82, 1, 1, 1] [2019-02-18 09:58:03,363 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:58:03,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:58:03,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1601867555, now seen corresponding path program 82 times [2019-02-18 09:58:03,364 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:58:03,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:58:03,364 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:58:03,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:58:03,364 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:58:03,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:58:06,028 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:58:06,028 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:58:06,028 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:58:06,028 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:58:06,028 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:58:06,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:58:06,029 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:58:06,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:58:06,038 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:58:06,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:58:06,110 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:58:06,131 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:58:06,131 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:58:13,472 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:58:13,492 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:58:13,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 167 [2019-02-18 09:58:13,492 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:58:13,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-02-18 09:58:13,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-02-18 09:58:13,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2019-02-18 09:58:13,494 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 85 states. [2019-02-18 09:58:13,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:58:13,636 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2019-02-18 09:58:13,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-02-18 09:58:13,637 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 85 [2019-02-18 09:58:13,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:58:13,637 INFO L225 Difference]: With dead ends: 89 [2019-02-18 09:58:13,637 INFO L226 Difference]: Without dead ends: 87 [2019-02-18 09:58:13,638 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2019-02-18 09:58:13,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-02-18 09:58:13,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-02-18 09:58:13,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-02-18 09:58:13,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2019-02-18 09:58:13,640 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 85 [2019-02-18 09:58:13,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:58:13,640 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2019-02-18 09:58:13,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-02-18 09:58:13,640 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2019-02-18 09:58:13,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-02-18 09:58:13,641 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:58:13,641 INFO L402 BasicCegarLoop]: trace histogram [83, 1, 1, 1] [2019-02-18 09:58:13,641 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:58:13,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:58:13,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1881711540, now seen corresponding path program 83 times [2019-02-18 09:58:13,641 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:58:13,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:58:13,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:58:13,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:58:13,642 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:58:13,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:58:16,418 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:58:16,419 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:58:16,419 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:58:16,419 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:58:16,419 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:58:16,419 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:58:16,419 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:58:16,427 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:58:16,427 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:58:17,481 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 43 check-sat command(s) [2019-02-18 09:58:17,481 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:58:17,488 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:58:17,501 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:58:17,501 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:58:25,199 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:58:25,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:58:25,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 169 [2019-02-18 09:58:25,221 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:58:25,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-02-18 09:58:25,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-02-18 09:58:25,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2019-02-18 09:58:25,223 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 86 states. [2019-02-18 09:58:25,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:58:25,363 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-02-18 09:58:25,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-02-18 09:58:25,364 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 86 [2019-02-18 09:58:25,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:58:25,364 INFO L225 Difference]: With dead ends: 90 [2019-02-18 09:58:25,364 INFO L226 Difference]: Without dead ends: 88 [2019-02-18 09:58:25,365 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2019-02-18 09:58:25,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-02-18 09:58:25,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-02-18 09:58:25,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-02-18 09:58:25,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2019-02-18 09:58:25,368 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 86 [2019-02-18 09:58:25,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:58:25,369 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2019-02-18 09:58:25,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-02-18 09:58:25,369 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2019-02-18 09:58:25,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-02-18 09:58:25,369 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:58:25,369 INFO L402 BasicCegarLoop]: trace histogram [84, 1, 1, 1] [2019-02-18 09:58:25,369 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:58:25,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:58:25,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1796486211, now seen corresponding path program 84 times [2019-02-18 09:58:25,370 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:58:25,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:58:25,371 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:58:25,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:58:25,371 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:58:25,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:58:28,020 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:58:28,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:58:28,021 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:58:28,021 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:58:28,021 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:58:28,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:58:28,021 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:58:28,031 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:58:28,031 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:58:28,108 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:58:28,108 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:58:28,111 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:58:28,126 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:58:28,127 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:58:36,094 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:58:36,114 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:58:36,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 171 [2019-02-18 09:58:36,114 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:58:36,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-02-18 09:58:36,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-02-18 09:58:36,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2019-02-18 09:58:36,116 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 87 states. [2019-02-18 09:58:36,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:58:36,280 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2019-02-18 09:58:36,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-02-18 09:58:36,281 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 87 [2019-02-18 09:58:36,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:58:36,281 INFO L225 Difference]: With dead ends: 91 [2019-02-18 09:58:36,281 INFO L226 Difference]: Without dead ends: 89 [2019-02-18 09:58:36,282 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2019-02-18 09:58:36,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-02-18 09:58:36,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-02-18 09:58:36,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-02-18 09:58:36,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2019-02-18 09:58:36,286 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 87 [2019-02-18 09:58:36,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:58:36,286 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2019-02-18 09:58:36,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-02-18 09:58:36,286 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2019-02-18 09:58:36,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-02-18 09:58:36,287 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:58:36,287 INFO L402 BasicCegarLoop]: trace histogram [85, 1, 1, 1] [2019-02-18 09:58:36,287 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:58:36,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:58:36,287 INFO L82 PathProgramCache]: Analyzing trace with hash -143500500, now seen corresponding path program 85 times [2019-02-18 09:58:36,288 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:58:36,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:58:36,288 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:58:36,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:58:36,289 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:58:36,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:58:38,883 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:58:38,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:58:38,884 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:58:38,884 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:58:38,884 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:58:38,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:58:38,885 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:58:38,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:58:38,896 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:58:38,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:58:38,976 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:58:38,990 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:58:38,990 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:58:47,056 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:58:47,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:58:47,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 173 [2019-02-18 09:58:47,075 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:58:47,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-02-18 09:58:47,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-02-18 09:58:47,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2019-02-18 09:58:47,077 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 88 states. [2019-02-18 09:58:47,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:58:47,452 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2019-02-18 09:58:47,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-02-18 09:58:47,452 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 88 [2019-02-18 09:58:47,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:58:47,453 INFO L225 Difference]: With dead ends: 92 [2019-02-18 09:58:47,453 INFO L226 Difference]: Without dead ends: 90 [2019-02-18 09:58:47,454 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2019-02-18 09:58:47,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-02-18 09:58:47,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-02-18 09:58:47,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-02-18 09:58:47,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2019-02-18 09:58:47,457 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 88 [2019-02-18 09:58:47,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:58:47,457 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2019-02-18 09:58:47,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-02-18 09:58:47,457 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2019-02-18 09:58:47,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-02-18 09:58:47,458 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:58:47,458 INFO L402 BasicCegarLoop]: trace histogram [86, 1, 1, 1] [2019-02-18 09:58:47,458 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:58:47,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:58:47,458 INFO L82 PathProgramCache]: Analyzing trace with hash -153546397, now seen corresponding path program 86 times [2019-02-18 09:58:47,458 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:58:47,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:58:47,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:58:47,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:58:47,459 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:58:47,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:58:50,455 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:58:50,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:58:50,456 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:58:50,456 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:58:50,456 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:58:50,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:58:50,456 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:58:50,464 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:58:50,464 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:58:51,604 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) [2019-02-18 09:58:51,604 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:58:51,611 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:58:51,631 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:58:51,631 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:58:59,713 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:58:59,734 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:58:59,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 175 [2019-02-18 09:58:59,734 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:58:59,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-02-18 09:58:59,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-02-18 09:58:59,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2019-02-18 09:58:59,737 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 89 states. [2019-02-18 09:58:59,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:58:59,958 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2019-02-18 09:58:59,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-02-18 09:58:59,958 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 89 [2019-02-18 09:58:59,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:58:59,959 INFO L225 Difference]: With dead ends: 93 [2019-02-18 09:58:59,959 INFO L226 Difference]: Without dead ends: 91 [2019-02-18 09:58:59,960 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2019-02-18 09:58:59,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-02-18 09:58:59,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-02-18 09:58:59,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-02-18 09:58:59,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2019-02-18 09:58:59,962 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 89 [2019-02-18 09:58:59,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:58:59,962 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2019-02-18 09:58:59,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-02-18 09:58:59,962 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2019-02-18 09:58:59,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-02-18 09:58:59,963 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:58:59,963 INFO L402 BasicCegarLoop]: trace histogram [87, 1, 1, 1] [2019-02-18 09:58:59,963 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:58:59,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:58:59,963 INFO L82 PathProgramCache]: Analyzing trace with hash -464969204, now seen corresponding path program 87 times [2019-02-18 09:58:59,963 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:58:59,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:58:59,964 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:58:59,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:58:59,964 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:58:59,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:59:02,961 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:59:02,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:59:02,961 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:59:02,962 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:59:02,962 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:59:02,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:59:02,962 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:59:02,971 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:59:02,971 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:59:03,058 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:59:03,058 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:59:03,062 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:59:03,077 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:59:03,077 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:59:11,588 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:59:11,609 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:59:11,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 177 [2019-02-18 09:59:11,609 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:59:11,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-02-18 09:59:11,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-02-18 09:59:11,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2019-02-18 09:59:11,612 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 90 states. [2019-02-18 09:59:11,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:59:11,751 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2019-02-18 09:59:11,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-02-18 09:59:11,751 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 90 [2019-02-18 09:59:11,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:59:11,752 INFO L225 Difference]: With dead ends: 94 [2019-02-18 09:59:11,752 INFO L226 Difference]: Without dead ends: 92 [2019-02-18 09:59:11,753 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2019-02-18 09:59:11,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-02-18 09:59:11,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-02-18 09:59:11,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-02-18 09:59:11,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2019-02-18 09:59:11,755 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 90 [2019-02-18 09:59:11,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:59:11,756 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2019-02-18 09:59:11,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-02-18 09:59:11,756 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2019-02-18 09:59:11,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-02-18 09:59:11,756 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:59:11,756 INFO L402 BasicCegarLoop]: trace histogram [88, 1, 1, 1] [2019-02-18 09:59:11,756 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:59:11,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:59:11,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1529141629, now seen corresponding path program 88 times [2019-02-18 09:59:11,757 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:59:11,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:59:11,758 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:59:11,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:59:11,758 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:59:11,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:59:14,567 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:59:14,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:59:14,567 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:59:14,568 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:59:14,568 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:59:14,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:59:14,568 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:59:14,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:59:14,576 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:59:14,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:59:14,655 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:59:14,670 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:59:14,671 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:59:23,112 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:59:23,130 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:59:23,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90, 90] total 179 [2019-02-18 09:59:23,131 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:59:23,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-02-18 09:59:23,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-02-18 09:59:23,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2019-02-18 09:59:23,133 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 91 states. [2019-02-18 09:59:23,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:59:23,347 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2019-02-18 09:59:23,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-02-18 09:59:23,348 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 91 [2019-02-18 09:59:23,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:59:23,348 INFO L225 Difference]: With dead ends: 95 [2019-02-18 09:59:23,348 INFO L226 Difference]: Without dead ends: 93 [2019-02-18 09:59:23,349 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 92 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-02-18 09:59:23,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-02-18 09:59:23,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-02-18 09:59:23,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-02-18 09:59:23,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2019-02-18 09:59:23,351 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 91 [2019-02-18 09:59:23,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:59:23,351 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2019-02-18 09:59:23,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-02-18 09:59:23,351 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2019-02-18 09:59:23,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-02-18 09:59:23,352 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:59:23,352 INFO L402 BasicCegarLoop]: trace histogram [89, 1, 1, 1] [2019-02-18 09:59:23,352 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:59:23,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:59:23,352 INFO L82 PathProgramCache]: Analyzing trace with hash -158748436, now seen corresponding path program 89 times [2019-02-18 09:59:23,352 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:59:23,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:59:23,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:59:23,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:59:23,353 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:59:23,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:59:26,431 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:59:26,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:59:26,432 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:59:26,432 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:59:26,432 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:59:26,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:59:26,432 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:59:26,440 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:59:26,441 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:59:27,789 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2019-02-18 09:59:27,790 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:59:27,798 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:59:27,811 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:59:27,812 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:59:36,088 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:59:36,109 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:59:36,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 181 [2019-02-18 09:59:36,110 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:59:36,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-02-18 09:59:36,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-02-18 09:59:36,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2019-02-18 09:59:36,112 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 92 states. [2019-02-18 09:59:36,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:59:36,315 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2019-02-18 09:59:36,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-02-18 09:59:36,315 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 92 [2019-02-18 09:59:36,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:59:36,316 INFO L225 Difference]: With dead ends: 96 [2019-02-18 09:59:36,316 INFO L226 Difference]: Without dead ends: 94 [2019-02-18 09:59:36,317 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2019-02-18 09:59:36,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-02-18 09:59:36,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2019-02-18 09:59:36,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-02-18 09:59:36,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2019-02-18 09:59:36,320 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 92 [2019-02-18 09:59:36,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:59:36,320 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2019-02-18 09:59:36,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-02-18 09:59:36,320 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2019-02-18 09:59:36,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-02-18 09:59:36,321 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:59:36,321 INFO L402 BasicCegarLoop]: trace histogram [90, 1, 1, 1] [2019-02-18 09:59:36,321 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:59:36,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:59:36,321 INFO L82 PathProgramCache]: Analyzing trace with hash -626232413, now seen corresponding path program 90 times [2019-02-18 09:59:36,322 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:59:36,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:59:36,322 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:59:36,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:59:36,322 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:59:36,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:59:39,277 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:59:39,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:59:39,277 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:59:39,277 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:59:39,277 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:59:39,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:59:39,277 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:59:39,287 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:59:39,287 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:59:39,365 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:59:39,365 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:59:39,369 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:59:39,384 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:59:39,384 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:59:48,469 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:59:48,488 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:59:48,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92, 92] total 183 [2019-02-18 09:59:48,488 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:59:48,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-02-18 09:59:48,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-02-18 09:59:48,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2019-02-18 09:59:48,491 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 93 states. [2019-02-18 09:59:48,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:59:48,753 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2019-02-18 09:59:48,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-02-18 09:59:48,754 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 93 [2019-02-18 09:59:48,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:59:48,754 INFO L225 Difference]: With dead ends: 97 [2019-02-18 09:59:48,754 INFO L226 Difference]: Without dead ends: 95 [2019-02-18 09:59:48,756 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2019-02-18 09:59:48,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-02-18 09:59:48,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-02-18 09:59:48,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-02-18 09:59:48,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2019-02-18 09:59:48,760 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 93 [2019-02-18 09:59:48,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:59:48,760 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2019-02-18 09:59:48,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-02-18 09:59:48,760 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2019-02-18 09:59:48,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-02-18 09:59:48,761 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:59:48,761 INFO L402 BasicCegarLoop]: trace histogram [91, 1, 1, 1] [2019-02-18 09:59:48,761 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:59:48,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:59:48,761 INFO L82 PathProgramCache]: Analyzing trace with hash 2061633484, now seen corresponding path program 91 times [2019-02-18 09:59:48,761 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:59:48,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:59:48,762 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:59:48,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:59:48,762 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:59:48,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:59:52,105 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:59:52,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:59:52,105 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:59:52,105 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:59:52,105 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:59:52,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:59:52,106 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:59:52,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:59:52,115 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:59:52,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:59:52,201 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:59:52,216 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:59:52,216 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:00:01,112 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:00:01,131 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:00:01,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 185 [2019-02-18 10:00:01,131 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:00:01,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-02-18 10:00:01,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-02-18 10:00:01,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2019-02-18 10:00:01,133 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 94 states. [2019-02-18 10:00:01,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:00:01,334 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2019-02-18 10:00:01,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-02-18 10:00:01,334 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 94 [2019-02-18 10:00:01,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:00:01,335 INFO L225 Difference]: With dead ends: 98 [2019-02-18 10:00:01,335 INFO L226 Difference]: Without dead ends: 96 [2019-02-18 10:00:01,336 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2019-02-18 10:00:01,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-02-18 10:00:01,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-02-18 10:00:01,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-02-18 10:00:01,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2019-02-18 10:00:01,338 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 94 [2019-02-18 10:00:01,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:00:01,338 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2019-02-18 10:00:01,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-02-18 10:00:01,338 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2019-02-18 10:00:01,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-02-18 10:00:01,339 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:00:01,339 INFO L402 BasicCegarLoop]: trace histogram [92, 1, 1, 1] [2019-02-18 10:00:01,339 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:00:01,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:00:01,339 INFO L82 PathProgramCache]: Analyzing trace with hash -513869629, now seen corresponding path program 92 times [2019-02-18 10:00:01,339 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:00:01,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:00:01,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:00:01,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:00:01,340 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:00:01,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:00:04,694 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:00:04,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:00:04,695 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:00:04,695 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:00:04,695 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:00:04,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:00:04,695 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:00:04,703 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 10:00:04,703 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 10:00:06,212 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 47 check-sat command(s) [2019-02-18 10:00:06,212 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:00:06,219 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:00:06,233 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:00:06,233 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:00:15,650 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:00:15,672 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:00:15,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94, 94] total 187 [2019-02-18 10:00:15,672 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:00:15,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-02-18 10:00:15,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-02-18 10:00:15,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2019-02-18 10:00:15,674 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 95 states. [2019-02-18 10:00:15,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:00:15,837 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2019-02-18 10:00:15,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-02-18 10:00:15,838 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 95 [2019-02-18 10:00:15,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:00:15,838 INFO L225 Difference]: With dead ends: 99 [2019-02-18 10:00:15,838 INFO L226 Difference]: Without dead ends: 97 [2019-02-18 10:00:15,840 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2019-02-18 10:00:15,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-02-18 10:00:15,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-02-18 10:00:15,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-02-18 10:00:15,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2019-02-18 10:00:15,842 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 95 [2019-02-18 10:00:15,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:00:15,842 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2019-02-18 10:00:15,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-02-18 10:00:15,843 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2019-02-18 10:00:15,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-02-18 10:00:15,843 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:00:15,843 INFO L402 BasicCegarLoop]: trace histogram [93, 1, 1, 1] [2019-02-18 10:00:15,843 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:00:15,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:00:15,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1249912492, now seen corresponding path program 93 times [2019-02-18 10:00:15,844 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:00:15,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:00:15,844 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:00:15,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:00:15,844 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:00:15,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:00:19,215 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:00:19,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:00:19,215 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:00:19,215 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:00:19,215 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:00:19,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:00:19,215 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:00:19,224 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 10:00:19,224 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 10:00:19,309 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 10:00:19,309 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:00:19,313 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:00:19,329 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:00:19,329 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:00:28,899 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:00:28,917 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:00:28,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 189 [2019-02-18 10:00:28,917 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:00:28,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-02-18 10:00:28,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-02-18 10:00:28,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2019-02-18 10:00:28,920 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 96 states. [2019-02-18 10:00:29,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:00:29,073 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2019-02-18 10:00:29,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-02-18 10:00:29,074 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 96 [2019-02-18 10:00:29,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:00:29,075 INFO L225 Difference]: With dead ends: 100 [2019-02-18 10:00:29,076 INFO L226 Difference]: Without dead ends: 98 [2019-02-18 10:00:29,078 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2019-02-18 10:00:29,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-02-18 10:00:29,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2019-02-18 10:00:29,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-02-18 10:00:29,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2019-02-18 10:00:29,080 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 96 [2019-02-18 10:00:29,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:00:29,080 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2019-02-18 10:00:29,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-02-18 10:00:29,080 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2019-02-18 10:00:29,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-02-18 10:00:29,081 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:00:29,081 INFO L402 BasicCegarLoop]: trace histogram [94, 1, 1, 1] [2019-02-18 10:00:29,081 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:00:29,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:00:29,081 INFO L82 PathProgramCache]: Analyzing trace with hash 92583395, now seen corresponding path program 94 times [2019-02-18 10:00:29,081 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:00:29,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:00:29,082 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:00:29,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:00:29,082 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:00:29,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:00:32,247 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:00:32,248 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:00:32,248 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:00:32,248 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:00:32,248 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:00:32,248 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:00:32,248 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:00:32,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:00:32,256 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:00:32,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:00:32,343 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:00:32,359 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:00:32,359 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:00:42,255 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:00:42,273 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:00:42,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 191 [2019-02-18 10:00:42,273 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:00:42,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-02-18 10:00:42,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-02-18 10:00:42,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2019-02-18 10:00:42,276 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 97 states. [2019-02-18 10:00:42,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:00:42,426 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2019-02-18 10:00:42,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-02-18 10:00:42,426 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 97 [2019-02-18 10:00:42,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:00:42,427 INFO L225 Difference]: With dead ends: 101 [2019-02-18 10:00:42,427 INFO L226 Difference]: Without dead ends: 99 [2019-02-18 10:00:42,429 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2019-02-18 10:00:42,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-02-18 10:00:42,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-02-18 10:00:42,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-02-18 10:00:42,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2019-02-18 10:00:42,432 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 97 [2019-02-18 10:00:42,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:00:42,432 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2019-02-18 10:00:42,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-02-18 10:00:42,433 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2019-02-18 10:00:42,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-02-18 10:00:42,433 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:00:42,433 INFO L402 BasicCegarLoop]: trace histogram [95, 1, 1, 1] [2019-02-18 10:00:42,434 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:00:42,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:00:42,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1424880244, now seen corresponding path program 95 times [2019-02-18 10:00:42,434 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:00:42,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:00:42,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:00:42,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:00:42,435 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:00:42,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:00:46,000 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:00:46,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:00:46,001 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:00:46,001 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:00:46,001 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:00:46,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:00:46,001 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:00:46,010 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 10:00:46,010 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 10:00:47,711 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 49 check-sat command(s) [2019-02-18 10:00:47,711 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:00:47,718 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:00:47,733 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:00:47,733 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:00:57,574 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:00:57,595 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:00:57,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 193 [2019-02-18 10:00:57,596 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:00:57,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-02-18 10:00:57,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-02-18 10:00:57,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2019-02-18 10:00:57,599 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 98 states. [2019-02-18 10:00:57,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:00:57,771 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2019-02-18 10:00:57,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-02-18 10:00:57,772 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 98 [2019-02-18 10:00:57,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:00:57,772 INFO L225 Difference]: With dead ends: 102 [2019-02-18 10:00:57,772 INFO L226 Difference]: Without dead ends: 100 [2019-02-18 10:00:57,774 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2019-02-18 10:00:57,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-02-18 10:00:57,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-02-18 10:00:57,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-02-18 10:00:57,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2019-02-18 10:00:57,776 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 98 [2019-02-18 10:00:57,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:00:57,776 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2019-02-18 10:00:57,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-02-18 10:00:57,776 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2019-02-18 10:00:57,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-02-18 10:00:57,777 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:00:57,777 INFO L402 BasicCegarLoop]: trace histogram [96, 1, 1, 1] [2019-02-18 10:00:57,777 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:00:57,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:00:57,778 INFO L82 PathProgramCache]: Analyzing trace with hash -1221612797, now seen corresponding path program 96 times [2019-02-18 10:00:57,778 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:00:57,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:00:57,778 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:00:57,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:00:57,779 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:00:57,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:01:01,401 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:01:01,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:01:01,401 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:01:01,401 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:01:01,401 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:01:01,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:01:01,402 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:01:01,411 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 10:01:01,411 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 10:01:01,500 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 10:01:01,500 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:01:01,504 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:01:01,520 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:01:01,520 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:01:11,608 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:01:11,627 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:01:11,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 195 [2019-02-18 10:01:11,627 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:01:11,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-02-18 10:01:11,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-02-18 10:01:11,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2019-02-18 10:01:11,631 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 99 states. [2019-02-18 10:01:11,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:01:11,852 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2019-02-18 10:01:11,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-02-18 10:01:11,852 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 99 [2019-02-18 10:01:11,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:01:11,853 INFO L225 Difference]: With dead ends: 103 [2019-02-18 10:01:11,853 INFO L226 Difference]: Without dead ends: 101 [2019-02-18 10:01:11,855 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2019-02-18 10:01:11,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-02-18 10:01:11,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-02-18 10:01:11,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-02-18 10:01:11,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2019-02-18 10:01:11,858 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 99 [2019-02-18 10:01:11,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:01:11,858 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2019-02-18 10:01:11,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-02-18 10:01:11,858 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2019-02-18 10:01:11,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-02-18 10:01:11,859 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:01:11,859 INFO L402 BasicCegarLoop]: trace histogram [97, 1, 1, 1] [2019-02-18 10:01:11,859 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:01:11,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:01:11,859 INFO L82 PathProgramCache]: Analyzing trace with hash 784710764, now seen corresponding path program 97 times [2019-02-18 10:01:11,859 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:01:11,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:01:11,860 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:01:11,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:01:11,860 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:01:11,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:01:15,455 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:01:15,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:01:15,455 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:01:15,455 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:01:15,455 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:01:15,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:01:15,455 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:01:15,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:01:15,464 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:01:15,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:01:15,553 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:01:15,569 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:01:15,569 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:01:25,833 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:01:25,851 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:01:25,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 197 [2019-02-18 10:01:25,852 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:01:25,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-02-18 10:01:25,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-02-18 10:01:25,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2019-02-18 10:01:25,854 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 100 states. [2019-02-18 10:01:26,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:01:26,169 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2019-02-18 10:01:26,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-02-18 10:01:26,169 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 100 [2019-02-18 10:01:26,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:01:26,170 INFO L225 Difference]: With dead ends: 104 [2019-02-18 10:01:26,170 INFO L226 Difference]: Without dead ends: 102 [2019-02-18 10:01:26,171 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2019-02-18 10:01:26,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-02-18 10:01:26,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-02-18 10:01:26,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-02-18 10:01:26,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2019-02-18 10:01:26,173 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 100 [2019-02-18 10:01:26,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:01:26,173 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2019-02-18 10:01:26,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-02-18 10:01:26,173 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2019-02-18 10:01:26,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-02-18 10:01:26,174 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:01:26,174 INFO L402 BasicCegarLoop]: trace histogram [98, 1, 1, 1] [2019-02-18 10:01:26,174 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:01:26,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:01:26,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1443768285, now seen corresponding path program 98 times [2019-02-18 10:01:26,174 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:01:26,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:01:26,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:01:26,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:01:26,175 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:01:26,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:01:29,771 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:01:29,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:01:29,772 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:01:29,772 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:01:29,772 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:01:29,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:01:29,772 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:01:29,780 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 10:01:29,780 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 10:01:31,646 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 50 check-sat command(s) [2019-02-18 10:01:31,647 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:01:31,654 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:01:31,670 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:01:31,670 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:01:42,263 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:01:42,287 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:01:42,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100, 100] total 199 [2019-02-18 10:01:42,287 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:01:42,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-02-18 10:01:42,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-02-18 10:01:42,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2019-02-18 10:01:42,290 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 101 states. [2019-02-18 10:01:42,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:01:42,539 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2019-02-18 10:01:42,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-02-18 10:01:42,539 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 101 [2019-02-18 10:01:42,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:01:42,540 INFO L225 Difference]: With dead ends: 105 [2019-02-18 10:01:42,540 INFO L226 Difference]: Without dead ends: 103 [2019-02-18 10:01:42,541 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 102 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-02-18 10:01:42,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-02-18 10:01:42,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-02-18 10:01:42,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-02-18 10:01:42,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2019-02-18 10:01:42,544 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 101 [2019-02-18 10:01:42,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:01:42,544 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2019-02-18 10:01:42,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-02-18 10:01:42,544 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2019-02-18 10:01:42,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-02-18 10:01:42,544 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:01:42,545 INFO L402 BasicCegarLoop]: trace histogram [99, 1, 1, 1] [2019-02-18 10:01:42,545 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:01:42,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:01:42,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1807142068, now seen corresponding path program 99 times [2019-02-18 10:01:42,545 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:01:42,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:01:42,546 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:01:42,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:01:42,546 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:01:42,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:01:46,253 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:01:46,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:01:46,254 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:01:46,254 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:01:46,254 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:01:46,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:01:46,254 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:01:46,263 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 10:01:46,264 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 10:01:46,352 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 10:01:46,352 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:01:46,356 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:01:46,373 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:01:46,374 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:01:57,242 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:01:57,260 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:01:57,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101, 101] total 201 [2019-02-18 10:01:57,261 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:01:57,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-02-18 10:01:57,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-02-18 10:01:57,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2019-02-18 10:01:57,264 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 102 states. [2019-02-18 10:01:57,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:01:57,530 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2019-02-18 10:01:57,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-02-18 10:01:57,530 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 102 [2019-02-18 10:01:57,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:01:57,531 INFO L225 Difference]: With dead ends: 106 [2019-02-18 10:01:57,531 INFO L226 Difference]: Without dead ends: 104 [2019-02-18 10:01:57,533 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2019-02-18 10:01:57,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-02-18 10:01:57,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-02-18 10:01:57,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-02-18 10:01:57,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2019-02-18 10:01:57,535 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 102 [2019-02-18 10:01:57,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:01:57,535 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2019-02-18 10:01:57,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-02-18 10:01:57,536 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2019-02-18 10:01:57,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-02-18 10:01:57,536 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:01:57,536 INFO L402 BasicCegarLoop]: trace histogram [100, 1, 1, 1] [2019-02-18 10:01:57,536 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:01:57,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:01:57,536 INFO L82 PathProgramCache]: Analyzing trace with hash -186827453, now seen corresponding path program 100 times [2019-02-18 10:01:57,537 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:01:57,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:01:57,537 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:01:57,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:01:57,537 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:01:57,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:02:01,410 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:02:01,410 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:02:01,411 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:02:01,411 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:02:01,411 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:02:01,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:02:01,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 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:02:01,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:02:01,420 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:02:01,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:02:01,512 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:02:01,529 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:02:01,530 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:02:12,521 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:02:12,541 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:02:12,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 102, 102] total 203 [2019-02-18 10:02:12,541 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:02:12,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-02-18 10:02:12,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-02-18 10:02:12,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2019-02-18 10:02:12,544 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 103 states. [2019-02-18 10:02:12,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:02:12,740 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2019-02-18 10:02:12,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-02-18 10:02:12,741 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 103 [2019-02-18 10:02:12,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:02:12,742 INFO L225 Difference]: With dead ends: 107 [2019-02-18 10:02:12,742 INFO L226 Difference]: Without dead ends: 105 [2019-02-18 10:02:12,744 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.7s TimeCoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2019-02-18 10:02:12,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-02-18 10:02:12,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-02-18 10:02:12,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-02-18 10:02:12,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2019-02-18 10:02:12,747 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 103 [2019-02-18 10:02:12,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:02:12,747 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2019-02-18 10:02:12,747 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-02-18 10:02:12,747 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2019-02-18 10:02:12,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-02-18 10:02:12,748 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:02:12,748 INFO L402 BasicCegarLoop]: trace histogram [101, 1, 1, 1] [2019-02-18 10:02:12,748 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:02:12,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:02:12,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1496681940, now seen corresponding path program 101 times [2019-02-18 10:02:12,749 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:02:12,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:02:12,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:02:12,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:02:12,750 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:02:12,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:02:16,766 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:02:16,766 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:02:16,766 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:02:16,767 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:02:16,767 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:02:16,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:02:16,767 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:02:16,776 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 10:02:16,776 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 10:02:18,942 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2019-02-18 10:02:18,942 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:02:18,950 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:02:18,971 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:02:18,971 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:02:30,540 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:02:30,562 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:02:30,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 103, 103] total 205 [2019-02-18 10:02:30,562 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:02:30,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-02-18 10:02:30,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-02-18 10:02:30,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2019-02-18 10:02:30,566 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 104 states. [2019-02-18 10:02:30,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:02:30,897 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2019-02-18 10:02:30,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-02-18 10:02:30,897 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 104 [2019-02-18 10:02:30,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:02:30,898 INFO L225 Difference]: With dead ends: 108 [2019-02-18 10:02:30,898 INFO L226 Difference]: Without dead ends: 106 [2019-02-18 10:02:30,900 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.4s TimeCoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2019-02-18 10:02:30,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-02-18 10:02:30,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2019-02-18 10:02:30,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-02-18 10:02:30,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2019-02-18 10:02:30,903 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 104 [2019-02-18 10:02:30,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:02:30,904 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2019-02-18 10:02:30,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-02-18 10:02:30,904 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2019-02-18 10:02:30,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-02-18 10:02:30,904 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:02:30,904 INFO L402 BasicCegarLoop]: trace histogram [102, 1, 1, 1] [2019-02-18 10:02:30,905 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:02:30,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:02:30,905 INFO L82 PathProgramCache]: Analyzing trace with hash 847501923, now seen corresponding path program 102 times [2019-02-18 10:02:30,905 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:02:30,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:02:30,906 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:02:30,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:02:30,906 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:02:30,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:02:34,639 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:02:34,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:02:34,639 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:02:34,639 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:02:34,640 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:02:34,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:02:34,640 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:02:34,647 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 10:02:34,648 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 10:02:34,738 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 10:02:34,738 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:02:34,744 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:02:34,769 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:02:34,770 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:02:46,276 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:02:46,294 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:02:46,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104, 104, 104] total 207 [2019-02-18 10:02:46,295 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:02:46,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-02-18 10:02:46,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-02-18 10:02:46,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2019-02-18 10:02:46,299 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 105 states. [2019-02-18 10:02:46,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:02:46,598 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2019-02-18 10:02:46,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-02-18 10:02:46,598 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 105 [2019-02-18 10:02:46,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:02:46,599 INFO L225 Difference]: With dead ends: 109 [2019-02-18 10:02:46,599 INFO L226 Difference]: Without dead ends: 107 [2019-02-18 10:02:46,601 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2019-02-18 10:02:46,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-02-18 10:02:46,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-02-18 10:02:46,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-02-18 10:02:46,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2019-02-18 10:02:46,604 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 105 [2019-02-18 10:02:46,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:02:46,604 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2019-02-18 10:02:46,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-02-18 10:02:46,604 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2019-02-18 10:02:46,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-02-18 10:02:46,605 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:02:46,605 INFO L402 BasicCegarLoop]: trace histogram [103, 1, 1, 1] [2019-02-18 10:02:46,605 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:02:46,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:02:46,605 INFO L82 PathProgramCache]: Analyzing trace with hash 502757644, now seen corresponding path program 103 times [2019-02-18 10:02:46,606 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:02:46,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:02:46,606 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:02:46,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:02:46,606 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:02:46,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:02:50,437 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:02:50,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:02:50,438 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:02:50,438 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:02:50,438 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:02:50,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:02:50,438 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:02:50,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:02:50,449 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:02:50,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:02:50,542 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:02:50,569 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:02:50,569 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:03:02,459 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:03:02,479 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:03:02,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105, 105, 105] total 209 [2019-02-18 10:03:02,480 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:03:02,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-02-18 10:03:02,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-02-18 10:03:02,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2019-02-18 10:03:02,483 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 106 states. [2019-02-18 10:03:02,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:03:02,728 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2019-02-18 10:03:02,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-02-18 10:03:02,728 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 106 [2019-02-18 10:03:02,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:03:02,729 INFO L225 Difference]: With dead ends: 110 [2019-02-18 10:03:02,729 INFO L226 Difference]: Without dead ends: 108 [2019-02-18 10:03:02,731 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 107 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-02-18 10:03:02,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-02-18 10:03:02,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-02-18 10:03:02,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-02-18 10:03:02,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2019-02-18 10:03:02,735 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 106 [2019-02-18 10:03:02,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:03:02,735 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2019-02-18 10:03:02,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-02-18 10:03:02,735 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2019-02-18 10:03:02,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-02-18 10:03:02,736 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:03:02,736 INFO L402 BasicCegarLoop]: trace histogram [104, 1, 1, 1] [2019-02-18 10:03:02,736 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:03:02,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:03:02,736 INFO L82 PathProgramCache]: Analyzing trace with hash -1594380413, now seen corresponding path program 104 times [2019-02-18 10:03:02,736 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:03:02,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:03:02,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:03:02,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:03:02,737 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:03:02,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:03:06,953 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:03:06,953 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:03:06,953 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:03:06,953 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:03:06,953 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:03:06,953 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:03:06,953 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:03:06,962 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 10:03:06,962 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 10:03:09,445 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 53 check-sat command(s) [2019-02-18 10:03:09,445 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:03:09,454 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:03:09,481 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:03:09,481 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:03:21,626 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:03:21,649 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:03:21,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106, 106, 106] total 211 [2019-02-18 10:03:21,649 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:03:21,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-02-18 10:03:21,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-02-18 10:03:21,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2019-02-18 10:03:21,653 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 107 states. [2019-02-18 10:03:21,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:03:21,934 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2019-02-18 10:03:21,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-02-18 10:03:21,934 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 107 [2019-02-18 10:03:21,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:03:21,935 INFO L225 Difference]: With dead ends: 111 [2019-02-18 10:03:21,935 INFO L226 Difference]: Without dead ends: 109 [2019-02-18 10:03:21,937 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.2s TimeCoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2019-02-18 10:03:21,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-02-18 10:03:21,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-02-18 10:03:21,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-02-18 10:03:21,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2019-02-18 10:03:21,939 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 107 [2019-02-18 10:03:21,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:03:21,939 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2019-02-18 10:03:21,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-02-18 10:03:21,939 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2019-02-18 10:03:21,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-02-18 10:03:21,939 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:03:21,939 INFO L402 BasicCegarLoop]: trace histogram [105, 1, 1, 1] [2019-02-18 10:03:21,939 INFO L423 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:03:21,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:03:21,940 INFO L82 PathProgramCache]: Analyzing trace with hash 2113816556, now seen corresponding path program 105 times [2019-02-18 10:03:21,940 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:03:21,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:03:21,940 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:03:21,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:03:21,940 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:03:21,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:03:25,850 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:03:25,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:03:25,850 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:03:25,850 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:03:25,851 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:03:25,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:03:25,851 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:03:25,858 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 10:03:25,859 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 10:03:25,951 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 10:03:25,952 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:03:25,955 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:03:25,972 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:03:25,973 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:03:38,565 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:03:38,584 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:03:38,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107, 107, 107] total 213 [2019-02-18 10:03:38,584 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:03:38,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-02-18 10:03:38,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-02-18 10:03:38,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22791, Invalid=22791, Unknown=0, NotChecked=0, Total=45582 [2019-02-18 10:03:38,587 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 108 states. [2019-02-18 10:03:38,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:03:38,834 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2019-02-18 10:03:38,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2019-02-18 10:03:38,835 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 108 [2019-02-18 10:03:38,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:03:38,835 INFO L225 Difference]: With dead ends: 112 [2019-02-18 10:03:38,835 INFO L226 Difference]: Without dead ends: 110 [2019-02-18 10:03:38,836 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.3s TimeCoverageRelationStatistics Valid=22791, Invalid=22791, Unknown=0, NotChecked=0, Total=45582 [2019-02-18 10:03:38,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-02-18 10:03:38,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2019-02-18 10:03:38,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-02-18 10:03:38,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2019-02-18 10:03:38,838 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 108 [2019-02-18 10:03:38,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:03:38,838 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2019-02-18 10:03:38,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-02-18 10:03:38,838 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2019-02-18 10:03:38,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-02-18 10:03:38,839 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:03:38,839 INFO L402 BasicCegarLoop]: trace histogram [106, 1, 1, 1] [2019-02-18 10:03:38,839 INFO L423 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:03:38,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:03:38,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1103805603, now seen corresponding path program 106 times [2019-02-18 10:03:38,840 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:03:38,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:03:38,841 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:03:38,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:03:38,841 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:03:38,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:03:43,116 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:03:43,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:03:43,116 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:03:43,116 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:03:43,117 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:03:43,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:03:43,117 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:03:43,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:03:43,129 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:03:43,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:03:43,224 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:03:43,242 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:03:43,243 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:03:55,536 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:03:55,554 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:03:55,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108, 108, 108] total 215 [2019-02-18 10:03:55,554 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:03:55,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 109 states [2019-02-18 10:03:55,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2019-02-18 10:03:55,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23220, Invalid=23220, Unknown=0, NotChecked=0, Total=46440 [2019-02-18 10:03:55,557 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 109 states. [2019-02-18 10:03:55,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:03:55,824 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2019-02-18 10:03:55,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2019-02-18 10:03:55,825 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 109 [2019-02-18 10:03:55,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:03:55,825 INFO L225 Difference]: With dead ends: 113 [2019-02-18 10:03:55,825 INFO L226 Difference]: Without dead ends: 111 [2019-02-18 10:03:55,826 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.4s TimeCoverageRelationStatistics Valid=23220, Invalid=23220, Unknown=0, NotChecked=0, Total=46440 [2019-02-18 10:03:55,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-02-18 10:03:55,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-02-18 10:03:55,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-02-18 10:03:55,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2019-02-18 10:03:55,829 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 109 [2019-02-18 10:03:55,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:03:55,829 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2019-02-18 10:03:55,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 109 states. [2019-02-18 10:03:55,829 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2019-02-18 10:03:55,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-02-18 10:03:55,829 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:03:55,830 INFO L402 BasicCegarLoop]: trace histogram [107, 1, 1, 1] [2019-02-18 10:03:55,830 INFO L423 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:03:55,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:03:55,830 INFO L82 PathProgramCache]: Analyzing trace with hash -141762868, now seen corresponding path program 107 times [2019-02-18 10:03:55,830 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:03:55,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:03:55,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:03:55,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:03:55,831 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:03:55,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:04:00,087 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:04:00,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:04:00,088 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:04:00,088 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:04:00,088 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:04:00,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:04:00,088 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:04:00,097 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 10:04:00,098 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 10:04:02,818 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 55 check-sat command(s) [2019-02-18 10:04:02,819 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:04:02,827 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:04:02,846 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:04:02,846 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:04:15,769 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:04:15,792 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:04:15,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109, 109, 109] total 217 [2019-02-18 10:04:15,792 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:04:15,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-02-18 10:04:15,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-02-18 10:04:15,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23653, Invalid=23653, Unknown=0, NotChecked=0, Total=47306 [2019-02-18 10:04:15,797 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 110 states. [2019-02-18 10:04:16,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:04:16,174 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2019-02-18 10:04:16,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2019-02-18 10:04:16,174 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 110 [2019-02-18 10:04:16,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:04:16,174 INFO L225 Difference]: With dead ends: 114 [2019-02-18 10:04:16,175 INFO L226 Difference]: Without dead ends: 112 [2019-02-18 10:04:16,177 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.0s TimeCoverageRelationStatistics Valid=23653, Invalid=23653, Unknown=0, NotChecked=0, Total=47306 [2019-02-18 10:04:16,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-02-18 10:04:16,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2019-02-18 10:04:16,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-02-18 10:04:16,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2019-02-18 10:04:16,180 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 110 [2019-02-18 10:04:16,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:04:16,181 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2019-02-18 10:04:16,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2019-02-18 10:04:16,181 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2019-02-18 10:04:16,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-02-18 10:04:16,181 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:04:16,181 INFO L402 BasicCegarLoop]: trace histogram [108, 1, 1, 1] [2019-02-18 10:04:16,182 INFO L423 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:04:16,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:04:16,182 INFO L82 PathProgramCache]: Analyzing trace with hash -99679805, now seen corresponding path program 108 times [2019-02-18 10:04:16,182 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:04:16,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:04:16,183 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:04:16,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:04:16,183 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:04:16,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:04:20,650 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:04:20,651 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:04:20,651 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:04:20,651 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:04:20,651 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:04:20,651 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:04:20,651 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:04:20,659 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 10:04:20,659 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 10:04:20,758 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 10:04:20,758 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:04:20,763 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:04:20,783 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:04:20,783 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:04:33,704 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:04:33,723 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:04:33,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110, 110, 110] total 219 [2019-02-18 10:04:33,723 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:04:33,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-02-18 10:04:33,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-02-18 10:04:33,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24090, Invalid=24090, Unknown=0, NotChecked=0, Total=48180 [2019-02-18 10:04:33,729 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 111 states. [2019-02-18 10:04:34,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:04:34,001 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2019-02-18 10:04:34,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-02-18 10:04:34,002 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 111 [2019-02-18 10:04:34,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:04:34,003 INFO L225 Difference]: With dead ends: 115 [2019-02-18 10:04:34,003 INFO L226 Difference]: Without dead ends: 113 [2019-02-18 10:04:34,007 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.2s TimeCoverageRelationStatistics Valid=24090, Invalid=24090, Unknown=0, NotChecked=0, Total=48180 [2019-02-18 10:04:34,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-02-18 10:04:34,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-02-18 10:04:34,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-02-18 10:04:34,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2019-02-18 10:04:34,010 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 111 [2019-02-18 10:04:34,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:04:34,010 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2019-02-18 10:04:34,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-02-18 10:04:34,010 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2019-02-18 10:04:34,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-02-18 10:04:34,011 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:04:34,011 INFO L402 BasicCegarLoop]: trace histogram [109, 1, 1, 1] [2019-02-18 10:04:34,011 INFO L423 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:04:34,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:04:34,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1204895148, now seen corresponding path program 109 times [2019-02-18 10:04:34,012 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:04:34,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:04:34,012 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:04:34,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:04:34,013 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:04:34,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:04:38,366 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:04:38,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:04:38,367 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:04:38,367 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:04:38,367 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:04:38,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:04:38,367 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:04:38,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:04:38,376 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:04:38,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:04:38,473 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:04:38,493 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:04:38,494 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:04:51,406 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:04:51,424 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:04:51,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111, 111, 111] total 221 [2019-02-18 10:04:51,424 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:04:51,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-02-18 10:04:51,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-02-18 10:04:51,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24531, Invalid=24531, Unknown=0, NotChecked=0, Total=49062 [2019-02-18 10:04:51,430 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 112 states. [2019-02-18 10:04:51,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:04:51,652 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2019-02-18 10:04:51,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2019-02-18 10:04:51,652 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 112 [2019-02-18 10:04:51,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:04:51,653 INFO L225 Difference]: With dead ends: 116 [2019-02-18 10:04:51,653 INFO L226 Difference]: Without dead ends: 114 [2019-02-18 10:04:51,655 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.1s TimeCoverageRelationStatistics Valid=24531, Invalid=24531, Unknown=0, NotChecked=0, Total=49062 [2019-02-18 10:04:51,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-02-18 10:04:51,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-02-18 10:04:51,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-02-18 10:04:51,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2019-02-18 10:04:51,658 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 112 [2019-02-18 10:04:51,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:04:51,658 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2019-02-18 10:04:51,658 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-02-18 10:04:51,658 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2019-02-18 10:04:51,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-02-18 10:04:51,659 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:04:51,659 INFO L402 BasicCegarLoop]: trace histogram [110, 1, 1, 1] [2019-02-18 10:04:51,659 INFO L423 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:04:51,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:04:51,660 INFO L82 PathProgramCache]: Analyzing trace with hash -1302954269, now seen corresponding path program 110 times [2019-02-18 10:04:51,660 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:04:51,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:04:51,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:04:51,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:04:51,660 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:04:51,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:04:56,310 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:04:56,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:04:56,311 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:04:56,311 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:04:56,311 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:04:56,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:04:56,311 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:04:56,320 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 10:04:56,320 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 10:04:59,215 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 56 check-sat command(s) [2019-02-18 10:04:59,215 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:04:59,224 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:04:59,244 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:04:59,244 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:05:12,504 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:05:12,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:05:12,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112, 112, 112] total 223 [2019-02-18 10:05:12,528 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:05:12,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-02-18 10:05:12,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-02-18 10:05:12,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24976, Invalid=24976, Unknown=0, NotChecked=0, Total=49952 [2019-02-18 10:05:12,533 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand 113 states. [2019-02-18 10:05:12,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:05:12,924 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2019-02-18 10:05:12,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2019-02-18 10:05:12,925 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 113 [2019-02-18 10:05:12,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:05:12,925 INFO L225 Difference]: With dead ends: 117 [2019-02-18 10:05:12,925 INFO L226 Difference]: Without dead ends: 115 [2019-02-18 10:05:12,928 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.7s TimeCoverageRelationStatistics Valid=24976, Invalid=24976, Unknown=0, NotChecked=0, Total=49952 [2019-02-18 10:05:12,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-02-18 10:05:12,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2019-02-18 10:05:12,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-02-18 10:05:12,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2019-02-18 10:05:12,930 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 113 [2019-02-18 10:05:12,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:05:12,931 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2019-02-18 10:05:12,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-02-18 10:05:12,931 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2019-02-18 10:05:12,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-02-18 10:05:12,931 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:05:12,931 INFO L402 BasicCegarLoop]: trace histogram [111, 1, 1, 1] [2019-02-18 10:05:12,932 INFO L423 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:05:12,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:05:12,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1736874868, now seen corresponding path program 111 times [2019-02-18 10:05:12,932 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:05:12,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:05:12,933 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:05:12,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:05:12,933 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:05:12,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat