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/array1.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b7bd044-m [2019-01-18 17:52:58,559 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-18 17:52:58,561 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-18 17:52:58,579 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-18 17:52:58,579 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-18 17:52:58,580 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-18 17:52:58,582 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-18 17:52:58,585 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-18 17:52:58,587 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-18 17:52:58,588 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-18 17:52:58,589 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-18 17:52:58,589 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-18 17:52:58,590 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-18 17:52:58,591 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-18 17:52:58,592 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-18 17:52:58,593 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-18 17:52:58,594 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-18 17:52:58,596 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-18 17:52:58,598 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-18 17:52:58,600 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-18 17:52:58,602 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-18 17:52:58,603 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-18 17:52:58,605 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-18 17:52:58,605 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-18 17:52:58,606 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-18 17:52:58,607 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-18 17:52:58,608 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-18 17:52:58,608 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-18 17:52:58,609 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-18 17:52:58,610 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-18 17:52:58,610 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-18 17:52:58,611 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-18 17:52:58,611 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-18 17:52:58,612 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-18 17:52:58,613 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-18 17:52:58,613 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-18 17:52:58,614 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2019-01-18 17:52:58,627 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-18 17:52:58,628 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-18 17:52:58,629 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-18 17:52:58,630 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-18 17:52:58,630 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-18 17:52:58,630 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-18 17:52:58,631 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-18 17:52:58,631 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-18 17:52:58,631 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-18 17:52:58,631 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-01-18 17:52:58,631 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-01-18 17:52:58,632 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-18 17:52:58,632 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-18 17:52:58,633 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-18 17:52:58,633 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-18 17:52:58,633 INFO L133 SettingsManager]: * Use SBE=true [2019-01-18 17:52:58,634 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-18 17:52:58,635 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-18 17:52:58,635 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-18 17:52:58,636 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-18 17:52:58,636 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-18 17:52:58,636 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-18 17:52:58,636 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-18 17:52:58,636 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-18 17:52:58,637 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-18 17:52:58,637 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-18 17:52:58,637 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-18 17:52:58,637 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-18 17:52:58,638 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-18 17:52:58,638 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-18 17:52:58,638 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-18 17:52:58,638 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-18 17:52:58,638 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-18 17:52:58,639 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-18 17:52:58,639 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-18 17:52:58,639 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-18 17:52:58,640 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-18 17:52:58,640 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-18 17:52:58,640 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-18 17:52:58,678 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-18 17:52:58,691 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-18 17:52:58,694 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-18 17:52:58,696 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-18 17:52:58,697 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-18 17:52:58,697 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array1.i_3.bpl [2019-01-18 17:52:58,698 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array1.i_3.bpl' [2019-01-18 17:52:58,731 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-18 17:52:58,732 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-18 17:52:58,733 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-18 17:52:58,733 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-18 17:52:58,734 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-18 17:52:58,750 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:52:58" (1/1) ... [2019-01-18 17:52:58,762 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:52:58" (1/1) ... [2019-01-18 17:52:58,770 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-18 17:52:58,771 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-18 17:52:58,771 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-18 17:52:58,771 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-18 17:52:58,783 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:52:58" (1/1) ... [2019-01-18 17:52:58,783 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:52:58" (1/1) ... [2019-01-18 17:52:58,784 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:52:58" (1/1) ... [2019-01-18 17:52:58,784 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:52:58" (1/1) ... [2019-01-18 17:52:58,788 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:52:58" (1/1) ... [2019-01-18 17:52:58,790 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:52:58" (1/1) ... [2019-01-18 17:52:58,791 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:52:58" (1/1) ... [2019-01-18 17:52:58,792 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-18 17:52:58,792 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-18 17:52:58,793 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-18 17:52:58,793 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-18 17:52:58,794 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:52:58" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-18 17:52:58,865 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-18 17:52:58,866 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-18 17:52:59,097 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-18 17:52:59,098 INFO L286 CfgBuilder]: Removed 1 assue(true) statements. [2019-01-18 17:52:59,100 INFO L202 PluginConnector]: Adding new model array1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 05:52:59 BoogieIcfgContainer [2019-01-18 17:52:59,102 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-18 17:52:59,103 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-18 17:52:59,104 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-18 17:52:59,107 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-18 17:52:59,107 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:52:58" (1/2) ... [2019-01-18 17:52:59,108 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e60d7ab and model type array1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.01 05:52:59, skipping insertion in model container [2019-01-18 17:52:59,108 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 05:52:59" (2/2) ... [2019-01-18 17:52:59,110 INFO L112 eAbstractionObserver]: Analyzing ICFG array1.i_3.bpl [2019-01-18 17:52:59,121 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-18 17:52:59,130 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-18 17:52:59,148 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-18 17:52:59,193 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-18 17:52:59,194 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-18 17:52:59,194 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-18 17:52:59,194 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-18 17:52:59,194 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-18 17:52:59,194 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-18 17:52:59,194 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-18 17:52:59,195 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-18 17:52:59,210 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-01-18 17:52:59,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-18 17:52:59,219 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:52:59,220 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-18 17:52:59,222 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:52:59,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:52:59,229 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2019-01-18 17:52:59,231 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:52:59,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:52:59,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:52:59,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:52:59,279 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:52:59,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:52:59,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:52:59,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-18 17:52:59,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-18 17:52:59,375 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-18 17:52:59,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-18 17:52:59,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-18 17:52:59,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-18 17:52:59,394 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2019-01-18 17:52:59,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:52:59,435 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2019-01-18 17:52:59,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-18 17:52:59,438 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-18 17:52:59,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:52:59,450 INFO L225 Difference]: With dead ends: 9 [2019-01-18 17:52:59,450 INFO L226 Difference]: Without dead ends: 5 [2019-01-18 17:52:59,454 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-18 17:52:59,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-01-18 17:52:59,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-01-18 17:52:59,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-18 17:52:59,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-01-18 17:52:59,494 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-01-18 17:52:59,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:52:59,494 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-01-18 17:52:59,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-18 17:52:59,495 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-01-18 17:52:59,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-18 17:52:59,496 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:52:59,496 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-18 17:52:59,496 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:52:59,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:52:59,497 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2019-01-18 17:52:59,497 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:52:59,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:52:59,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:52:59,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:52:59,500 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:52:59,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:52:59,566 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:52:59,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:52:59,567 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:52:59,568 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-18 17:52:59,569 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [9] [2019-01-18 17:52:59,628 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 17:52:59,628 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:53:00,807 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:53:00,809 INFO L272 AbstractInterpreter]: Visited 4 different actions 20 times. Merged at 1 different actions 8 times. Widened at 1 different actions 4 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-18 17:53:00,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:00,817 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:53:00,817 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:00,817 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:00,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:53:00,835 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:53:00,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:00,883 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:00,896 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:00,897 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:01,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:01,196 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:01,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2019-01-18 17:53:01,197 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:01,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-18 17:53:01,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-18 17:53:01,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-18 17:53:01,274 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-01-18 17:53:01,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:01,369 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-01-18 17:53:01,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-18 17:53:01,369 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-18 17:53:01,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:01,370 INFO L225 Difference]: With dead ends: 8 [2019-01-18 17:53:01,370 INFO L226 Difference]: Without dead ends: 6 [2019-01-18 17:53:01,371 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-01-18 17:53:01,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-01-18 17:53:01,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-01-18 17:53:01,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-18 17:53:01,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-01-18 17:53:01,374 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-01-18 17:53:01,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:01,374 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-01-18 17:53:01,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-18 17:53:01,374 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-01-18 17:53:01,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-18 17:53:01,375 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:01,375 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-01-18 17:53:01,376 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:01,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:01,376 INFO L82 PathProgramCache]: Analyzing trace with hash 28844579, now seen corresponding path program 2 times [2019-01-18 17:53:01,376 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:01,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:01,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:53:01,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:01,378 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:01,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:01,495 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:01,495 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:01,495 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:01,496 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:01,496 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:01,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:01,496 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:01,517 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:53:01,517 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:53:01,531 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-18 17:53:01,531 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:53:01,533 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:01,535 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:01,535 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:01,635 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:01,655 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:01,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2019-01-18 17:53:01,655 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:01,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-18 17:53:01,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-18 17:53:01,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-18 17:53:01,657 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-01-18 17:53:01,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:01,688 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-01-18 17:53:01,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-18 17:53:01,689 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-01-18 17:53:01,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:01,690 INFO L225 Difference]: With dead ends: 9 [2019-01-18 17:53:01,690 INFO L226 Difference]: Without dead ends: 7 [2019-01-18 17:53:01,691 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-18 17:53:01,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-01-18 17:53:01,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-01-18 17:53:01,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-18 17:53:01,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-01-18 17:53:01,694 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-01-18 17:53:01,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:01,694 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-01-18 17:53:01,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-18 17:53:01,695 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-01-18 17:53:01,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-18 17:53:01,695 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:01,695 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-01-18 17:53:01,695 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:01,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:01,696 INFO L82 PathProgramCache]: Analyzing trace with hash 894183756, now seen corresponding path program 3 times [2019-01-18 17:53:01,696 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:01,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:01,697 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:53:01,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:01,697 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:01,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:01,992 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:01,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:01,993 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:01,993 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:01,993 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:01,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:01,993 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:02,004 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:53:02,004 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:53:02,019 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:53:02,019 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:53:02,020 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:02,024 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:02,024 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:02,442 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:02,461 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:02,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2019-01-18 17:53:02,462 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:02,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-18 17:53:02,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-18 17:53:02,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-18 17:53:02,463 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-01-18 17:53:02,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:02,489 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-01-18 17:53:02,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-18 17:53:02,490 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-01-18 17:53:02,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:02,490 INFO L225 Difference]: With dead ends: 10 [2019-01-18 17:53:02,490 INFO L226 Difference]: Without dead ends: 8 [2019-01-18 17:53:02,491 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-18 17:53:02,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-01-18 17:53:02,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-01-18 17:53:02,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-18 17:53:02,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-01-18 17:53:02,493 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-01-18 17:53:02,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:02,494 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-01-18 17:53:02,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-18 17:53:02,494 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-01-18 17:53:02,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-18 17:53:02,495 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:02,495 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-01-18 17:53:02,495 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:02,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:02,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1949894467, now seen corresponding path program 4 times [2019-01-18 17:53:02,496 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:02,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:02,497 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:53:02,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:02,497 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:02,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:02,725 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:02,725 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:02,725 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:02,725 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:02,726 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:02,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:02,726 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:02,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:53:02,736 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:53:02,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:02,747 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:02,750 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:02,751 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:02,841 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:02,861 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:02,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2019-01-18 17:53:02,861 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:02,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-18 17:53:02,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-18 17:53:02,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-18 17:53:02,862 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-01-18 17:53:02,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:02,898 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-01-18 17:53:02,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-18 17:53:02,898 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-01-18 17:53:02,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:02,899 INFO L225 Difference]: With dead ends: 11 [2019-01-18 17:53:02,899 INFO L226 Difference]: Without dead ends: 9 [2019-01-18 17:53:02,900 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-01-18 17:53:02,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-01-18 17:53:02,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-01-18 17:53:02,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-18 17:53:02,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-01-18 17:53:02,903 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-01-18 17:53:02,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:02,903 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-01-18 17:53:02,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-18 17:53:02,904 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-01-18 17:53:02,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-18 17:53:02,904 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:02,904 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-01-18 17:53:02,905 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:02,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:02,905 INFO L82 PathProgramCache]: Analyzing trace with hash 317188140, now seen corresponding path program 5 times [2019-01-18 17:53:02,905 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:02,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:02,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:53:02,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:02,906 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:02,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:03,032 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:03,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:03,033 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:03,033 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:03,033 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:03,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:03,033 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:03,043 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:53:03,044 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:53:03,085 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-18 17:53:03,086 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:53:03,087 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:03,092 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:03,093 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:03,242 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:03,261 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:03,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2019-01-18 17:53:03,261 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:03,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 17:53:03,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 17:53:03,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-01-18 17:53:03,263 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2019-01-18 17:53:03,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:03,298 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-01-18 17:53:03,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-18 17:53:03,298 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-01-18 17:53:03,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:03,299 INFO L225 Difference]: With dead ends: 12 [2019-01-18 17:53:03,299 INFO L226 Difference]: Without dead ends: 10 [2019-01-18 17:53:03,299 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-01-18 17:53:03,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-01-18 17:53:03,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-01-18 17:53:03,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-18 17:53:03,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-01-18 17:53:03,302 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-01-18 17:53:03,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:03,302 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-01-18 17:53:03,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 17:53:03,302 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-01-18 17:53:03,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-18 17:53:03,303 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:03,303 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-01-18 17:53:03,303 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:03,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:03,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1242899555, now seen corresponding path program 6 times [2019-01-18 17:53:03,303 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:03,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:03,304 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:53:03,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:03,305 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:03,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:03,677 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:03,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:03,677 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:03,677 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:03,677 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:03,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:03,678 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:03,687 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:53:03,687 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:53:03,697 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:53:03,697 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:53:03,700 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:03,704 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:03,705 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:04,088 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:04,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:04,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2019-01-18 17:53:04,109 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:04,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-18 17:53:04,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-18 17:53:04,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-01-18 17:53:04,110 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2019-01-18 17:53:04,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:04,148 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-01-18 17:53:04,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-18 17:53:04,149 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-01-18 17:53:04,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:04,150 INFO L225 Difference]: With dead ends: 13 [2019-01-18 17:53:04,150 INFO L226 Difference]: Without dead ends: 11 [2019-01-18 17:53:04,150 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-01-18 17:53:04,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-01-18 17:53:04,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-01-18 17:53:04,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-18 17:53:04,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-01-18 17:53:04,153 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-01-18 17:53:04,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:04,154 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-01-18 17:53:04,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-18 17:53:04,154 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-01-18 17:53:04,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-18 17:53:04,154 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:04,155 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-01-18 17:53:04,155 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:04,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:04,155 INFO L82 PathProgramCache]: Analyzing trace with hash -124817652, now seen corresponding path program 7 times [2019-01-18 17:53:04,155 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:04,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:04,156 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:53:04,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:04,157 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:04,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:04,297 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:04,298 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:04,298 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:04,299 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:04,299 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:04,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:04,300 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:04,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:53:04,313 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:53:04,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:04,329 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:04,334 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:04,334 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:04,558 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:04,578 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:04,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2019-01-18 17:53:04,579 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:04,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-18 17:53:04,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-18 17:53:04,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-01-18 17:53:04,580 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2019-01-18 17:53:04,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:04,616 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-01-18 17:53:04,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-18 17:53:04,622 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-01-18 17:53:04,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:04,623 INFO L225 Difference]: With dead ends: 14 [2019-01-18 17:53:04,623 INFO L226 Difference]: Without dead ends: 12 [2019-01-18 17:53:04,624 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-01-18 17:53:04,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-01-18 17:53:04,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-01-18 17:53:04,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-18 17:53:04,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-01-18 17:53:04,627 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-01-18 17:53:04,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:04,627 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-01-18 17:53:04,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-18 17:53:04,627 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-01-18 17:53:04,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-18 17:53:04,628 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:04,628 INFO L402 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-01-18 17:53:04,628 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:04,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:04,628 INFO L82 PathProgramCache]: Analyzing trace with hash 425621891, now seen corresponding path program 8 times [2019-01-18 17:53:04,629 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:04,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:04,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:53:04,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:04,630 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:04,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:04,764 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:04,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:04,764 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:04,765 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:04,765 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:04,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:04,765 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:04,779 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:53:04,780 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:53:04,798 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-01-18 17:53:04,799 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:53:04,800 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:04,806 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:04,806 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:05,225 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:05,245 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:05,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2019-01-18 17:53:05,246 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:05,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-18 17:53:05,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-18 17:53:05,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-01-18 17:53:05,247 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2019-01-18 17:53:05,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:05,288 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-01-18 17:53:05,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-18 17:53:05,289 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-01-18 17:53:05,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:05,289 INFO L225 Difference]: With dead ends: 15 [2019-01-18 17:53:05,289 INFO L226 Difference]: Without dead ends: 13 [2019-01-18 17:53:05,290 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-01-18 17:53:05,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-01-18 17:53:05,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-01-18 17:53:05,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-18 17:53:05,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-01-18 17:53:05,293 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-01-18 17:53:05,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:05,293 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-01-18 17:53:05,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-18 17:53:05,293 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-01-18 17:53:05,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-18 17:53:05,293 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:05,294 INFO L402 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2019-01-18 17:53:05,294 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:05,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:05,294 INFO L82 PathProgramCache]: Analyzing trace with hash 309378540, now seen corresponding path program 9 times [2019-01-18 17:53:05,294 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:05,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:05,295 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:53:05,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:05,295 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:05,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:05,449 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:05,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:05,450 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:05,450 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:05,450 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:05,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:05,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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:05,460 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:53:05,461 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:53:05,475 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:53:05,475 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:53:05,476 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:05,481 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:05,482 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:05,904 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:05,923 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:05,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2019-01-18 17:53:05,924 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:05,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-18 17:53:05,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-18 17:53:05,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-01-18 17:53:05,925 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2019-01-18 17:53:05,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:05,951 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-01-18 17:53:05,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-18 17:53:05,951 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-01-18 17:53:05,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:05,952 INFO L225 Difference]: With dead ends: 16 [2019-01-18 17:53:05,952 INFO L226 Difference]: Without dead ends: 14 [2019-01-18 17:53:05,953 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-01-18 17:53:05,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-01-18 17:53:05,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-01-18 17:53:05,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-18 17:53:05,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-01-18 17:53:05,957 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-01-18 17:53:05,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:05,957 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-01-18 17:53:05,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-18 17:53:05,957 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-01-18 17:53:05,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-18 17:53:05,958 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:05,958 INFO L402 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2019-01-18 17:53:05,958 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:05,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:05,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1000801955, now seen corresponding path program 10 times [2019-01-18 17:53:05,959 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:05,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:05,960 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:53:05,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:05,960 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:05,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:06,081 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:06,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:06,082 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:06,082 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:06,083 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:06,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:06,083 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:06,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:53:06,093 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:53:06,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:06,103 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:06,110 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:06,110 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:06,324 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:06,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:06,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2019-01-18 17:53:06,344 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:06,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-18 17:53:06,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-18 17:53:06,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-01-18 17:53:06,346 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2019-01-18 17:53:06,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:06,400 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-01-18 17:53:06,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-18 17:53:06,400 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-01-18 17:53:06,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:06,401 INFO L225 Difference]: With dead ends: 17 [2019-01-18 17:53:06,401 INFO L226 Difference]: Without dead ends: 15 [2019-01-18 17:53:06,402 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-01-18 17:53:06,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-01-18 17:53:06,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-01-18 17:53:06,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-18 17:53:06,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-01-18 17:53:06,405 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-01-18 17:53:06,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:06,405 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-01-18 17:53:06,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-18 17:53:06,405 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-01-18 17:53:06,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-18 17:53:06,405 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:06,406 INFO L402 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2019-01-18 17:53:06,406 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:06,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:06,406 INFO L82 PathProgramCache]: Analyzing trace with hash 960091340, now seen corresponding path program 11 times [2019-01-18 17:53:06,406 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:06,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:06,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:53:06,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:06,407 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:06,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:06,712 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:06,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:06,713 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:06,713 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:06,713 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:06,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:06,714 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:06,732 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:53:06,732 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:53:06,785 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-01-18 17:53:06,785 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:53:06,786 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:06,792 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:06,792 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:07,008 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:07,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:07,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2019-01-18 17:53:07,030 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:07,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-18 17:53:07,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-18 17:53:07,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-01-18 17:53:07,031 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2019-01-18 17:53:07,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:07,063 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-01-18 17:53:07,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-18 17:53:07,063 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-01-18 17:53:07,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:07,064 INFO L225 Difference]: With dead ends: 18 [2019-01-18 17:53:07,064 INFO L226 Difference]: Without dead ends: 16 [2019-01-18 17:53:07,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-01-18 17:53:07,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-01-18 17:53:07,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-01-18 17:53:07,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-18 17:53:07,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-01-18 17:53:07,068 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-01-18 17:53:07,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:07,068 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-01-18 17:53:07,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-18 17:53:07,069 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-01-18 17:53:07,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-18 17:53:07,069 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:07,069 INFO L402 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2019-01-18 17:53:07,070 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:07,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:07,070 INFO L82 PathProgramCache]: Analyzing trace with hash -301937725, now seen corresponding path program 12 times [2019-01-18 17:53:07,070 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:07,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:07,071 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:53:07,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:07,071 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:07,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:07,224 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:07,225 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:07,225 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:07,225 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:07,225 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:07,225 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:07,226 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:07,236 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:53:07,236 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:53:07,248 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:53:07,248 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:53:07,250 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:07,255 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:07,255 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:07,475 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:07,493 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:07,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2019-01-18 17:53:07,493 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:07,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-18 17:53:07,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-18 17:53:07,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-01-18 17:53:07,495 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2019-01-18 17:53:07,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:07,519 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-01-18 17:53:07,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-18 17:53:07,526 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-01-18 17:53:07,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:07,527 INFO L225 Difference]: With dead ends: 19 [2019-01-18 17:53:07,527 INFO L226 Difference]: Without dead ends: 17 [2019-01-18 17:53:07,527 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-01-18 17:53:07,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-18 17:53:07,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-01-18 17:53:07,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-18 17:53:07,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-01-18 17:53:07,533 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-01-18 17:53:07,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:07,533 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-01-18 17:53:07,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-18 17:53:07,534 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-01-18 17:53:07,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-18 17:53:07,534 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:07,534 INFO L402 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2019-01-18 17:53:07,534 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:07,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:07,535 INFO L82 PathProgramCache]: Analyzing trace with hash -770133076, now seen corresponding path program 13 times [2019-01-18 17:53:07,535 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:07,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:07,536 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:53:07,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:07,536 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:07,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:07,758 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:07,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:07,758 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:07,758 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:07,759 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:07,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:07,759 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:07,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:53:07,768 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:53:07,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:07,780 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:07,786 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:07,786 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:08,194 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:08,218 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:08,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2019-01-18 17:53:08,218 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:08,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-18 17:53:08,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-18 17:53:08,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-01-18 17:53:08,220 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2019-01-18 17:53:08,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:08,249 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-01-18 17:53:08,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-18 17:53:08,253 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-01-18 17:53:08,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:08,254 INFO L225 Difference]: With dead ends: 20 [2019-01-18 17:53:08,254 INFO L226 Difference]: Without dead ends: 18 [2019-01-18 17:53:08,254 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-01-18 17:53:08,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-01-18 17:53:08,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-01-18 17:53:08,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-18 17:53:08,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-01-18 17:53:08,257 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-01-18 17:53:08,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:08,258 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-01-18 17:53:08,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-18 17:53:08,258 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-01-18 17:53:08,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-18 17:53:08,259 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:08,259 INFO L402 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2019-01-18 17:53:08,259 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:08,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:08,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1895680227, now seen corresponding path program 14 times [2019-01-18 17:53:08,259 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:08,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:08,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:53:08,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:08,260 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:08,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:08,649 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:08,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:08,650 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:08,650 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:08,650 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:08,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:08,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 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:08,659 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:53:08,660 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:53:08,678 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-01-18 17:53:08,678 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:53:08,680 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:08,686 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:08,686 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:09,044 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:09,063 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:09,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2019-01-18 17:53:09,063 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:09,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-18 17:53:09,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-18 17:53:09,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-01-18 17:53:09,065 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2019-01-18 17:53:09,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:09,104 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-01-18 17:53:09,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-18 17:53:09,105 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-01-18 17:53:09,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:09,106 INFO L225 Difference]: With dead ends: 21 [2019-01-18 17:53:09,106 INFO L226 Difference]: Without dead ends: 19 [2019-01-18 17:53:09,107 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-01-18 17:53:09,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-01-18 17:53:09,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-01-18 17:53:09,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-18 17:53:09,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-01-18 17:53:09,111 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-01-18 17:53:09,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:09,111 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-01-18 17:53:09,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-18 17:53:09,112 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-01-18 17:53:09,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-18 17:53:09,112 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:09,112 INFO L402 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2019-01-18 17:53:09,113 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:09,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:09,113 INFO L82 PathProgramCache]: Analyzing trace with hash -1363453300, now seen corresponding path program 15 times [2019-01-18 17:53:09,113 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:09,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:09,114 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:53:09,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:09,114 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:09,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:09,354 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:09,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:09,354 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:09,354 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:09,354 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:09,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:09,354 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:09,364 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:53:09,364 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:53:09,375 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:53:09,375 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:53:09,377 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:09,384 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:09,384 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:09,919 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:09,939 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:09,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2019-01-18 17:53:09,939 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:09,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-18 17:53:09,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-18 17:53:09,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-01-18 17:53:09,941 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2019-01-18 17:53:09,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:09,972 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-01-18 17:53:09,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-18 17:53:09,972 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-01-18 17:53:09,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:09,973 INFO L225 Difference]: With dead ends: 22 [2019-01-18 17:53:09,974 INFO L226 Difference]: Without dead ends: 20 [2019-01-18 17:53:09,975 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-01-18 17:53:09,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-01-18 17:53:09,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-01-18 17:53:09,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-18 17:53:09,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-01-18 17:53:09,980 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-01-18 17:53:09,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:09,980 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-01-18 17:53:09,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-18 17:53:09,980 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-01-18 17:53:09,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-18 17:53:09,981 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:09,981 INFO L402 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2019-01-18 17:53:09,981 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:09,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:09,981 INFO L82 PathProgramCache]: Analyzing trace with hash 682622467, now seen corresponding path program 16 times [2019-01-18 17:53:09,981 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:09,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:09,982 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:53:09,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:09,982 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:09,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:10,700 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:10,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:10,701 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:10,701 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:10,701 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:10,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:10,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 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:10,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:53:10,722 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:53:10,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:10,739 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:10,745 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:10,746 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:11,404 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:11,423 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:11,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2019-01-18 17:53:11,423 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:11,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-01-18 17:53:11,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-01-18 17:53:11,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-01-18 17:53:11,425 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2019-01-18 17:53:11,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:11,451 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-01-18 17:53:11,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-18 17:53:11,452 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-01-18 17:53:11,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:11,453 INFO L225 Difference]: With dead ends: 23 [2019-01-18 17:53:11,453 INFO L226 Difference]: Without dead ends: 21 [2019-01-18 17:53:11,454 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-01-18 17:53:11,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-01-18 17:53:11,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-01-18 17:53:11,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-18 17:53:11,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-01-18 17:53:11,457 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-01-18 17:53:11,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:11,457 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-01-18 17:53:11,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-01-18 17:53:11,457 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-01-18 17:53:11,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-18 17:53:11,458 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:11,458 INFO L402 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2019-01-18 17:53:11,458 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:11,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:11,459 INFO L82 PathProgramCache]: Analyzing trace with hash -313538196, now seen corresponding path program 17 times [2019-01-18 17:53:11,459 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:11,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:11,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:53:11,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:11,460 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:11,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:11,674 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:11,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:11,674 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:11,675 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:11,675 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:11,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:11,675 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:11,686 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:53:11,686 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:53:11,708 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-01-18 17:53:11,708 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:53:11,709 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:11,716 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:11,717 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:12,697 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:12,716 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:12,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2019-01-18 17:53:12,716 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:12,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-18 17:53:12,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-18 17:53:12,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-01-18 17:53:12,718 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2019-01-18 17:53:12,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:12,744 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-01-18 17:53:12,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-18 17:53:12,745 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-01-18 17:53:12,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:12,745 INFO L225 Difference]: With dead ends: 24 [2019-01-18 17:53:12,746 INFO L226 Difference]: Without dead ends: 22 [2019-01-18 17:53:12,747 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-01-18 17:53:12,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-01-18 17:53:12,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-01-18 17:53:12,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-18 17:53:12,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-01-18 17:53:12,751 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-01-18 17:53:12,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:12,752 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-01-18 17:53:12,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-18 17:53:12,752 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-01-18 17:53:12,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-18 17:53:12,753 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:12,753 INFO L402 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2019-01-18 17:53:12,753 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:12,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:12,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1129747677, now seen corresponding path program 18 times [2019-01-18 17:53:12,754 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:12,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:12,755 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:53:12,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:12,755 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:12,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:13,538 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:13,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:13,538 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:13,538 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:13,539 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:13,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:13,543 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:13,552 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:53:13,552 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:53:13,567 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:53:13,568 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:53:13,569 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:13,576 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:13,576 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:14,043 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:14,064 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:14,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2019-01-18 17:53:14,064 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:14,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-01-18 17:53:14,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-18 17:53:14,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-01-18 17:53:14,066 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2019-01-18 17:53:14,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:14,101 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-01-18 17:53:14,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-18 17:53:14,101 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-01-18 17:53:14,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:14,102 INFO L225 Difference]: With dead ends: 25 [2019-01-18 17:53:14,103 INFO L226 Difference]: Without dead ends: 23 [2019-01-18 17:53:14,104 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-01-18 17:53:14,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-01-18 17:53:14,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-01-18 17:53:14,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-18 17:53:14,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-01-18 17:53:14,108 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-01-18 17:53:14,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:14,108 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-01-18 17:53:14,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-01-18 17:53:14,108 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-01-18 17:53:14,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-18 17:53:14,109 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:14,109 INFO L402 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2019-01-18 17:53:14,109 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:14,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:14,110 INFO L82 PathProgramCache]: Analyzing trace with hash -662437812, now seen corresponding path program 19 times [2019-01-18 17:53:14,110 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:14,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:14,111 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:53:14,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:14,111 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:14,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:14,327 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:14,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:14,328 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:14,328 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:14,328 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:14,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:14,328 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:14,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:53:14,340 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:53:14,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:14,358 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:14,363 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:14,363 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:14,825 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:14,844 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:14,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2019-01-18 17:53:14,844 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:14,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-18 17:53:14,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-18 17:53:14,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-01-18 17:53:14,845 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2019-01-18 17:53:14,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:14,916 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-01-18 17:53:14,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-18 17:53:14,919 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-01-18 17:53:14,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:14,919 INFO L225 Difference]: With dead ends: 26 [2019-01-18 17:53:14,920 INFO L226 Difference]: Without dead ends: 24 [2019-01-18 17:53:14,920 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-01-18 17:53:14,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-01-18 17:53:14,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-01-18 17:53:14,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-18 17:53:14,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-01-18 17:53:14,923 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-01-18 17:53:14,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:14,923 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-01-18 17:53:14,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-18 17:53:14,923 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-01-18 17:53:14,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-18 17:53:14,924 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:14,924 INFO L402 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2019-01-18 17:53:14,924 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:14,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:14,925 INFO L82 PathProgramCache]: Analyzing trace with hash 939266115, now seen corresponding path program 20 times [2019-01-18 17:53:14,925 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:14,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:14,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:53:14,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:14,926 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:14,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:15,199 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:15,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:15,200 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:15,200 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:15,200 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:15,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:15,200 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:15,210 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:53:15,210 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:53:15,237 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-01-18 17:53:15,237 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:53:15,239 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:15,245 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:15,246 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:15,877 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:15,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:15,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2019-01-18 17:53:15,899 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:15,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-18 17:53:15,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-18 17:53:15,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-01-18 17:53:15,901 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2019-01-18 17:53:15,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:15,976 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-01-18 17:53:15,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-18 17:53:15,977 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-01-18 17:53:15,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:15,977 INFO L225 Difference]: With dead ends: 27 [2019-01-18 17:53:15,977 INFO L226 Difference]: Without dead ends: 25 [2019-01-18 17:53:15,979 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-01-18 17:53:15,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-01-18 17:53:15,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-01-18 17:53:15,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-18 17:53:15,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-01-18 17:53:15,982 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-01-18 17:53:15,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:15,982 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-01-18 17:53:15,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-18 17:53:15,983 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-01-18 17:53:15,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-18 17:53:15,983 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:15,984 INFO L402 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2019-01-18 17:53:15,984 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:15,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:15,984 INFO L82 PathProgramCache]: Analyzing trace with hash -947519700, now seen corresponding path program 21 times [2019-01-18 17:53:15,984 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:15,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:15,985 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:53:15,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:15,985 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:15,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:16,242 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:16,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:16,242 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:16,243 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:16,243 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:16,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:16,243 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:16,254 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:53:16,254 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:53:16,288 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:53:16,288 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:53:16,290 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:16,297 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:16,298 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:17,080 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:17,100 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:17,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2019-01-18 17:53:17,100 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:17,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-01-18 17:53:17,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-18 17:53:17,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-01-18 17:53:17,102 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2019-01-18 17:53:17,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:17,208 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-01-18 17:53:17,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-01-18 17:53:17,211 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-01-18 17:53:17,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:17,212 INFO L225 Difference]: With dead ends: 28 [2019-01-18 17:53:17,212 INFO L226 Difference]: Without dead ends: 26 [2019-01-18 17:53:17,213 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-01-18 17:53:17,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-01-18 17:53:17,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-01-18 17:53:17,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-18 17:53:17,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-01-18 17:53:17,217 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-01-18 17:53:17,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:17,217 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-01-18 17:53:17,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-01-18 17:53:17,217 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-01-18 17:53:17,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-18 17:53:17,218 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:17,218 INFO L402 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2019-01-18 17:53:17,218 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:17,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:17,218 INFO L82 PathProgramCache]: Analyzing trace with hash 691662179, now seen corresponding path program 22 times [2019-01-18 17:53:17,218 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:17,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:17,219 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:53:17,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:17,219 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:17,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:18,258 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:18,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:18,259 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:18,259 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:18,259 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:18,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:18,259 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:18,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:53:18,268 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:53:18,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:18,285 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:18,291 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:18,291 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:18,871 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:18,890 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:18,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2019-01-18 17:53:18,891 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:18,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-01-18 17:53:18,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-01-18 17:53:18,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-01-18 17:53:18,892 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2019-01-18 17:53:18,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:18,926 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-01-18 17:53:18,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-01-18 17:53:18,928 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2019-01-18 17:53:18,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:18,928 INFO L225 Difference]: With dead ends: 29 [2019-01-18 17:53:18,928 INFO L226 Difference]: Without dead ends: 27 [2019-01-18 17:53:18,929 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-01-18 17:53:18,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-01-18 17:53:18,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-01-18 17:53:18,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-18 17:53:18,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-01-18 17:53:18,933 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-01-18 17:53:18,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:18,933 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-01-18 17:53:18,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-01-18 17:53:18,934 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-01-18 17:53:18,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-18 17:53:18,934 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:18,934 INFO L402 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2019-01-18 17:53:18,935 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:18,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:18,935 INFO L82 PathProgramCache]: Analyzing trace with hash -33307124, now seen corresponding path program 23 times [2019-01-18 17:53:18,935 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:18,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:18,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:53:18,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:18,936 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:18,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:19,434 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:19,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:19,434 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:19,434 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:19,435 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:19,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:19,435 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:19,445 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:53:19,445 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:53:19,477 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-01-18 17:53:19,478 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:53:19,479 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:19,486 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:19,486 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:20,280 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:20,301 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:20,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2019-01-18 17:53:20,301 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:20,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-01-18 17:53:20,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-01-18 17:53:20,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-01-18 17:53:20,303 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2019-01-18 17:53:20,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:20,350 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-01-18 17:53:20,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-18 17:53:20,350 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-01-18 17:53:20,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:20,351 INFO L225 Difference]: With dead ends: 30 [2019-01-18 17:53:20,351 INFO L226 Difference]: Without dead ends: 28 [2019-01-18 17:53:20,354 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-01-18 17:53:20,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-01-18 17:53:20,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-01-18 17:53:20,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-18 17:53:20,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-01-18 17:53:20,358 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-01-18 17:53:20,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:20,358 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-01-18 17:53:20,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-01-18 17:53:20,358 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-01-18 17:53:20,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-18 17:53:20,359 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:20,359 INFO L402 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2019-01-18 17:53:20,359 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:20,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:20,359 INFO L82 PathProgramCache]: Analyzing trace with hash -1032519037, now seen corresponding path program 24 times [2019-01-18 17:53:20,360 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:20,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:20,360 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:53:20,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:20,361 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:20,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:20,738 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:20,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:20,738 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:20,738 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:20,738 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:20,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:20,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 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:20,747 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:53:20,747 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:53:20,764 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:53:20,764 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:53:20,768 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:20,778 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:20,779 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:22,292 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:22,311 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:22,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2019-01-18 17:53:22,312 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:22,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-01-18 17:53:22,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-01-18 17:53:22,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-01-18 17:53:22,313 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2019-01-18 17:53:22,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:22,367 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-01-18 17:53:22,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-01-18 17:53:22,368 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2019-01-18 17:53:22,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:22,369 INFO L225 Difference]: With dead ends: 31 [2019-01-18 17:53:22,369 INFO L226 Difference]: Without dead ends: 29 [2019-01-18 17:53:22,370 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-01-18 17:53:22,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-18 17:53:22,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-01-18 17:53:22,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-18 17:53:22,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-01-18 17:53:22,377 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-01-18 17:53:22,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:22,377 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-01-18 17:53:22,377 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-01-18 17:53:22,377 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-01-18 17:53:22,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-18 17:53:22,378 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:22,378 INFO L402 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2019-01-18 17:53:22,378 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:22,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:22,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1943317268, now seen corresponding path program 25 times [2019-01-18 17:53:22,379 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:22,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:22,379 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:53:22,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:22,380 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:22,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:22,740 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:22,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:22,740 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:22,740 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:22,740 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:22,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:22,740 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:22,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:53:22,750 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:53:22,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:22,771 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:22,779 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:22,779 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:23,554 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:23,574 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:23,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2019-01-18 17:53:23,575 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:23,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-01-18 17:53:23,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-01-18 17:53:23,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-01-18 17:53:23,577 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2019-01-18 17:53:23,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:23,684 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-01-18 17:53:23,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-01-18 17:53:23,685 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2019-01-18 17:53:23,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:23,685 INFO L225 Difference]: With dead ends: 32 [2019-01-18 17:53:23,686 INFO L226 Difference]: Without dead ends: 30 [2019-01-18 17:53:23,687 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-01-18 17:53:23,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-01-18 17:53:23,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-01-18 17:53:23,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-18 17:53:23,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-01-18 17:53:23,689 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-01-18 17:53:23,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:23,690 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-01-18 17:53:23,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-01-18 17:53:23,691 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-01-18 17:53:23,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-18 17:53:23,692 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:23,692 INFO L402 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2019-01-18 17:53:23,692 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:23,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:23,692 INFO L82 PathProgramCache]: Analyzing trace with hash -113291357, now seen corresponding path program 26 times [2019-01-18 17:53:23,692 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:23,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:23,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:53:23,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:23,693 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:23,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:24,459 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:24,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:24,459 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:24,460 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:24,460 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:24,460 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:24,460 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:24,475 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:53:24,476 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:53:24,518 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-01-18 17:53:24,518 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:53:24,520 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:24,527 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:24,527 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:25,315 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:25,334 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:25,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2019-01-18 17:53:25,334 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:25,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-01-18 17:53:25,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-01-18 17:53:25,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-01-18 17:53:25,336 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2019-01-18 17:53:25,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:25,491 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-01-18 17:53:25,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-01-18 17:53:25,492 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2019-01-18 17:53:25,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:25,492 INFO L225 Difference]: With dead ends: 33 [2019-01-18 17:53:25,493 INFO L226 Difference]: Without dead ends: 31 [2019-01-18 17:53:25,494 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-01-18 17:53:25,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-01-18 17:53:25,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-01-18 17:53:25,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-18 17:53:25,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-01-18 17:53:25,498 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-01-18 17:53:25,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:25,498 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-01-18 17:53:25,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-01-18 17:53:25,498 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-01-18 17:53:25,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-18 17:53:25,499 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:25,499 INFO L402 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2019-01-18 17:53:25,499 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:25,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:25,499 INFO L82 PathProgramCache]: Analyzing trace with hash 782937036, now seen corresponding path program 27 times [2019-01-18 17:53:25,499 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:25,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:25,500 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:53:25,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:25,500 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:25,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:26,486 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:26,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:26,486 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:26,486 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:26,486 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:26,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:26,486 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:26,503 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:53:26,503 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:53:26,526 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:53:26,527 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:53:26,532 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:26,540 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:26,541 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:27,517 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:27,536 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:27,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2019-01-18 17:53:27,536 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:27,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-01-18 17:53:27,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-01-18 17:53:27,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-01-18 17:53:27,538 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2019-01-18 17:53:27,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:27,572 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-01-18 17:53:27,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-01-18 17:53:27,573 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2019-01-18 17:53:27,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:27,573 INFO L225 Difference]: With dead ends: 34 [2019-01-18 17:53:27,573 INFO L226 Difference]: Without dead ends: 32 [2019-01-18 17:53:27,574 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-01-18 17:53:27,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-01-18 17:53:27,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-01-18 17:53:27,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-18 17:53:27,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-01-18 17:53:27,579 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-01-18 17:53:27,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:27,579 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-01-18 17:53:27,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-01-18 17:53:27,580 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-01-18 17:53:27,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-18 17:53:27,580 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:27,580 INFO L402 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2019-01-18 17:53:27,581 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:27,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:27,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1498753853, now seen corresponding path program 28 times [2019-01-18 17:53:27,581 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:27,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:27,582 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:53:27,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:27,582 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:27,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:27,985 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:27,985 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:27,985 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:27,985 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:27,986 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:27,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:27,986 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:27,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:53:28,000 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:53:28,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:28,022 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:28,028 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:28,029 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:28,966 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:28,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:28,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 59 [2019-01-18 17:53:28,985 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:28,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-01-18 17:53:28,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-01-18 17:53:28,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-01-18 17:53:28,987 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2019-01-18 17:53:29,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:29,061 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-01-18 17:53:29,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-01-18 17:53:29,062 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2019-01-18 17:53:29,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:29,062 INFO L225 Difference]: With dead ends: 35 [2019-01-18 17:53:29,062 INFO L226 Difference]: Without dead ends: 33 [2019-01-18 17:53:29,063 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-01-18 17:53:29,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-01-18 17:53:29,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-01-18 17:53:29,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-18 17:53:29,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-01-18 17:53:29,067 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-01-18 17:53:29,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:29,067 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-01-18 17:53:29,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-01-18 17:53:29,067 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-01-18 17:53:29,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-18 17:53:29,068 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:29,068 INFO L402 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2019-01-18 17:53:29,068 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:29,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:29,069 INFO L82 PathProgramCache]: Analyzing trace with hash 783272620, now seen corresponding path program 29 times [2019-01-18 17:53:29,069 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:29,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:29,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:53:29,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:29,070 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:29,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:29,606 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:29,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:29,606 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:29,606 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:29,606 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:29,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:29,607 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:29,616 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:53:29,616 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:53:29,669 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-01-18 17:53:29,669 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:53:29,672 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:29,680 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:29,681 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:30,666 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:30,686 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:30,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2019-01-18 17:53:30,686 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:30,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-01-18 17:53:30,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-01-18 17:53:30,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-01-18 17:53:30,688 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2019-01-18 17:53:30,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:30,744 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-01-18 17:53:30,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-18 17:53:30,745 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2019-01-18 17:53:30,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:30,745 INFO L225 Difference]: With dead ends: 36 [2019-01-18 17:53:30,746 INFO L226 Difference]: Without dead ends: 34 [2019-01-18 17:53:30,747 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-01-18 17:53:30,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-01-18 17:53:30,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-01-18 17:53:30,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-01-18 17:53:30,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-01-18 17:53:30,749 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-01-18 17:53:30,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:30,750 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-01-18 17:53:30,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-01-18 17:53:30,750 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-01-18 17:53:30,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-18 17:53:30,750 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:30,750 INFO L402 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2019-01-18 17:53:30,750 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:30,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:30,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1488350749, now seen corresponding path program 30 times [2019-01-18 17:53:30,751 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:30,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:30,752 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:53:30,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:30,752 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:30,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:31,591 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:31,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:31,591 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:31,592 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:31,592 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:31,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:31,592 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:31,608 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:53:31,608 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:53:31,630 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:53:31,630 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:53:31,632 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:31,641 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:31,641 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:32,680 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:32,700 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:32,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2019-01-18 17:53:32,700 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:32,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-01-18 17:53:32,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-01-18 17:53:32,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-01-18 17:53:32,702 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2019-01-18 17:53:32,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:32,790 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-01-18 17:53:32,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-01-18 17:53:32,790 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2019-01-18 17:53:32,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:32,790 INFO L225 Difference]: With dead ends: 37 [2019-01-18 17:53:32,790 INFO L226 Difference]: Without dead ends: 35 [2019-01-18 17:53:32,791 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-01-18 17:53:32,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-18 17:53:32,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-01-18 17:53:32,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-18 17:53:32,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-01-18 17:53:32,794 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-01-18 17:53:32,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:32,794 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-01-18 17:53:32,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-01-18 17:53:32,795 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-01-18 17:53:32,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-18 17:53:32,795 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:32,795 INFO L402 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2019-01-18 17:53:32,795 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:32,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:32,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1105768844, now seen corresponding path program 31 times [2019-01-18 17:53:32,796 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:32,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:32,796 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:53:32,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:32,796 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:32,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:33,278 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:33,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:33,278 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:33,278 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:33,278 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:33,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:33,278 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:33,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:53:33,290 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:53:33,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:33,313 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:33,327 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:33,327 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:34,454 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:34,474 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:34,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2019-01-18 17:53:34,474 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:34,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-01-18 17:53:34,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-01-18 17:53:34,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-01-18 17:53:34,476 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2019-01-18 17:53:34,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:34,543 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-01-18 17:53:34,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-01-18 17:53:34,543 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2019-01-18 17:53:34,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:34,544 INFO L225 Difference]: With dead ends: 38 [2019-01-18 17:53:34,544 INFO L226 Difference]: Without dead ends: 36 [2019-01-18 17:53:34,546 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-01-18 17:53:34,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-18 17:53:34,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-01-18 17:53:34,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-18 17:53:34,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-01-18 17:53:34,549 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-01-18 17:53:34,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:34,549 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-01-18 17:53:34,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-01-18 17:53:34,549 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-01-18 17:53:34,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-18 17:53:34,550 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:34,550 INFO L402 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2019-01-18 17:53:34,550 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:34,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:34,551 INFO L82 PathProgramCache]: Analyzing trace with hash -80902397, now seen corresponding path program 32 times [2019-01-18 17:53:34,551 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:34,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:34,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:53:34,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:34,552 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:34,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:35,070 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:35,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:35,071 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:35,071 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:35,071 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:35,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:35,072 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:35,091 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:53:35,091 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:53:35,156 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-01-18 17:53:35,156 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:53:35,159 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:35,167 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:35,167 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:36,727 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:36,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:36,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 67 [2019-01-18 17:53:36,746 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:36,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-01-18 17:53:36,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-01-18 17:53:36,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-01-18 17:53:36,748 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2019-01-18 17:53:36,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:36,815 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-01-18 17:53:36,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-01-18 17:53:36,816 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2019-01-18 17:53:36,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:36,816 INFO L225 Difference]: With dead ends: 39 [2019-01-18 17:53:36,816 INFO L226 Difference]: Without dead ends: 37 [2019-01-18 17:53:36,817 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-01-18 17:53:36,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-01-18 17:53:36,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-01-18 17:53:36,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-18 17:53:36,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-01-18 17:53:36,821 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-01-18 17:53:36,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:36,821 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-01-18 17:53:36,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-01-18 17:53:36,821 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-01-18 17:53:36,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-18 17:53:36,821 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:36,822 INFO L402 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2019-01-18 17:53:36,822 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:36,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:36,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1786994796, now seen corresponding path program 33 times [2019-01-18 17:53:36,822 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:36,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:36,823 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:53:36,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:36,823 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:36,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:37,311 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:37,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:37,311 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:37,311 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:37,311 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:37,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:37,312 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:37,321 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:53:37,321 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:53:37,344 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:53:37,344 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:53:37,347 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:37,356 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:37,356 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:38,698 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:38,717 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:38,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2019-01-18 17:53:38,717 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:38,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-01-18 17:53:38,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-01-18 17:53:38,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-01-18 17:53:38,719 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2019-01-18 17:53:38,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:38,818 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-01-18 17:53:38,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-01-18 17:53:38,819 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2019-01-18 17:53:38,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:38,820 INFO L225 Difference]: With dead ends: 40 [2019-01-18 17:53:38,820 INFO L226 Difference]: Without dead ends: 38 [2019-01-18 17:53:38,820 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-01-18 17:53:38,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-18 17:53:38,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-01-18 17:53:38,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-18 17:53:38,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-01-18 17:53:38,824 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-01-18 17:53:38,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:38,824 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-01-18 17:53:38,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-01-18 17:53:38,824 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-01-18 17:53:38,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-18 17:53:38,825 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:38,825 INFO L402 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2019-01-18 17:53:38,825 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:38,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:38,825 INFO L82 PathProgramCache]: Analyzing trace with hash -437734365, now seen corresponding path program 34 times [2019-01-18 17:53:38,825 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:38,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:38,826 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:53:38,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:38,826 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:38,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:39,402 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:39,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:39,402 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:39,403 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:39,403 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:39,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:39,403 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:39,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:53:39,412 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:53:39,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:39,447 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:39,455 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:39,456 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:40,850 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:40,871 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:40,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 71 [2019-01-18 17:53:40,871 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:40,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-01-18 17:53:40,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-01-18 17:53:40,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-01-18 17:53:40,872 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2019-01-18 17:53:40,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:40,944 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-01-18 17:53:40,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-01-18 17:53:40,945 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2019-01-18 17:53:40,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:40,946 INFO L225 Difference]: With dead ends: 41 [2019-01-18 17:53:40,946 INFO L226 Difference]: Without dead ends: 39 [2019-01-18 17:53:40,946 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-01-18 17:53:40,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-01-18 17:53:40,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-01-18 17:53:40,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-18 17:53:40,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-01-18 17:53:40,950 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-01-18 17:53:40,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:40,950 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-01-18 17:53:40,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-01-18 17:53:40,950 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-01-18 17:53:40,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-01-18 17:53:40,951 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:40,951 INFO L402 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2019-01-18 17:53:40,951 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:40,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:40,952 INFO L82 PathProgramCache]: Analyzing trace with hash -684861620, now seen corresponding path program 35 times [2019-01-18 17:53:40,952 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:40,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:40,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:53:40,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:40,953 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:40,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:41,800 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:41,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:41,801 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:41,801 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:41,801 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:41,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:41,801 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:41,810 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:53:41,811 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:53:41,890 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2019-01-18 17:53:41,890 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:53:41,893 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:41,903 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:41,903 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:43,354 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:43,374 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:43,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2019-01-18 17:53:43,374 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:43,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-01-18 17:53:43,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-01-18 17:53:43,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-01-18 17:53:43,375 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2019-01-18 17:53:43,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:43,426 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-01-18 17:53:43,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-01-18 17:53:43,427 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2019-01-18 17:53:43,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:43,428 INFO L225 Difference]: With dead ends: 42 [2019-01-18 17:53:43,428 INFO L226 Difference]: Without dead ends: 40 [2019-01-18 17:53:43,428 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-01-18 17:53:43,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-01-18 17:53:43,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-01-18 17:53:43,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-18 17:53:43,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-01-18 17:53:43,431 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-01-18 17:53:43,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:43,432 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-01-18 17:53:43,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-01-18 17:53:43,432 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-01-18 17:53:43,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-18 17:53:43,432 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:43,432 INFO L402 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2019-01-18 17:53:43,432 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:43,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:43,433 INFO L82 PathProgramCache]: Analyzing trace with hash 244128067, now seen corresponding path program 36 times [2019-01-18 17:53:43,433 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:43,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:43,433 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:53:43,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:43,433 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:43,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:44,219 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:44,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:44,220 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:44,220 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:44,220 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:44,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:44,220 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:44,229 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:53:44,230 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:53:44,257 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:53:44,257 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:53:44,259 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:44,267 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:44,267 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:45,761 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:45,780 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:45,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 75 [2019-01-18 17:53:45,780 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:45,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-01-18 17:53:45,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-01-18 17:53:45,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-01-18 17:53:45,781 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2019-01-18 17:53:45,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:45,839 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-01-18 17:53:45,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-01-18 17:53:45,839 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2019-01-18 17:53:45,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:45,840 INFO L225 Difference]: With dead ends: 43 [2019-01-18 17:53:45,840 INFO L226 Difference]: Without dead ends: 41 [2019-01-18 17:53:45,840 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-01-18 17:53:45,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-18 17:53:45,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-01-18 17:53:45,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-18 17:53:45,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-01-18 17:53:45,842 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-01-18 17:53:45,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:45,842 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-01-18 17:53:45,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-01-18 17:53:45,842 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-01-18 17:53:45,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-01-18 17:53:45,843 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:45,843 INFO L402 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2019-01-18 17:53:45,843 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:45,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:45,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1021962708, now seen corresponding path program 37 times [2019-01-18 17:53:45,843 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:45,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:45,844 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:53:45,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:45,845 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:45,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:46,797 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:46,798 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:46,798 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:46,798 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:46,798 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:46,798 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:46,798 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:46,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:53:46,807 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:53:46,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:46,843 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:46,852 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:46,852 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:48,358 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:48,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:48,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 77 [2019-01-18 17:53:48,378 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:48,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-01-18 17:53:48,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-01-18 17:53:48,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-01-18 17:53:48,379 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2019-01-18 17:53:48,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:48,446 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-01-18 17:53:48,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-01-18 17:53:48,446 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2019-01-18 17:53:48,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:48,447 INFO L225 Difference]: With dead ends: 44 [2019-01-18 17:53:48,447 INFO L226 Difference]: Without dead ends: 42 [2019-01-18 17:53:48,448 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-01-18 17:53:48,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-01-18 17:53:48,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-01-18 17:53:48,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-18 17:53:48,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-01-18 17:53:48,451 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2019-01-18 17:53:48,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:48,451 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-01-18 17:53:48,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-01-18 17:53:48,451 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-01-18 17:53:48,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-01-18 17:53:48,452 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:48,452 INFO L402 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2019-01-18 17:53:48,452 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:48,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:48,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1616071069, now seen corresponding path program 38 times [2019-01-18 17:53:48,452 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:48,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:48,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:53:48,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:48,453 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:48,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:49,092 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:49,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:49,093 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:49,093 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:49,093 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:49,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:49,094 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:49,104 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:53:49,104 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:53:49,196 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-01-18 17:53:49,197 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:53:49,200 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:49,207 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:49,207 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:50,940 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:50,960 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:50,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 79 [2019-01-18 17:53:50,961 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:50,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-01-18 17:53:50,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-01-18 17:53:50,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-01-18 17:53:50,962 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2019-01-18 17:53:51,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:51,023 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-01-18 17:53:51,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-01-18 17:53:51,024 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2019-01-18 17:53:51,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:51,024 INFO L225 Difference]: With dead ends: 45 [2019-01-18 17:53:51,025 INFO L226 Difference]: Without dead ends: 43 [2019-01-18 17:53:51,025 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-01-18 17:53:51,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-01-18 17:53:51,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-01-18 17:53:51,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-18 17:53:51,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-01-18 17:53:51,027 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2019-01-18 17:53:51,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:51,027 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-01-18 17:53:51,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-01-18 17:53:51,028 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-01-18 17:53:51,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-01-18 17:53:51,028 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:51,028 INFO L402 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2019-01-18 17:53:51,029 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:51,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:51,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1441406220, now seen corresponding path program 39 times [2019-01-18 17:53:51,029 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:51,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:51,029 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:53:51,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:51,030 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:51,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:52,017 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:52,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:52,017 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:52,017 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:52,017 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:52,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:52,018 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:52,026 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:53:52,026 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:53:52,054 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:53:52,054 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:53:52,056 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:52,063 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:52,063 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:53,776 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:53,795 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:53,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 81 [2019-01-18 17:53:53,795 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:53,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-01-18 17:53:53,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-01-18 17:53:53,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-01-18 17:53:53,797 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2019-01-18 17:53:53,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:53,870 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-01-18 17:53:53,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-01-18 17:53:53,870 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2019-01-18 17:53:53,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:53,871 INFO L225 Difference]: With dead ends: 46 [2019-01-18 17:53:53,871 INFO L226 Difference]: Without dead ends: 44 [2019-01-18 17:53:53,872 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-01-18 17:53:53,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-18 17:53:53,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-01-18 17:53:53,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-01-18 17:53:53,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-01-18 17:53:53,875 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2019-01-18 17:53:53,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:53,875 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-01-18 17:53:53,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-01-18 17:53:53,875 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-01-18 17:53:53,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-01-18 17:53:53,876 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:53,876 INFO L402 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2019-01-18 17:53:53,876 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:53,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:53,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1733921667, now seen corresponding path program 40 times [2019-01-18 17:53:53,876 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:53,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:53,877 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:53:53,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:53,877 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:53,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:54,616 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:54,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:54,616 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:54,616 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:54,616 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:54,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53: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 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:54,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:53:54,628 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:53:54,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:54,677 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:54,687 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:54,688 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:56,563 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:56,581 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:56,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 83 [2019-01-18 17:53:56,582 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:56,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-01-18 17:53:56,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-01-18 17:53:56,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-01-18 17:53:56,583 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2019-01-18 17:53:56,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:56,709 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-01-18 17:53:56,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-01-18 17:53:56,710 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2019-01-18 17:53:56,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:56,710 INFO L225 Difference]: With dead ends: 47 [2019-01-18 17:53:56,710 INFO L226 Difference]: Without dead ends: 45 [2019-01-18 17:53:56,711 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-01-18 17:53:56,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-01-18 17:53:56,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-01-18 17:53:56,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-18 17:53:56,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-01-18 17:53:56,714 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2019-01-18 17:53:56,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:56,714 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-01-18 17:53:56,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-01-18 17:53:56,714 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-01-18 17:53:56,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-18 17:53:56,714 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:56,714 INFO L402 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2019-01-18 17:53:56,715 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:56,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:56,715 INFO L82 PathProgramCache]: Analyzing trace with hash -2083001364, now seen corresponding path program 41 times [2019-01-18 17:53:56,715 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:56,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:56,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:53:56,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:56,716 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:56,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:57,666 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:57,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:57,666 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:57,667 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:57,667 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:57,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:57,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 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:57,677 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:53:57,677 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:53:57,791 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-01-18 17:53:57,792 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:53:57,795 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:57,805 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:57,805 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:59,689 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:59,716 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:59,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 85 [2019-01-18 17:53:59,717 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:59,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-01-18 17:53:59,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-01-18 17:53:59,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-01-18 17:53:59,717 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2019-01-18 17:53:59,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:59,793 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-01-18 17:53:59,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-01-18 17:53:59,794 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2019-01-18 17:53:59,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:59,794 INFO L225 Difference]: With dead ends: 48 [2019-01-18 17:53:59,795 INFO L226 Difference]: Without dead ends: 46 [2019-01-18 17:53:59,795 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-01-18 17:53:59,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-01-18 17:53:59,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-01-18 17:53:59,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-18 17:53:59,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-01-18 17:53:59,798 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2019-01-18 17:53:59,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:59,798 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-01-18 17:53:59,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-01-18 17:53:59,798 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-01-18 17:53:59,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-18 17:53:59,798 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:59,799 INFO L402 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2019-01-18 17:53:59,799 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:59,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:59,799 INFO L82 PathProgramCache]: Analyzing trace with hash -148531037, now seen corresponding path program 42 times [2019-01-18 17:53:59,799 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:59,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:59,800 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:53:59,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:59,800 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:59,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:54:00,592 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:00,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:00,592 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:54:00,592 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:54:00,593 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:54:00,593 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:00,593 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:54:00,601 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:54:00,602 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:54:00,629 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:54:00,630 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:54:00,631 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:54:00,640 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:00,640 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:54:02,933 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:02,951 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:54:02,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 87 [2019-01-18 17:54:02,952 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:54:02,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-01-18 17:54:02,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-01-18 17:54:02,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-01-18 17:54:02,953 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2019-01-18 17:54:03,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:54:03,007 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-01-18 17:54:03,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-01-18 17:54:03,007 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2019-01-18 17:54:03,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:54:03,008 INFO L225 Difference]: With dead ends: 49 [2019-01-18 17:54:03,008 INFO L226 Difference]: Without dead ends: 47 [2019-01-18 17:54:03,009 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-01-18 17:54:03,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-18 17:54:03,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-01-18 17:54:03,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-18 17:54:03,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-01-18 17:54:03,012 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2019-01-18 17:54:03,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:54:03,012 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-01-18 17:54:03,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-01-18 17:54:03,012 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-01-18 17:54:03,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-01-18 17:54:03,013 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:54:03,013 INFO L402 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2019-01-18 17:54:03,013 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:54:03,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:54:03,013 INFO L82 PathProgramCache]: Analyzing trace with hash -309493044, now seen corresponding path program 43 times [2019-01-18 17:54:03,013 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:54:03,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:03,014 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:54:03,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:03,014 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:54:03,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:54:03,768 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:03,768 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:03,768 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:54:03,768 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:54:03,768 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:54:03,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:03,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 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:54:03,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:54:03,779 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:54:03,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:54:03,809 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:54:03,820 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:03,820 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:54:05,893 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:05,911 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:54:05,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 89 [2019-01-18 17:54:05,912 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:54:05,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-01-18 17:54:05,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-01-18 17:54:05,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-01-18 17:54:05,913 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2019-01-18 17:54:05,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:54:05,990 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-01-18 17:54:05,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-01-18 17:54:05,990 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2019-01-18 17:54:05,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:54:05,991 INFO L225 Difference]: With dead ends: 50 [2019-01-18 17:54:05,991 INFO L226 Difference]: Without dead ends: 48 [2019-01-18 17:54:05,992 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-01-18 17:54:05,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-01-18 17:54:05,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-01-18 17:54:05,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-18 17:54:05,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-01-18 17:54:05,994 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2019-01-18 17:54:05,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:54:05,994 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-01-18 17:54:05,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-01-18 17:54:05,995 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-01-18 17:54:05,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-01-18 17:54:05,995 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:54:05,995 INFO L402 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2019-01-18 17:54:05,996 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:54:05,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:54:05,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1004347965, now seen corresponding path program 44 times [2019-01-18 17:54:05,996 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:54:05,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:05,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:54:05,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:05,997 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:54:06,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:54:07,750 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:07,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:07,751 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:54:07,751 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:54:07,751 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:54:07,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:07,751 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:54:07,759 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:54:07,760 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:54:07,884 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2019-01-18 17:54:07,885 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:54:07,887 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:54:07,894 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:07,894 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:54:09,975 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:09,995 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:54:09,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 91 [2019-01-18 17:54:09,995 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:54:09,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-01-18 17:54:09,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-01-18 17:54:09,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-01-18 17:54:09,996 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2019-01-18 17:54:10,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:54:10,083 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-01-18 17:54:10,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-01-18 17:54:10,083 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2019-01-18 17:54:10,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:54:10,084 INFO L225 Difference]: With dead ends: 51 [2019-01-18 17:54:10,084 INFO L226 Difference]: Without dead ends: 49 [2019-01-18 17:54:10,085 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-01-18 17:54:10,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-01-18 17:54:10,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-01-18 17:54:10,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-01-18 17:54:10,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-01-18 17:54:10,088 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2019-01-18 17:54:10,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:54:10,088 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-01-18 17:54:10,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-01-18 17:54:10,088 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-01-18 17:54:10,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-18 17:54:10,089 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:54:10,089 INFO L402 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2019-01-18 17:54:10,089 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:54:10,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:54:10,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1070014036, now seen corresponding path program 45 times [2019-01-18 17:54:10,090 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:54:10,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:10,090 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:54:10,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:10,091 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:54:10,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:54:11,030 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:11,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:11,031 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:54:11,031 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:54:11,031 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:54:11,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:11,031 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:54:11,042 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:54:11,042 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:54:11,100 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:54:11,100 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:54:11,103 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:54:11,113 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:11,113 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:54:13,521 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:13,548 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:54:13,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 93 [2019-01-18 17:54:13,548 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:54:13,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-01-18 17:54:13,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-01-18 17:54:13,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-01-18 17:54:13,549 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2019-01-18 17:54:13,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:54:13,834 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-01-18 17:54:13,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-01-18 17:54:13,835 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2019-01-18 17:54:13,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:54:13,836 INFO L225 Difference]: With dead ends: 52 [2019-01-18 17:54:13,836 INFO L226 Difference]: Without dead ends: 50 [2019-01-18 17:54:13,836 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-01-18 17:54:13,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-01-18 17:54:13,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-01-18 17:54:13,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-01-18 17:54:13,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-01-18 17:54:13,839 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2019-01-18 17:54:13,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:54:13,840 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-01-18 17:54:13,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-01-18 17:54:13,840 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-01-18 17:54:13,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-01-18 17:54:13,840 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:54:13,840 INFO L402 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2019-01-18 17:54:13,841 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:54:13,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:54:13,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1189305059, now seen corresponding path program 46 times [2019-01-18 17:54:13,841 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:54:13,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:13,842 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:54:13,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:13,842 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:54:13,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:54:14,719 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:14,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:14,719 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:54:14,719 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:54:14,719 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:54:14,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:14,720 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:54:14,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:54:14,730 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:54:14,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:54:14,761 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:54:14,768 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:14,768 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:54:17,124 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:17,144 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:54:17,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2019-01-18 17:54:17,144 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:54:17,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-01-18 17:54:17,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-01-18 17:54:17,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-01-18 17:54:17,146 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2019-01-18 17:54:17,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:54:17,278 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-01-18 17:54:17,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-01-18 17:54:17,278 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2019-01-18 17:54:17,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:54:17,279 INFO L225 Difference]: With dead ends: 53 [2019-01-18 17:54:17,279 INFO L226 Difference]: Without dead ends: 51 [2019-01-18 17:54:17,279 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-01-18 17:54:17,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-01-18 17:54:17,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-01-18 17:54:17,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-18 17:54:17,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-01-18 17:54:17,282 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2019-01-18 17:54:17,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:54:17,282 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-01-18 17:54:17,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-01-18 17:54:17,282 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-01-18 17:54:17,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-18 17:54:17,283 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:54:17,283 INFO L402 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2019-01-18 17:54:17,283 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:54:17,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:54:17,283 INFO L82 PathProgramCache]: Analyzing trace with hash -1786247028, now seen corresponding path program 47 times [2019-01-18 17:54:17,283 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:54:17,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:17,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:54:17,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:17,284 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:54:17,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:54:18,362 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:18,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:18,362 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:54:18,362 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:54:18,362 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:54:18,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:18,363 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:54:18,371 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:54:18,371 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:54:18,528 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2019-01-18 17:54:18,529 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:54:18,532 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:54:18,540 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:18,540 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:54:21,071 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:21,091 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:54:21,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2019-01-18 17:54:21,092 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:54:21,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-01-18 17:54:21,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-01-18 17:54:21,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-01-18 17:54:21,093 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2019-01-18 17:54:21,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:54:21,158 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-01-18 17:54:21,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-01-18 17:54:21,159 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2019-01-18 17:54:21,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:54:21,159 INFO L225 Difference]: With dead ends: 54 [2019-01-18 17:54:21,160 INFO L226 Difference]: Without dead ends: 52 [2019-01-18 17:54:21,161 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-01-18 17:54:21,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-01-18 17:54:21,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-01-18 17:54:21,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-01-18 17:54:21,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-01-18 17:54:21,164 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2019-01-18 17:54:21,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:54:21,164 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-01-18 17:54:21,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-01-18 17:54:21,164 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-01-18 17:54:21,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-01-18 17:54:21,165 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:54:21,165 INFO L402 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2019-01-18 17:54:21,165 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:54:21,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:54:21,166 INFO L82 PathProgramCache]: Analyzing trace with hash 460918787, now seen corresponding path program 48 times [2019-01-18 17:54:21,166 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:54:21,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:21,166 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:54:21,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:21,167 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:54:21,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:54:23,294 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:23,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:23,294 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:54:23,294 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:54:23,294 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:54:23,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:23,295 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:54:23,303 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:54:23,303 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:54:23,335 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:54:23,336 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:54:23,338 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:54:23,346 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:23,346 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:54:25,848 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:25,877 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:54:25,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 99 [2019-01-18 17:54:25,877 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:54:25,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-01-18 17:54:25,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-01-18 17:54:25,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-01-18 17:54:25,879 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2019-01-18 17:54:26,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:54:26,018 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-01-18 17:54:26,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-01-18 17:54:26,019 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2019-01-18 17:54:26,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:54:26,020 INFO L225 Difference]: With dead ends: 55 [2019-01-18 17:54:26,020 INFO L226 Difference]: Without dead ends: 53 [2019-01-18 17:54:26,021 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-01-18 17:54:26,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-18 17:54:26,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-01-18 17:54:26,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-18 17:54:26,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-01-18 17:54:26,024 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2019-01-18 17:54:26,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:54:26,024 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-01-18 17:54:26,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-01-18 17:54:26,024 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-01-18 17:54:26,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-01-18 17:54:26,024 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:54:26,024 INFO L402 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2019-01-18 17:54:26,025 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:54:26,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:54:26,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1403582316, now seen corresponding path program 49 times [2019-01-18 17:54:26,025 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:54:26,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:26,026 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:54:26,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:26,026 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:54:26,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:54:27,046 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:27,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:27,046 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:54:27,047 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:54:27,047 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:54:27,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:27,047 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:54:27,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:54:27,056 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:54:27,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:54:27,092 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:54:27,103 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:27,103 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:54:30,011 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:30,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:54:30,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 101 [2019-01-18 17:54:30,031 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:54:30,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-01-18 17:54:30,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-01-18 17:54:30,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-01-18 17:54:30,032 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2019-01-18 17:54:30,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:54:30,092 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-01-18 17:54:30,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-01-18 17:54:30,093 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2019-01-18 17:54:30,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:54:30,093 INFO L225 Difference]: With dead ends: 56 [2019-01-18 17:54:30,094 INFO L226 Difference]: Without dead ends: 54 [2019-01-18 17:54:30,094 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-01-18 17:54:30,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-01-18 17:54:30,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-01-18 17:54:30,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-01-18 17:54:30,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-01-18 17:54:30,097 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2019-01-18 17:54:30,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:54:30,097 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-01-18 17:54:30,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-01-18 17:54:30,097 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-01-18 17:54:30,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-01-18 17:54:30,098 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:54:30,098 INFO L402 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2019-01-18 17:54:30,098 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:54:30,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:54:30,098 INFO L82 PathProgramCache]: Analyzing trace with hash 561380643, now seen corresponding path program 50 times [2019-01-18 17:54:30,099 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:54:30,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:30,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:54:30,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:30,099 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:54:30,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:54:31,107 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:31,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:31,108 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:54:31,108 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:54:31,108 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:54:31,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:31,108 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:54:31,117 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:54:31,118 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:54:31,295 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2019-01-18 17:54:31,295 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:54:31,298 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:54:31,311 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:31,311 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:54:34,265 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:34,293 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:54:34,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 103 [2019-01-18 17:54:34,293 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:54:34,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-01-18 17:54:34,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-01-18 17:54:34,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-01-18 17:54:34,295 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 53 states. [2019-01-18 17:54:34,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:54:34,453 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-01-18 17:54:34,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-01-18 17:54:34,454 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2019-01-18 17:54:34,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:54:34,454 INFO L225 Difference]: With dead ends: 57 [2019-01-18 17:54:34,455 INFO L226 Difference]: Without dead ends: 55 [2019-01-18 17:54:34,455 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-01-18 17:54:34,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-18 17:54:34,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-01-18 17:54:34,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-01-18 17:54:34,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-01-18 17:54:34,457 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2019-01-18 17:54:34,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:54:34,457 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-01-18 17:54:34,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-01-18 17:54:34,458 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-01-18 17:54:34,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-18 17:54:34,458 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:54:34,458 INFO L402 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2019-01-18 17:54:34,458 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:54:34,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:54:34,459 INFO L82 PathProgramCache]: Analyzing trace with hash 222932556, now seen corresponding path program 51 times [2019-01-18 17:54:34,459 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:54:34,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:34,460 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:54:34,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:34,460 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:54:34,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:54:35,760 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:35,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:35,761 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:54:35,761 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:54:35,761 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:54:35,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:35,761 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:54:35,770 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:54:35,771 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:54:35,804 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:54:35,804 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:54:35,806 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:54:35,815 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:35,815 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:54:38,793 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:38,813 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:54:38,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 105 [2019-01-18 17:54:38,813 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:54:38,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-01-18 17:54:38,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-01-18 17:54:38,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-01-18 17:54:38,815 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 54 states. [2019-01-18 17:54:38,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:54:38,909 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-01-18 17:54:38,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-01-18 17:54:38,909 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2019-01-18 17:54:38,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:54:38,910 INFO L225 Difference]: With dead ends: 58 [2019-01-18 17:54:38,910 INFO L226 Difference]: Without dead ends: 56 [2019-01-18 17:54:38,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-01-18 17:54:38,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-01-18 17:54:38,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-01-18 17:54:38,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-01-18 17:54:38,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-01-18 17:54:38,913 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2019-01-18 17:54:38,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:54:38,913 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-01-18 17:54:38,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-01-18 17:54:38,913 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-01-18 17:54:38,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-01-18 17:54:38,914 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:54:38,914 INFO L402 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2019-01-18 17:54:38,914 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:54:38,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:54:38,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1679023549, now seen corresponding path program 52 times [2019-01-18 17:54:38,914 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:54:38,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:38,915 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:54:38,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:38,915 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:54:38,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:54:39,981 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:39,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:39,982 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:54:39,982 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:54:39,982 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:54:39,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:39,982 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:54:39,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:54:39,991 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:54:40,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:54:40,021 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:54:40,030 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:40,030 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:54:43,180 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:43,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:54:43,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 107 [2019-01-18 17:54:43,200 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:54:43,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-01-18 17:54:43,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-01-18 17:54:43,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-01-18 17:54:43,202 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 55 states. [2019-01-18 17:54:43,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:54:43,301 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-01-18 17:54:43,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-01-18 17:54:43,302 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2019-01-18 17:54:43,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:54:43,303 INFO L225 Difference]: With dead ends: 59 [2019-01-18 17:54:43,303 INFO L226 Difference]: Without dead ends: 57 [2019-01-18 17:54:43,304 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-01-18 17:54:43,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-01-18 17:54:43,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-01-18 17:54:43,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-01-18 17:54:43,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-01-18 17:54:43,307 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2019-01-18 17:54:43,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:54:43,307 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-01-18 17:54:43,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-01-18 17:54:43,307 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-01-18 17:54:43,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-18 17:54:43,307 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:54:43,308 INFO L402 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2019-01-18 17:54:43,308 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:54:43,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:54:43,308 INFO L82 PathProgramCache]: Analyzing trace with hash -510120660, now seen corresponding path program 53 times [2019-01-18 17:54:43,308 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:54:43,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:43,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:54:43,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:43,309 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:54:43,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:54:44,422 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:44,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:44,422 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:54:44,422 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:54:44,422 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:54:44,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:44,422 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:54:44,431 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:54:44,432 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:54:44,651 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2019-01-18 17:54:44,652 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:54:44,656 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:54:44,664 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:44,665 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:54:47,642 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:47,663 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:54:47,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 109 [2019-01-18 17:54:47,663 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:54:47,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-01-18 17:54:47,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-01-18 17:54:47,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-01-18 17:54:47,665 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 56 states. [2019-01-18 17:54:47,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:54:47,737 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-01-18 17:54:47,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-01-18 17:54:47,738 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2019-01-18 17:54:47,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:54:47,739 INFO L225 Difference]: With dead ends: 60 [2019-01-18 17:54:47,739 INFO L226 Difference]: Without dead ends: 58 [2019-01-18 17:54:47,739 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-01-18 17:54:47,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-01-18 17:54:47,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-01-18 17:54:47,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-01-18 17:54:47,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-01-18 17:54:47,741 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2019-01-18 17:54:47,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:54:47,742 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-01-18 17:54:47,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-01-18 17:54:47,742 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-01-18 17:54:47,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-01-18 17:54:47,742 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:54:47,742 INFO L402 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2019-01-18 17:54:47,742 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:54:47,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:54:47,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1366130531, now seen corresponding path program 54 times [2019-01-18 17:54:47,743 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:54:47,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:47,743 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:54:47,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:47,744 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:54:47,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:54:49,223 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:49,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:49,223 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:54:49,223 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:54:49,224 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:54:49,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:49,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 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:54:49,232 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:54:49,232 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:54:49,266 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:54:49,266 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:54:49,269 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:54:49,277 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:49,277 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:54:52,336 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:52,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:54:52,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 111 [2019-01-18 17:54:52,355 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:54:52,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-01-18 17:54:52,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-01-18 17:54:52,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-01-18 17:54:52,356 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 57 states. [2019-01-18 17:54:52,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:54:52,450 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-01-18 17:54:52,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-01-18 17:54:52,451 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2019-01-18 17:54:52,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:54:52,451 INFO L225 Difference]: With dead ends: 61 [2019-01-18 17:54:52,451 INFO L226 Difference]: Without dead ends: 59 [2019-01-18 17:54:52,452 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-01-18 17:54:52,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-01-18 17:54:52,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-01-18 17:54:52,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-18 17:54:52,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-01-18 17:54:52,454 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2019-01-18 17:54:52,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:54:52,454 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-01-18 17:54:52,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-01-18 17:54:52,454 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-01-18 17:54:52,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-01-18 17:54:52,454 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:54:52,454 INFO L402 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2019-01-18 17:54:52,455 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:54:52,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:54:52,455 INFO L82 PathProgramCache]: Analyzing trace with hash -599624692, now seen corresponding path program 55 times [2019-01-18 17:54:52,455 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:54:52,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:52,456 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:54:52,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:52,456 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:54:52,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:54:53,986 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:53,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:53,986 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:54:53,986 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:54:53,986 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:54:53,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:53,987 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:54:53,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:54:53,996 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:54:54,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:54:54,035 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:54:54,044 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:54,044 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:54:57,323 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:57,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:54:57,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 113 [2019-01-18 17:54:57,343 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:54:57,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-01-18 17:54:57,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-01-18 17:54:57,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-01-18 17:54:57,344 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 58 states. [2019-01-18 17:54:57,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:54:57,455 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-01-18 17:54:57,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-01-18 17:54:57,455 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2019-01-18 17:54:57,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:54:57,456 INFO L225 Difference]: With dead ends: 62 [2019-01-18 17:54:57,456 INFO L226 Difference]: Without dead ends: 60 [2019-01-18 17:54:57,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-01-18 17:54:57,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-01-18 17:54:57,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-01-18 17:54:57,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-01-18 17:54:57,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-01-18 17:54:57,459 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2019-01-18 17:54:57,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:54:57,459 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-01-18 17:54:57,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-01-18 17:54:57,460 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-01-18 17:54:57,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-01-18 17:54:57,460 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:54:57,460 INFO L402 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2019-01-18 17:54:57,460 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:54:57,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:54:57,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1408494461, now seen corresponding path program 56 times [2019-01-18 17:54:57,461 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:54:57,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:57,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:54:57,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:57,461 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:54:57,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:54:59,030 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:59,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:59,030 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:54:59,030 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:54:59,031 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:54:59,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:59,031 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:54:59,040 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:54:59,040 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:54:59,283 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2019-01-18 17:54:59,283 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:54:59,286 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:54:59,312 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:59,312 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:55:02,623 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:55:02,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:55:02,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 115 [2019-01-18 17:55:02,642 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:55:02,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-01-18 17:55:02,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-01-18 17:55:02,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-01-18 17:55:02,644 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2019-01-18 17:55:02,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:55:02,722 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-01-18 17:55:02,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-01-18 17:55:02,723 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2019-01-18 17:55:02,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:55:02,724 INFO L225 Difference]: With dead ends: 63 [2019-01-18 17:55:02,724 INFO L226 Difference]: Without dead ends: 61 [2019-01-18 17:55:02,725 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-01-18 17:55:02,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-01-18 17:55:02,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-01-18 17:55:02,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-18 17:55:02,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-01-18 17:55:02,728 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2019-01-18 17:55:02,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:55:02,728 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-01-18 17:55:02,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-01-18 17:55:02,728 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-01-18 17:55:02,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-01-18 17:55:02,729 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:55:02,729 INFO L402 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2019-01-18 17:55:02,729 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:55:02,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:55:02,730 INFO L82 PathProgramCache]: Analyzing trace with hash -713653524, now seen corresponding path program 57 times [2019-01-18 17:55:02,730 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:55:02,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:55:02,731 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:55:02,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:55:02,731 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:55:02,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:55:04,361 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:55:04,361 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:55:04,361 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:55:04,361 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:55:04,362 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:55:04,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:55:04,362 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:55:04,371 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:55:04,371 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:55:04,408 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:55:04,408 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:55:04,411 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:55:04,424 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:55:04,425 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:55:08,102 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:55:08,121 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:55:08,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 117 [2019-01-18 17:55:08,121 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:55:08,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-01-18 17:55:08,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-01-18 17:55:08,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-01-18 17:55:08,122 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2019-01-18 17:55:08,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:55:08,231 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-01-18 17:55:08,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-01-18 17:55:08,232 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2019-01-18 17:55:08,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:55:08,233 INFO L225 Difference]: With dead ends: 64 [2019-01-18 17:55:08,233 INFO L226 Difference]: Without dead ends: 62 [2019-01-18 17:55:08,234 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-01-18 17:55:08,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-01-18 17:55:08,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-01-18 17:55:08,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-01-18 17:55:08,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-01-18 17:55:08,236 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2019-01-18 17:55:08,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:55:08,237 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-01-18 17:55:08,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-01-18 17:55:08,237 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-01-18 17:55:08,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-01-18 17:55:08,237 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:55:08,237 INFO L402 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2019-01-18 17:55:08,238 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:55:08,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:55:08,238 INFO L82 PathProgramCache]: Analyzing trace with hash -648420957, now seen corresponding path program 58 times [2019-01-18 17:55:08,238 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:55:08,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:55:08,239 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:55:08,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:55:08,239 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:55:08,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:55:09,658 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:55:09,659 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:55:09,659 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:55:09,659 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:55:09,659 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:55:09,659 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:55:09,659 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:55:09,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:55:09,672 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:55:09,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:55:09,712 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:55:09,725 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:55:09,726 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:55:13,344 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:55:13,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:55:13,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 119 [2019-01-18 17:55:13,363 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:55:13,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-01-18 17:55:13,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-01-18 17:55:13,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-01-18 17:55:13,364 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 61 states. [2019-01-18 17:55:13,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:55:13,483 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-01-18 17:55:13,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-01-18 17:55:13,483 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2019-01-18 17:55:13,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:55:13,484 INFO L225 Difference]: With dead ends: 65 [2019-01-18 17:55:13,484 INFO L226 Difference]: Without dead ends: 63 [2019-01-18 17:55:13,485 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-01-18 17:55:13,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-01-18 17:55:13,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-01-18 17:55:13,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-01-18 17:55:13,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-01-18 17:55:13,487 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2019-01-18 17:55:13,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:55:13,488 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-01-18 17:55:13,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-01-18 17:55:13,488 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-01-18 17:55:13,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-01-18 17:55:13,488 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:55:13,488 INFO L402 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2019-01-18 17:55:13,488 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:55:13,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:55:13,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1373788620, now seen corresponding path program 59 times [2019-01-18 17:55:13,489 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:55:13,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:55:13,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:55:13,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:55:13,489 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:55:13,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:55:16,163 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:55:16,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:55:16,164 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:55:16,164 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:55:16,164 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:55:16,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:55:16,164 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:55:16,174 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:55:16,174 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:55:16,476 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2019-01-18 17:55:16,476 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:55:16,481 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:55:16,491 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:55:16,491 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:55:20,428 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:55:20,448 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:55:20,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 121 [2019-01-18 17:55:20,448 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:55:20,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-01-18 17:55:20,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-01-18 17:55:20,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2019-01-18 17:55:20,449 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 62 states. [2019-01-18 17:55:20,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:55:20,527 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-01-18 17:55:20,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-01-18 17:55:20,527 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2019-01-18 17:55:20,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:55:20,528 INFO L225 Difference]: With dead ends: 66 [2019-01-18 17:55:20,528 INFO L226 Difference]: Without dead ends: 64 [2019-01-18 17:55:20,529 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2019-01-18 17:55:20,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-01-18 17:55:20,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-01-18 17:55:20,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-01-18 17:55:20,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-01-18 17:55:20,531 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2019-01-18 17:55:20,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:55:20,531 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-01-18 17:55:20,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-01-18 17:55:20,532 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-01-18 17:55:20,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-01-18 17:55:20,532 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:55:20,532 INFO L402 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2019-01-18 17:55:20,532 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:55:20,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:55:20,532 INFO L82 PathProgramCache]: Analyzing trace with hash -362223933, now seen corresponding path program 60 times [2019-01-18 17:55:20,532 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:55:20,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:55:20,533 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:55:20,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:55:20,533 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:55:20,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:55:22,125 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:55:22,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:55:22,125 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:55:22,125 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:55:22,125 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:55:22,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:55:22,125 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:55:22,136 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:55:22,136 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:55:22,176 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:55:22,176 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:55:22,194 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:55:22,204 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:55:22,204 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:55:26,275 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:55:26,294 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:55:26,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 123 [2019-01-18 17:55:26,295 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:55:26,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-01-18 17:55:26,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-01-18 17:55:26,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2019-01-18 17:55:26,296 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 63 states. [2019-01-18 17:55:26,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:55:26,428 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-01-18 17:55:26,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-01-18 17:55:26,429 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2019-01-18 17:55:26,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:55:26,429 INFO L225 Difference]: With dead ends: 67 [2019-01-18 17:55:26,430 INFO L226 Difference]: Without dead ends: 65 [2019-01-18 17:55:26,430 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2019-01-18 17:55:26,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-18 17:55:26,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-01-18 17:55:26,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-01-18 17:55:26,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-01-18 17:55:26,432 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2019-01-18 17:55:26,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:55:26,433 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-01-18 17:55:26,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-01-18 17:55:26,433 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-01-18 17:55:26,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-01-18 17:55:26,434 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:55:26,434 INFO L402 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2019-01-18 17:55:26,434 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:55:26,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:55:26,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1655961772, now seen corresponding path program 61 times [2019-01-18 17:55:26,434 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:55:26,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:55:26,435 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:55:26,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:55:26,435 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:55:26,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:55:28,081 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:55:28,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:55:28,082 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:55:28,082 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:55:28,082 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:55:28,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:55:28,082 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:55:28,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:55:28,091 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:55:28,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:55:28,133 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:55:28,143 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:55:28,143 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:55:32,401 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:55:32,422 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:55:32,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 125 [2019-01-18 17:55:32,422 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:55:32,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-01-18 17:55:32,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-01-18 17:55:32,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2019-01-18 17:55:32,424 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 64 states. [2019-01-18 17:55:32,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:55:32,560 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-01-18 17:55:32,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-01-18 17:55:32,560 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2019-01-18 17:55:32,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:55:32,561 INFO L225 Difference]: With dead ends: 68 [2019-01-18 17:55:32,561 INFO L226 Difference]: Without dead ends: 66 [2019-01-18 17:55:32,561 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2019-01-18 17:55:32,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-01-18 17:55:32,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-01-18 17:55:32,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-01-18 17:55:32,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-01-18 17:55:32,563 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2019-01-18 17:55:32,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:55:32,563 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-01-18 17:55:32,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-01-18 17:55:32,563 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-01-18 17:55:32,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-01-18 17:55:32,564 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:55:32,564 INFO L402 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2019-01-18 17:55:32,564 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:55:32,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:55:32,564 INFO L82 PathProgramCache]: Analyzing trace with hash -204790813, now seen corresponding path program 62 times [2019-01-18 17:55:32,564 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:55:32,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:55:32,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:55:32,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:55:32,565 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:55:32,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:55:34,443 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:55:34,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:55:34,444 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:55:34,444 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:55:34,444 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:55:34,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:55:34,444 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:55:34,454 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:55:34,454 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:55:34,779 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2019-01-18 17:55:34,779 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:55:34,783 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:55:34,793 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:55:34,793 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:55:38,893 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:55:38,912 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:55:38,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 127 [2019-01-18 17:55:38,913 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:55:38,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-01-18 17:55:38,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-01-18 17:55:38,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2019-01-18 17:55:38,915 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 65 states. [2019-01-18 17:55:39,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:55:39,034 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-01-18 17:55:39,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-01-18 17:55:39,035 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2019-01-18 17:55:39,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:55:39,036 INFO L225 Difference]: With dead ends: 69 [2019-01-18 17:55:39,036 INFO L226 Difference]: Without dead ends: 67 [2019-01-18 17:55:39,037 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2019-01-18 17:55:39,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-01-18 17:55:39,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-01-18 17:55:39,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-01-18 17:55:39,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-01-18 17:55:39,040 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2019-01-18 17:55:39,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:55:39,041 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-01-18 17:55:39,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-01-18 17:55:39,041 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-01-18 17:55:39,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-18 17:55:39,041 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:55:39,041 INFO L402 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2019-01-18 17:55:39,042 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:55:39,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:55:39,042 INFO L82 PathProgramCache]: Analyzing trace with hash -2053546100, now seen corresponding path program 63 times [2019-01-18 17:55:39,042 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:55:39,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:55:39,043 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:55:39,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:55:39,043 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:55:39,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:55:41,333 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:55:41,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:55:41,334 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:55:41,334 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:55:41,334 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:55:41,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:55:41,334 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:55:41,354 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:55:41,354 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:55:41,396 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:55:41,396 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:55:41,398 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:55:41,409 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:55:41,409 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:55:45,897 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:55:45,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:55:45,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 129 [2019-01-18 17:55:45,916 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:55:45,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-01-18 17:55:45,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-01-18 17:55:45,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2019-01-18 17:55:45,918 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 66 states. [2019-01-18 17:55:46,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:55:46,039 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-01-18 17:55:46,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-01-18 17:55:46,045 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2019-01-18 17:55:46,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:55:46,046 INFO L225 Difference]: With dead ends: 70 [2019-01-18 17:55:46,046 INFO L226 Difference]: Without dead ends: 68 [2019-01-18 17:55:46,047 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2019-01-18 17:55:46,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-01-18 17:55:46,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-01-18 17:55:46,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-01-18 17:55:46,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-01-18 17:55:46,049 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2019-01-18 17:55:46,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:55:46,049 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-01-18 17:55:46,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-01-18 17:55:46,050 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-01-18 17:55:46,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-18 17:55:46,050 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:55:46,050 INFO L402 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2019-01-18 17:55:46,051 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:55:46,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:55:46,051 INFO L82 PathProgramCache]: Analyzing trace with hash 764582147, now seen corresponding path program 64 times [2019-01-18 17:55:46,051 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:55:46,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:55:46,052 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:55:46,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:55:46,052 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:55:46,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:55:47,665 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:55:47,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:55:47,666 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:55:47,666 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:55:47,666 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:55:47,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:55:47,666 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:55:47,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:55:47,675 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:55:47,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:55:47,720 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:55:47,733 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:55:47,733 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:55:52,447 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:55:52,467 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:55:52,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 131 [2019-01-18 17:55:52,467 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:55:52,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-01-18 17:55:52,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-01-18 17:55:52,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2019-01-18 17:55:52,468 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2019-01-18 17:55:52,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:55:52,561 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-01-18 17:55:52,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-01-18 17:55:52,562 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2019-01-18 17:55:52,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:55:52,562 INFO L225 Difference]: With dead ends: 71 [2019-01-18 17:55:52,562 INFO L226 Difference]: Without dead ends: 69 [2019-01-18 17:55:52,563 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2019-01-18 17:55:52,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-01-18 17:55:52,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-01-18 17:55:52,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-01-18 17:55:52,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-01-18 17:55:52,566 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2019-01-18 17:55:52,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:55:52,566 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-01-18 17:55:52,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-01-18 17:55:52,567 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-01-18 17:55:52,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-01-18 17:55:52,567 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:55:52,567 INFO L402 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2019-01-18 17:55:52,567 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:55:52,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:55:52,567 INFO L82 PathProgramCache]: Analyzing trace with hash -2067755412, now seen corresponding path program 65 times [2019-01-18 17:55:52,568 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:55:52,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:55:52,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:55:52,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:55:52,568 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:55:52,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:55:54,833 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:55:54,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:55:54,834 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:55:54,834 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:55:54,834 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:55:54,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:55:54,834 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:55:54,843 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:55:54,843 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:55:55,261 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2019-01-18 17:55:55,262 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:55:55,268 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:55:55,285 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:55:55,285 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:56:00,422 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:56:00,442 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:56:00,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 133 [2019-01-18 17:56:00,442 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:56:00,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-01-18 17:56:00,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-01-18 17:56:00,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2019-01-18 17:56:00,444 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 68 states. [2019-01-18 17:56:00,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:56:00,551 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-01-18 17:56:00,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-01-18 17:56:00,552 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2019-01-18 17:56:00,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:56:00,552 INFO L225 Difference]: With dead ends: 72 [2019-01-18 17:56:00,553 INFO L226 Difference]: Without dead ends: 70 [2019-01-18 17:56:00,553 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2019-01-18 17:56:00,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-01-18 17:56:00,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-01-18 17:56:00,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-01-18 17:56:00,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-01-18 17:56:00,556 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2019-01-18 17:56:00,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:56:00,556 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-01-18 17:56:00,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-01-18 17:56:00,556 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-01-18 17:56:00,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-01-18 17:56:00,557 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:56:00,557 INFO L402 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2019-01-18 17:56:00,557 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:56:00,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:56:00,557 INFO L82 PathProgramCache]: Analyzing trace with hash 324093475, now seen corresponding path program 66 times [2019-01-18 17:56:00,558 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:56:00,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:56:00,558 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:56:00,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:56:00,558 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:56:00,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:56:02,158 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:56:02,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:56:02,158 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:56:02,158 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:56:02,158 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:56:02,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:56:02,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 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:56:02,171 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:56:02,171 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:56:02,215 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:56:02,215 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:56:02,218 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:56:02,234 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:56:02,235 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:56:07,065 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:56:07,084 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:56:07,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 135 [2019-01-18 17:56:07,084 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:56:07,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-01-18 17:56:07,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-01-18 17:56:07,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2019-01-18 17:56:07,086 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 69 states. [2019-01-18 17:56:07,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:56:07,431 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-01-18 17:56:07,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-01-18 17:56:07,432 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2019-01-18 17:56:07,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:56:07,432 INFO L225 Difference]: With dead ends: 73 [2019-01-18 17:56:07,432 INFO L226 Difference]: Without dead ends: 71 [2019-01-18 17:56:07,433 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2019-01-18 17:56:07,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-18 17:56:07,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-01-18 17:56:07,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-18 17:56:07,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-01-18 17:56:07,435 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2019-01-18 17:56:07,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:56:07,435 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-01-18 17:56:07,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-01-18 17:56:07,435 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-01-18 17:56:07,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-01-18 17:56:07,436 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:56:07,436 INFO L402 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2019-01-18 17:56:07,436 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:56:07,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:56:07,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1456964940, now seen corresponding path program 67 times [2019-01-18 17:56:07,437 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:56:07,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:56:07,437 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:56:07,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:56:07,437 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:56:07,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:56:09,171 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:56:09,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:56:09,171 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:56:09,171 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:56:09,171 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:56:09,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:56:09,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 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:56:09,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:56:09,181 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:56:09,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:56:09,226 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:56:09,238 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:56:09,238 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:56:14,223 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:56:14,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:56:14,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 137 [2019-01-18 17:56:14,243 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:56:14,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-01-18 17:56:14,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-01-18 17:56:14,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2019-01-18 17:56:14,244 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 70 states. [2019-01-18 17:56:14,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:56:14,339 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-01-18 17:56:14,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-01-18 17:56:14,339 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2019-01-18 17:56:14,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:56:14,341 INFO L225 Difference]: With dead ends: 74 [2019-01-18 17:56:14,341 INFO L226 Difference]: Without dead ends: 72 [2019-01-18 17:56:14,342 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2019-01-18 17:56:14,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-01-18 17:56:14,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-01-18 17:56:14,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-01-18 17:56:14,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-01-18 17:56:14,345 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2019-01-18 17:56:14,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:56:14,345 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-01-18 17:56:14,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-01-18 17:56:14,345 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-01-18 17:56:14,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-01-18 17:56:14,346 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:56:14,346 INFO L402 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2019-01-18 17:56:14,346 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:56:14,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:56:14,346 INFO L82 PathProgramCache]: Analyzing trace with hash -2078725309, now seen corresponding path program 68 times [2019-01-18 17:56:14,346 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:56:14,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:56:14,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:56:14,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:56:14,347 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:56:14,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:56:16,156 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:56:16,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:56:16,156 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:56:16,156 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:56:16,156 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:56:16,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:56:16,157 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:56:16,166 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:56:16,166 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:56:16,611 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2019-01-18 17:56:16,611 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:56:16,616 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:56:16,627 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:56:16,628 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:56:21,709 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:56:21,729 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:56:21,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 139 [2019-01-18 17:56:21,730 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:56:21,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-01-18 17:56:21,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-01-18 17:56:21,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2019-01-18 17:56:21,731 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 71 states. [2019-01-18 17:56:21,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:56:21,935 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-01-18 17:56:21,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-01-18 17:56:21,936 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2019-01-18 17:56:21,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:56:21,936 INFO L225 Difference]: With dead ends: 75 [2019-01-18 17:56:21,936 INFO L226 Difference]: Without dead ends: 73 [2019-01-18 17:56:21,937 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2019-01-18 17:56:21,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-01-18 17:56:21,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-01-18 17:56:21,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-18 17:56:21,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-01-18 17:56:21,939 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2019-01-18 17:56:21,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:56:21,939 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-01-18 17:56:21,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-01-18 17:56:21,939 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-01-18 17:56:21,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-01-18 17:56:21,940 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:56:21,940 INFO L402 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2019-01-18 17:56:21,940 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:56:21,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:56:21,940 INFO L82 PathProgramCache]: Analyzing trace with hash -15973332, now seen corresponding path program 69 times [2019-01-18 17:56:21,940 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:56:21,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:56:21,941 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:56:21,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:56:21,941 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:56:21,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:56:23,713 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:56:23,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:56:23,714 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:56:23,714 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:56:23,714 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:56:23,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:56:23,714 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:56:23,723 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:56:23,723 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:56:23,779 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:56:23,779 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:56:23,781 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:56:23,792 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:56:23,792 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:56:29,147 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:56:29,167 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:56:29,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 141 [2019-01-18 17:56:29,167 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:56:29,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-01-18 17:56:29,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-01-18 17:56:29,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2019-01-18 17:56:29,169 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 72 states. [2019-01-18 17:56:29,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:56:29,357 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-01-18 17:56:29,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-01-18 17:56:29,357 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2019-01-18 17:56:29,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:56:29,358 INFO L225 Difference]: With dead ends: 76 [2019-01-18 17:56:29,358 INFO L226 Difference]: Without dead ends: 74 [2019-01-18 17:56:29,361 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2019-01-18 17:56:29,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-01-18 17:56:29,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-01-18 17:56:29,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-01-18 17:56:29,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-01-18 17:56:29,364 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2019-01-18 17:56:29,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:56:29,364 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-01-18 17:56:29,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-01-18 17:56:29,364 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-01-18 17:56:29,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-01-18 17:56:29,365 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:56:29,365 INFO L402 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2019-01-18 17:56:29,365 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:56:29,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:56:29,365 INFO L82 PathProgramCache]: Analyzing trace with hash -495171485, now seen corresponding path program 70 times [2019-01-18 17:56:29,366 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:56:29,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:56:29,366 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:56:29,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:56:29,367 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:56:29,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:56:31,825 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:56:31,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:56:31,826 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:56:31,826 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:56:31,826 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:56:31,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:56:31,826 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:56:31,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:56:31,836 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:56:31,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:56:31,892 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:56:31,913 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:56:31,913 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:56:37,489 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:56:37,509 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:56:37,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 143 [2019-01-18 17:56:37,509 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:56:37,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-01-18 17:56:37,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-01-18 17:56:37,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2019-01-18 17:56:37,511 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 73 states. [2019-01-18 17:56:37,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:56:37,673 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-01-18 17:56:37,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-01-18 17:56:37,673 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2019-01-18 17:56:37,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:56:37,674 INFO L225 Difference]: With dead ends: 77 [2019-01-18 17:56:37,674 INFO L226 Difference]: Without dead ends: 75 [2019-01-18 17:56:37,675 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2019-01-18 17:56:37,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-01-18 17:56:37,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-01-18 17:56:37,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-01-18 17:56:37,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-01-18 17:56:37,679 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2019-01-18 17:56:37,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:56:37,679 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-01-18 17:56:37,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-01-18 17:56:37,679 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-01-18 17:56:37,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-01-18 17:56:37,680 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:56:37,680 INFO L402 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2019-01-18 17:56:37,680 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:56:37,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:56:37,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1829554956, now seen corresponding path program 71 times [2019-01-18 17:56:37,680 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:56:37,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:56:37,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:56:37,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:56:37,681 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:56:37,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:56:39,549 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:56:39,550 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:56:39,550 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:56:39,550 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:56:39,550 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:56:39,550 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:56:39,550 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:56:39,559 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:56:39,559 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:56:40,085 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 37 check-sat command(s) [2019-01-18 17:56:40,085 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:56:40,090 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:56:40,102 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:56:40,102 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:56:45,532 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:56:45,555 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:56:45,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 145 [2019-01-18 17:56:45,555 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:56:45,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-01-18 17:56:45,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-01-18 17:56:45,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2019-01-18 17:56:45,558 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 74 states. [2019-01-18 17:56:45,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:56:45,761 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-01-18 17:56:45,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-01-18 17:56:45,761 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2019-01-18 17:56:45,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:56:45,762 INFO L225 Difference]: With dead ends: 78 [2019-01-18 17:56:45,762 INFO L226 Difference]: Without dead ends: 76 [2019-01-18 17:56:45,763 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2019-01-18 17:56:45,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-01-18 17:56:45,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-01-18 17:56:45,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-01-18 17:56:45,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-01-18 17:56:45,766 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2019-01-18 17:56:45,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:56:45,767 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-01-18 17:56:45,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-01-18 17:56:45,767 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-01-18 17:56:45,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-01-18 17:56:45,767 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:56:45,768 INFO L402 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2019-01-18 17:56:45,768 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:56:45,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:56:45,768 INFO L82 PathProgramCache]: Analyzing trace with hash 881630595, now seen corresponding path program 72 times [2019-01-18 17:56:45,768 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:56:45,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:56:45,769 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:56:45,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:56:45,769 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:56:45,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:56:47,741 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:56:47,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:56:47,741 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:56:47,741 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:56:47,742 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:56:47,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:56:47,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 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:56:47,750 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:56:47,750 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:56:47,798 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:56:47,798 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:56:47,801 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:56:47,818 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:56:47,819 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:56:53,650 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:56:53,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:56:53,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 147 [2019-01-18 17:56:53,671 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:56:53,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-01-18 17:56:53,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-01-18 17:56:53,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2019-01-18 17:56:53,672 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 75 states. [2019-01-18 17:56:53,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:56:53,826 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-01-18 17:56:53,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-01-18 17:56:53,826 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2019-01-18 17:56:53,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:56:53,827 INFO L225 Difference]: With dead ends: 79 [2019-01-18 17:56:53,827 INFO L226 Difference]: Without dead ends: 77 [2019-01-18 17:56:53,828 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-01-18 17:56:53,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-01-18 17:56:53,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-01-18 17:56:53,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-18 17:56:53,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-01-18 17:56:53,830 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2019-01-18 17:56:53,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:56:53,830 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-01-18 17:56:53,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-01-18 17:56:53,830 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-01-18 17:56:53,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-01-18 17:56:53,831 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:56:53,831 INFO L402 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2019-01-18 17:56:53,831 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:56:53,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:56:53,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1560746476, now seen corresponding path program 73 times [2019-01-18 17:56:53,832 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:56:53,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:56:53,832 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:56:53,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:56:53,832 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:56:53,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:56:55,828 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:56:55,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:56:55,829 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:56:55,829 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:56:55,829 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:56:55,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:56:55,829 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:56:55,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:56:55,839 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:56:55,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:56:55,891 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:56:55,907 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:56:55,908 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:57:02,170 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:57:02,188 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:57:02,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 149 [2019-01-18 17:57:02,188 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:57:02,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-01-18 17:57:02,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-01-18 17:57:02,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2019-01-18 17:57:02,190 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 76 states. [2019-01-18 17:57:02,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:57:02,349 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-01-18 17:57:02,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-01-18 17:57:02,349 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2019-01-18 17:57:02,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:57:02,350 INFO L225 Difference]: With dead ends: 80 [2019-01-18 17:57:02,350 INFO L226 Difference]: Without dead ends: 78 [2019-01-18 17:57:02,351 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2019-01-18 17:57:02,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-01-18 17:57:02,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-01-18 17:57:02,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-01-18 17:57:02,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-01-18 17:57:02,353 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2019-01-18 17:57:02,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:57:02,353 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-01-18 17:57:02,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-01-18 17:57:02,354 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-01-18 17:57:02,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-01-18 17:57:02,354 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:57:02,354 INFO L402 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2019-01-18 17:57:02,355 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:57:02,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:57:02,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1138502307, now seen corresponding path program 74 times [2019-01-18 17:57:02,355 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:57:02,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:57:02,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:57:02,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:57:02,356 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:57:02,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:57:04,351 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:57:04,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:57:04,351 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:57:04,351 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:57:04,351 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:57:04,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:57:04,351 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:57:04,361 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:57:04,361 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:57:04,947 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2019-01-18 17:57:04,948 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:57:04,952 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:57:04,969 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:57:04,969 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:57:11,009 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:57:11,031 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:57:11,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 151 [2019-01-18 17:57:11,031 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:57:11,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-01-18 17:57:11,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-01-18 17:57:11,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2019-01-18 17:57:11,033 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 77 states. [2019-01-18 17:57:11,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:57:11,152 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-01-18 17:57:11,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-01-18 17:57:11,153 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2019-01-18 17:57:11,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:57:11,154 INFO L225 Difference]: With dead ends: 81 [2019-01-18 17:57:11,154 INFO L226 Difference]: Without dead ends: 79 [2019-01-18 17:57:11,155 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2019-01-18 17:57:11,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-01-18 17:57:11,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-01-18 17:57:11,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-01-18 17:57:11,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-01-18 17:57:11,158 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2019-01-18 17:57:11,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:57:11,158 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-01-18 17:57:11,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-01-18 17:57:11,159 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-01-18 17:57:11,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-01-18 17:57:11,159 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:57:11,159 INFO L402 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2019-01-18 17:57:11,159 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:57:11,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:57:11,160 INFO L82 PathProgramCache]: Analyzing trace with hash 933834956, now seen corresponding path program 75 times [2019-01-18 17:57:11,160 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:57:11,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:57:11,161 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:57:11,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:57:11,161 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:57:11,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:57:13,560 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:57:13,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:57:13,561 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:57:13,561 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:57:13,561 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:57:13,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:57:13,561 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:57:13,571 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:57:13,571 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:57:13,621 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:57:13,621 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:57:13,624 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:57:13,641 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:57:13,642 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:57:20,007 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:57:20,026 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:57:20,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 153 [2019-01-18 17:57:20,026 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:57:20,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-01-18 17:57:20,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-01-18 17:57:20,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2019-01-18 17:57:20,028 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 78 states. [2019-01-18 17:57:20,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:57:20,140 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-01-18 17:57:20,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-01-18 17:57:20,140 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2019-01-18 17:57:20,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:57:20,141 INFO L225 Difference]: With dead ends: 82 [2019-01-18 17:57:20,141 INFO L226 Difference]: Without dead ends: 80 [2019-01-18 17:57:20,142 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2019-01-18 17:57:20,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-01-18 17:57:20,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-01-18 17:57:20,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-01-18 17:57:20,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-01-18 17:57:20,145 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2019-01-18 17:57:20,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:57:20,146 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-01-18 17:57:20,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-01-18 17:57:20,146 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-01-18 17:57:20,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-01-18 17:57:20,146 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:57:20,146 INFO L402 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2019-01-18 17:57:20,146 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:57:20,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:57:20,147 INFO L82 PathProgramCache]: Analyzing trace with hash -1115885629, now seen corresponding path program 76 times [2019-01-18 17:57:20,147 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:57:20,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:57:20,147 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:57:20,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:57:20,147 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:57:20,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:57:22,460 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:57:22,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:57:22,461 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:57:22,461 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:57:22,461 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:57:22,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:57:22,461 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:57:22,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:57:22,471 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:57:22,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:57:22,519 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:57:22,539 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:57:22,539 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:57:29,546 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:57:29,564 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:57:29,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 155 [2019-01-18 17:57:29,564 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:57:29,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-01-18 17:57:29,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-01-18 17:57:29,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2019-01-18 17:57:29,566 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 79 states. [2019-01-18 17:57:29,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:57:29,937 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-01-18 17:57:29,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-01-18 17:57:29,938 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 79 [2019-01-18 17:57:29,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:57:29,938 INFO L225 Difference]: With dead ends: 83 [2019-01-18 17:57:29,938 INFO L226 Difference]: Without dead ends: 81 [2019-01-18 17:57:29,939 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2019-01-18 17:57:29,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-01-18 17:57:29,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-01-18 17:57:29,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-01-18 17:57:29,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-01-18 17:57:29,941 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2019-01-18 17:57:29,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:57:29,941 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-01-18 17:57:29,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-01-18 17:57:29,941 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-01-18 17:57:29,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-01-18 17:57:29,942 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:57:29,942 INFO L402 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2019-01-18 17:57:29,942 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:57:29,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:57:29,942 INFO L82 PathProgramCache]: Analyzing trace with hash -232714324, now seen corresponding path program 77 times [2019-01-18 17:57:29,942 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:57:29,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:57:29,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:57:29,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:57:29,943 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:57:29,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:57:32,369 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:57:32,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:57:32,370 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:57:32,370 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:57:32,370 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:57:32,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:57:32,370 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:57:32,380 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:57:32,380 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:57:33,092 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2019-01-18 17:57:33,093 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:57:33,098 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:57:33,118 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:57:33,118 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:57:39,734 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:57:39,755 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:57:39,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 157 [2019-01-18 17:57:39,755 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:57:39,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-01-18 17:57:39,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-01-18 17:57:39,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2019-01-18 17:57:39,757 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 80 states. [2019-01-18 17:57:40,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:57:40,389 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-01-18 17:57:40,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-01-18 17:57:40,390 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 80 [2019-01-18 17:57:40,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:57:40,391 INFO L225 Difference]: With dead ends: 84 [2019-01-18 17:57:40,391 INFO L226 Difference]: Without dead ends: 82 [2019-01-18 17:57:40,392 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2019-01-18 17:57:40,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-01-18 17:57:40,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-01-18 17:57:40,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-01-18 17:57:40,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-01-18 17:57:40,395 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2019-01-18 17:57:40,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:57:40,395 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-01-18 17:57:40,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-01-18 17:57:40,396 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-01-18 17:57:40,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-01-18 17:57:40,396 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:57:40,396 INFO L402 BasicCegarLoop]: trace histogram [78, 1, 1, 1] [2019-01-18 17:57:40,396 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:57:40,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:57:40,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1375792355, now seen corresponding path program 78 times [2019-01-18 17:57:40,397 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:57:40,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:57:40,398 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:57:40,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:57:40,398 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:57:40,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:57:43,351 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:57:43,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:57:43,351 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:57:43,351 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:57:43,351 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:57:43,352 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:57:43,352 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:57:43,360 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:57:43,360 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:57:43,419 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:57:43,419 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:57:43,424 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:57:43,444 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:57:43,445 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:57:50,412 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:57:50,430 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:57:50,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 159 [2019-01-18 17:57:50,430 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:57:50,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-01-18 17:57:50,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-01-18 17:57:50,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2019-01-18 17:57:50,432 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 81 states. [2019-01-18 17:57:50,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:57:50,588 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2019-01-18 17:57:50,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-01-18 17:57:50,588 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 81 [2019-01-18 17:57:50,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:57:50,589 INFO L225 Difference]: With dead ends: 85 [2019-01-18 17:57:50,589 INFO L226 Difference]: Without dead ends: 83 [2019-01-18 17:57:50,590 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2019-01-18 17:57:50,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-01-18 17:57:50,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-01-18 17:57:50,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-01-18 17:57:50,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2019-01-18 17:57:50,592 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2019-01-18 17:57:50,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:57:50,593 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2019-01-18 17:57:50,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-01-18 17:57:50,593 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2019-01-18 17:57:50,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-01-18 17:57:50,593 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:57:50,593 INFO L402 BasicCegarLoop]: trace histogram [79, 1, 1, 1] [2019-01-18 17:57:50,594 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:57:50,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:57:50,594 INFO L82 PathProgramCache]: Analyzing trace with hash -300108148, now seen corresponding path program 79 times [2019-01-18 17:57:50,594 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:57:50,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:57:50,595 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:57:50,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:57:50,595 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:57:50,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:57:53,268 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:57:53,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:57:53,268 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:57:53,269 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:57:53,269 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:57:53,269 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:57:53,269 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:57:53,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:57:53,278 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:57:53,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:57:53,330 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:57:53,350 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:57:53,350 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:58:00,331 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:00,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:58:00,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 161 [2019-01-18 17:58:00,350 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:58:00,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-01-18 17:58:00,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-01-18 17:58:00,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2019-01-18 17:58:00,352 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 82 states. [2019-01-18 17:58:00,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:58:00,471 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2019-01-18 17:58:00,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-01-18 17:58:00,472 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 82 [2019-01-18 17:58:00,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:58:00,473 INFO L225 Difference]: With dead ends: 86 [2019-01-18 17:58:00,473 INFO L226 Difference]: Without dead ends: 84 [2019-01-18 17:58:00,474 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-01-18 17:58:00,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-01-18 17:58:00,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-01-18 17:58:00,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-01-18 17:58:00,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2019-01-18 17:58:00,477 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2019-01-18 17:58:00,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:58:00,477 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2019-01-18 17:58:00,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-01-18 17:58:00,477 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2019-01-18 17:58:00,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-01-18 17:58:00,478 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:58:00,478 INFO L402 BasicCegarLoop]: trace histogram [80, 1, 1, 1] [2019-01-18 17:58:00,478 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:58:00,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:58:00,478 INFO L82 PathProgramCache]: Analyzing trace with hash -713416189, now seen corresponding path program 80 times [2019-01-18 17:58:00,478 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:58:00,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:58:00,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:58:00,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:58:00,479 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:58:00,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:58:03,324 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:03,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:58:03,324 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:58:03,324 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:58:03,324 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:58:03,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:58:03,325 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:58:03,333 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:58:03,334 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:58:04,108 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 41 check-sat command(s) [2019-01-18 17:58:04,109 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:58:04,114 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:58:04,133 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:04,133 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:58:11,291 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:11,313 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:58:11,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 163 [2019-01-18 17:58:11,313 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:58:11,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-01-18 17:58:11,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-01-18 17:58:11,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2019-01-18 17:58:11,315 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 83 states. [2019-01-18 17:58:11,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:58:11,508 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2019-01-18 17:58:11,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-01-18 17:58:11,509 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 83 [2019-01-18 17:58:11,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:58:11,509 INFO L225 Difference]: With dead ends: 87 [2019-01-18 17:58:11,509 INFO L226 Difference]: Without dead ends: 85 [2019-01-18 17:58:11,510 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2019-01-18 17:58:11,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-18 17:58:11,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-01-18 17:58:11,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-01-18 17:58:11,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-01-18 17:58:11,512 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2019-01-18 17:58:11,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:58:11,512 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-01-18 17:58:11,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-01-18 17:58:11,512 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-01-18 17:58:11,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-01-18 17:58:11,513 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:58:11,513 INFO L402 BasicCegarLoop]: trace histogram [81, 1, 1, 1] [2019-01-18 17:58:11,513 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:58:11,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:58:11,513 INFO L82 PathProgramCache]: Analyzing trace with hash -641063572, now seen corresponding path program 81 times [2019-01-18 17:58:11,513 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:58:11,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:58:11,514 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:58:11,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:58:11,514 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:58:11,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:58:14,228 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:14,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:58:14,229 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:58:14,229 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:58:14,229 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:58:14,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:58:14,229 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:58:14,238 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:58:14,238 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:58:14,290 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:58:14,290 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:58:14,293 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:58:14,306 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:14,306 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:58:21,447 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:21,465 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:58:21,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 165 [2019-01-18 17:58:21,466 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:58:21,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-01-18 17:58:21,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-01-18 17:58:21,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2019-01-18 17:58:21,468 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 84 states. [2019-01-18 17:58:21,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:58:21,641 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2019-01-18 17:58:21,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-01-18 17:58:21,641 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 84 [2019-01-18 17:58:21,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:58:21,642 INFO L225 Difference]: With dead ends: 88 [2019-01-18 17:58:21,642 INFO L226 Difference]: Without dead ends: 86 [2019-01-18 17:58:21,643 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-01-18 17:58:21,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-01-18 17:58:21,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-01-18 17:58:21,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-01-18 17:58:21,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2019-01-18 17:58:21,645 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 84 [2019-01-18 17:58:21,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:58:21,645 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2019-01-18 17:58:21,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-01-18 17:58:21,646 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2019-01-18 17:58:21,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-01-18 17:58:21,646 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:58:21,646 INFO L402 BasicCegarLoop]: trace histogram [82, 1, 1, 1] [2019-01-18 17:58:21,647 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:58:21,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:58:21,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1601867555, now seen corresponding path program 82 times [2019-01-18 17:58:21,647 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:58:21,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:58:21,648 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:58:21,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:58:21,648 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:58:21,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:58:24,572 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:24,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:58:24,572 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:58:24,572 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:58:24,572 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:58:24,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:58:24,572 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:58:24,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:58:24,581 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:58:24,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:58:24,634 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:58:24,655 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:24,655 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:58:32,030 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:32,049 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:58:32,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 167 [2019-01-18 17:58:32,050 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:58:32,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-01-18 17:58:32,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-01-18 17:58:32,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2019-01-18 17:58:32,052 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 85 states. [2019-01-18 17:58:32,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:58:32,288 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2019-01-18 17:58:32,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-01-18 17:58:32,289 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 85 [2019-01-18 17:58:32,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:58:32,289 INFO L225 Difference]: With dead ends: 89 [2019-01-18 17:58:32,289 INFO L226 Difference]: Without dead ends: 87 [2019-01-18 17:58:32,290 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2019-01-18 17:58:32,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-01-18 17:58:32,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-01-18 17:58:32,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-01-18 17:58:32,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2019-01-18 17:58:32,293 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 85 [2019-01-18 17:58:32,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:58:32,293 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2019-01-18 17:58:32,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-01-18 17:58:32,293 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2019-01-18 17:58:32,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-01-18 17:58:32,293 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:58:32,294 INFO L402 BasicCegarLoop]: trace histogram [83, 1, 1, 1] [2019-01-18 17:58:32,294 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:58:32,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:58:32,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1881711540, now seen corresponding path program 83 times [2019-01-18 17:58:32,294 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:58:32,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:58:32,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:58:32,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:58:32,295 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:58:32,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:58:35,135 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:35,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:58:35,135 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:58:35,135 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:58:35,136 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:58:35,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:58:35,136 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:58:35,145 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:58:35,145 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:58:36,056 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 43 check-sat command(s) [2019-01-18 17:58:36,057 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:58:36,063 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:58:36,076 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:36,076 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:58:43,853 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:43,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:58:43,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 169 [2019-01-18 17:58:43,874 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:58:43,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-01-18 17:58:43,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-01-18 17:58:43,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2019-01-18 17:58:43,876 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 86 states. [2019-01-18 17:58:44,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:58:44,017 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-01-18 17:58:44,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-01-18 17:58:44,017 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 86 [2019-01-18 17:58:44,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:58:44,018 INFO L225 Difference]: With dead ends: 90 [2019-01-18 17:58:44,018 INFO L226 Difference]: Without dead ends: 88 [2019-01-18 17:58:44,019 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2019-01-18 17:58:44,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-01-18 17:58:44,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-01-18 17:58:44,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-01-18 17:58:44,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2019-01-18 17:58:44,022 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 86 [2019-01-18 17:58:44,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:58:44,022 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2019-01-18 17:58:44,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-01-18 17:58:44,022 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2019-01-18 17:58:44,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-01-18 17:58:44,023 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:58:44,023 INFO L402 BasicCegarLoop]: trace histogram [84, 1, 1, 1] [2019-01-18 17:58:44,023 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:58:44,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:58:44,023 INFO L82 PathProgramCache]: Analyzing trace with hash 1796486211, now seen corresponding path program 84 times [2019-01-18 17:58:44,024 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:58:44,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:58:44,024 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:58:44,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:58:44,024 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:58:44,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:58:46,591 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:46,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:58:46,592 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:58:46,592 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:58:46,592 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:58:46,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:58:46,592 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:58:46,600 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:58:46,600 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:58:46,654 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:58:46,654 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:58:46,657 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:58:46,670 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:46,671 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:58:54,670 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:54,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:58:54,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 171 [2019-01-18 17:58:54,689 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:58:54,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-01-18 17:58:54,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-01-18 17:58:54,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2019-01-18 17:58:54,691 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 87 states. [2019-01-18 17:58:54,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:58:54,853 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2019-01-18 17:58:54,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-01-18 17:58:54,854 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 87 [2019-01-18 17:58:54,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:58:54,854 INFO L225 Difference]: With dead ends: 91 [2019-01-18 17:58:54,854 INFO L226 Difference]: Without dead ends: 89 [2019-01-18 17:58:54,855 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2019-01-18 17:58:54,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-01-18 17:58:54,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-01-18 17:58:54,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-01-18 17:58:54,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2019-01-18 17:58:54,857 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 87 [2019-01-18 17:58:54,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:58:54,858 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2019-01-18 17:58:54,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-01-18 17:58:54,858 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2019-01-18 17:58:54,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-01-18 17:58:54,859 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:58:54,859 INFO L402 BasicCegarLoop]: trace histogram [85, 1, 1, 1] [2019-01-18 17:58:54,859 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:58:54,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:58:54,860 INFO L82 PathProgramCache]: Analyzing trace with hash -143500500, now seen corresponding path program 85 times [2019-01-18 17:58:54,860 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:58:54,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:58:54,860 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:58:54,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:58:54,861 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:58:54,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:58:57,422 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:57,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:58:57,423 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:58:57,423 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:58:57,423 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:58:57,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:58:57,424 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:58:57,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:58:57,437 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:58:57,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:58:57,491 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:58:57,504 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:57,504 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:59:05,627 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:59:05,645 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:59:05,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 173 [2019-01-18 17:59:05,646 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:59:05,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-01-18 17:59:05,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-01-18 17:59:05,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2019-01-18 17:59:05,648 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 88 states. [2019-01-18 17:59:05,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:59:05,872 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2019-01-18 17:59:05,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-01-18 17:59:05,873 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 88 [2019-01-18 17:59:05,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:59:05,873 INFO L225 Difference]: With dead ends: 92 [2019-01-18 17:59:05,873 INFO L226 Difference]: Without dead ends: 90 [2019-01-18 17:59:05,874 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2019-01-18 17:59:05,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-01-18 17:59:05,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-01-18 17:59:05,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-01-18 17:59:05,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2019-01-18 17:59:05,877 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 88 [2019-01-18 17:59:05,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:59:05,877 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2019-01-18 17:59:05,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-01-18 17:59:05,877 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2019-01-18 17:59:05,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-01-18 17:59:05,878 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:59:05,878 INFO L402 BasicCegarLoop]: trace histogram [86, 1, 1, 1] [2019-01-18 17:59:05,878 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:59:05,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:59:05,878 INFO L82 PathProgramCache]: Analyzing trace with hash -153546397, now seen corresponding path program 86 times [2019-01-18 17:59:05,879 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:59:05,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:59:05,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:59:05,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:59:05,879 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:59:05,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:59:08,552 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:59:08,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:59:08,552 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:59:08,553 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:59:08,553 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:59:08,553 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:59:08,553 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:59:08,562 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:59:08,562 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:59:09,576 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) [2019-01-18 17:59:09,576 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:59:09,582 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:59:09,597 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:59:09,597 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:59:17,700 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:59:17,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:59:17,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 175 [2019-01-18 17:59:17,722 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:59:17,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-01-18 17:59:17,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-01-18 17:59:17,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2019-01-18 17:59:17,724 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 89 states. [2019-01-18 17:59:17,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:59:17,945 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2019-01-18 17:59:17,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-01-18 17:59:17,945 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 89 [2019-01-18 17:59:17,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:59:17,946 INFO L225 Difference]: With dead ends: 93 [2019-01-18 17:59:17,946 INFO L226 Difference]: Without dead ends: 91 [2019-01-18 17:59:17,947 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2019-01-18 17:59:17,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-01-18 17:59:17,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-01-18 17:59:17,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-01-18 17:59:17,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2019-01-18 17:59:17,948 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 89 [2019-01-18 17:59:17,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:59:17,949 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2019-01-18 17:59:17,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-01-18 17:59:17,949 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2019-01-18 17:59:17,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-01-18 17:59:17,949 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:59:17,949 INFO L402 BasicCegarLoop]: trace histogram [87, 1, 1, 1] [2019-01-18 17:59:17,949 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:59:17,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:59:17,950 INFO L82 PathProgramCache]: Analyzing trace with hash -464969204, now seen corresponding path program 87 times [2019-01-18 17:59:17,950 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:59:17,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:59:17,950 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:59:17,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:59:17,951 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:59:17,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:59:20,924 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:59:20,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:59:20,924 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:59:20,925 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:59:20,925 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:59:20,925 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:59:20,925 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:59:20,934 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:59:20,934 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:59:20,993 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:59:20,993 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:59:20,997 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:59:21,026 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:59:21,026 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:59:29,188 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:59:29,220 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:59:29,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 177 [2019-01-18 17:59:29,220 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:59:29,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-01-18 17:59:29,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-01-18 17:59:29,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2019-01-18 17:59:29,223 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 90 states. [2019-01-18 17:59:29,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:59:29,366 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2019-01-18 17:59:29,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-01-18 17:59:29,366 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 90 [2019-01-18 17:59:29,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:59:29,367 INFO L225 Difference]: With dead ends: 94 [2019-01-18 17:59:29,367 INFO L226 Difference]: Without dead ends: 92 [2019-01-18 17:59:29,368 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2019-01-18 17:59:29,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-01-18 17:59:29,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-01-18 17:59:29,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-01-18 17:59:29,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2019-01-18 17:59:29,371 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 90 [2019-01-18 17:59:29,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:59:29,371 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2019-01-18 17:59:29,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-01-18 17:59:29,371 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2019-01-18 17:59:29,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-18 17:59:29,372 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:59:29,372 INFO L402 BasicCegarLoop]: trace histogram [88, 1, 1, 1] [2019-01-18 17:59:29,372 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:59:29,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:59:29,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1529141629, now seen corresponding path program 88 times [2019-01-18 17:59:29,372 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:59:29,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:59:29,373 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:59:29,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:59:29,373 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:59:29,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:59:32,247 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:59:32,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:59:32,248 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:59:32,248 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:59:32,248 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:59:32,248 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:59: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 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:59:32,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:59:32,257 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:59:32,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:59:32,314 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:59:32,329 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:59:32,329 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:59:41,083 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:59:41,101 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:59:41,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90, 90] total 179 [2019-01-18 17:59:41,102 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:59:41,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-01-18 17:59:41,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-01-18 17:59:41,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2019-01-18 17:59:41,104 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 91 states. [2019-01-18 17:59:41,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:59:41,335 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2019-01-18 17:59:41,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-01-18 17:59:41,335 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 91 [2019-01-18 17:59:41,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:59:41,336 INFO L225 Difference]: With dead ends: 95 [2019-01-18 17:59:41,336 INFO L226 Difference]: Without dead ends: 93 [2019-01-18 17:59:41,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2019-01-18 17:59:41,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-01-18 17:59:41,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-01-18 17:59:41,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-01-18 17:59:41,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2019-01-18 17:59:41,339 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 91 [2019-01-18 17:59:41,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:59:41,339 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2019-01-18 17:59:41,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-01-18 17:59:41,339 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2019-01-18 17:59:41,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-18 17:59:41,339 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:59:41,339 INFO L402 BasicCegarLoop]: trace histogram [89, 1, 1, 1] [2019-01-18 17:59:41,340 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:59:41,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:59:41,340 INFO L82 PathProgramCache]: Analyzing trace with hash -158748436, now seen corresponding path program 89 times [2019-01-18 17:59:41,340 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:59:41,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:59:41,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:59:41,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:59:41,341 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:59:41,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:59:44,181 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:59:44,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:59:44,182 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:59:44,182 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:59:44,182 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:59:44,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:59:44,182 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:59:44,190 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:59:44,190 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:59:45,384 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2019-01-18 17:59:45,385 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:59:45,391 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:59:45,405 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:59:45,405 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:59:53,848 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:59:53,869 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:59:53,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 181 [2019-01-18 17:59:53,869 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:59:53,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-01-18 17:59:53,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-01-18 17:59:53,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2019-01-18 17:59:53,871 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 92 states. [2019-01-18 17:59:54,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:59:54,029 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2019-01-18 17:59:54,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-01-18 17:59:54,029 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 92 [2019-01-18 17:59:54,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:59:54,030 INFO L225 Difference]: With dead ends: 96 [2019-01-18 17:59:54,030 INFO L226 Difference]: Without dead ends: 94 [2019-01-18 17:59:54,032 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-01-18 17:59:54,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-01-18 17:59:54,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2019-01-18 17:59:54,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-01-18 17:59:54,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2019-01-18 17:59:54,035 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 92 [2019-01-18 17:59:54,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:59:54,035 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2019-01-18 17:59:54,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-01-18 17:59:54,035 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2019-01-18 17:59:54,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-18 17:59:54,035 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:59:54,035 INFO L402 BasicCegarLoop]: trace histogram [90, 1, 1, 1] [2019-01-18 17:59:54,036 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:59:54,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:59:54,036 INFO L82 PathProgramCache]: Analyzing trace with hash -626232413, now seen corresponding path program 90 times [2019-01-18 17:59:54,036 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:59:54,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:59:54,037 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:59:54,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:59:54,037 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:59:54,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:59:57,182 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:59:57,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:59:57,182 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:59:57,182 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:59:57,182 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:59:57,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:59:57,182 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:59:57,193 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:59:57,193 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:59:57,252 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:59:57,252 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:59:57,255 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:59:57,271 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:59:57,271 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:00:06,101 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:00:06,119 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:00:06,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92, 92] total 183 [2019-01-18 18:00:06,119 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:00:06,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-01-18 18:00:06,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-01-18 18:00:06,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2019-01-18 18:00:06,122 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 93 states. [2019-01-18 18:00:06,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:00:06,372 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2019-01-18 18:00:06,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-01-18 18:00:06,372 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 93 [2019-01-18 18:00:06,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:00:06,373 INFO L225 Difference]: With dead ends: 97 [2019-01-18 18:00:06,373 INFO L226 Difference]: Without dead ends: 95 [2019-01-18 18:00:06,375 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2019-01-18 18:00:06,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-01-18 18:00:06,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-01-18 18:00:06,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-01-18 18:00:06,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2019-01-18 18:00:06,377 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 93 [2019-01-18 18:00:06,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:00:06,377 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2019-01-18 18:00:06,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-01-18 18:00:06,378 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2019-01-18 18:00:06,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-18 18:00:06,378 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:00:06,378 INFO L402 BasicCegarLoop]: trace histogram [91, 1, 1, 1] [2019-01-18 18:00:06,379 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:00:06,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:00:06,379 INFO L82 PathProgramCache]: Analyzing trace with hash 2061633484, now seen corresponding path program 91 times [2019-01-18 18:00:06,379 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:00:06,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:00:06,380 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:00:06,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:00:06,380 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:00:06,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:00:09,350 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:00:09,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:00:09,351 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:00:09,351 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:00:09,351 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:00:09,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:00:09,351 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:00:09,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:00:09,361 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:00:09,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:00:09,419 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:00:09,435 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:00:09,436 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:00:18,651 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:00:18,669 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:00:18,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 185 [2019-01-18 18:00:18,670 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:00:18,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-01-18 18:00:18,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-01-18 18:00:18,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2019-01-18 18:00:18,672 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 94 states. [2019-01-18 18:00:18,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:00:18,872 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2019-01-18 18:00:18,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-01-18 18:00:18,873 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 94 [2019-01-18 18:00:18,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:00:18,873 INFO L225 Difference]: With dead ends: 98 [2019-01-18 18:00:18,873 INFO L226 Difference]: Without dead ends: 96 [2019-01-18 18:00:18,874 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-01-18 18:00:18,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-01-18 18:00:18,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-01-18 18:00:18,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-01-18 18:00:18,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2019-01-18 18:00:18,876 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 94 [2019-01-18 18:00:18,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:00:18,877 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2019-01-18 18:00:18,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-01-18 18:00:18,877 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2019-01-18 18:00:18,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-18 18:00:18,877 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:00:18,877 INFO L402 BasicCegarLoop]: trace histogram [92, 1, 1, 1] [2019-01-18 18:00:18,877 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:00:18,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:00:18,878 INFO L82 PathProgramCache]: Analyzing trace with hash -513869629, now seen corresponding path program 92 times [2019-01-18 18:00:18,878 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:00:18,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:00:18,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:00:18,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:00:18,879 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:00:18,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:00:22,261 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:00:22,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:00:22,262 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:00:22,262 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:00:22,262 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:00:22,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:00:22,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 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:00:22,270 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 18:00:22,271 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 18:00:23,554 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 47 check-sat command(s) [2019-01-18 18:00:23,555 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:00:23,560 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:00:23,576 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:00:23,576 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:00:32,886 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:00:32,906 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:00:32,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94, 94] total 187 [2019-01-18 18:00:32,907 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:00:32,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-01-18 18:00:32,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-01-18 18:00:32,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2019-01-18 18:00:32,910 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 95 states. [2019-01-18 18:00:33,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:00:33,075 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2019-01-18 18:00:33,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-01-18 18:00:33,076 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 95 [2019-01-18 18:00:33,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:00:33,076 INFO L225 Difference]: With dead ends: 99 [2019-01-18 18:00:33,077 INFO L226 Difference]: Without dead ends: 97 [2019-01-18 18:00:33,078 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-01-18 18:00:33,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-01-18 18:00:33,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-01-18 18:00:33,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-01-18 18:00:33,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2019-01-18 18:00:33,080 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 95 [2019-01-18 18:00:33,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:00:33,080 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2019-01-18 18:00:33,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-01-18 18:00:33,080 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2019-01-18 18:00:33,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-18 18:00:33,081 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:00:33,081 INFO L402 BasicCegarLoop]: trace histogram [93, 1, 1, 1] [2019-01-18 18:00:33,081 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:00:33,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:00:33,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1249912492, now seen corresponding path program 93 times [2019-01-18 18:00:33,082 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:00:33,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:00:33,082 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:00:33,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:00:33,082 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:00:33,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:00:36,481 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:00:36,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:00:36,482 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:00:36,482 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:00:36,482 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:00:36,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:00:36,482 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:00:36,491 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 18:00:36,491 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 18:00:36,550 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 18:00:36,550 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:00:36,553 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:00:36,568 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:00:36,568 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:00:45,909 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:00:45,929 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:00:45,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 189 [2019-01-18 18:00:45,929 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:00:45,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-01-18 18:00:45,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-01-18 18:00:45,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2019-01-18 18:00:45,931 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 96 states. [2019-01-18 18:00:46,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:00:46,076 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2019-01-18 18:00:46,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-01-18 18:00:46,077 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 96 [2019-01-18 18:00:46,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:00:46,078 INFO L225 Difference]: With dead ends: 100 [2019-01-18 18:00:46,078 INFO L226 Difference]: Without dead ends: 98 [2019-01-18 18:00:46,079 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2019-01-18 18:00:46,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-01-18 18:00:46,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2019-01-18 18:00:46,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-01-18 18:00:46,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2019-01-18 18:00:46,081 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 96 [2019-01-18 18:00:46,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:00:46,081 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2019-01-18 18:00:46,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-01-18 18:00:46,081 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2019-01-18 18:00:46,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-01-18 18:00:46,082 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:00:46,082 INFO L402 BasicCegarLoop]: trace histogram [94, 1, 1, 1] [2019-01-18 18:00:46,082 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:00:46,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:00:46,082 INFO L82 PathProgramCache]: Analyzing trace with hash 92583395, now seen corresponding path program 94 times [2019-01-18 18:00:46,082 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:00:46,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:00:46,083 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:00:46,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:00:46,083 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:00:46,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:00:49,558 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:00:49,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:00:49,559 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:00:49,559 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:00:49,559 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:00:49,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:00:49,559 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:00:49,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:00:49,568 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:00:49,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:00:49,630 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:00:49,647 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:00:49,647 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:00:59,402 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:00:59,421 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:00:59,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 191 [2019-01-18 18:00:59,421 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:00:59,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-01-18 18:00:59,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-01-18 18:00:59,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2019-01-18 18:00:59,424 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 97 states. [2019-01-18 18:00:59,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:00:59,579 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2019-01-18 18:00:59,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-01-18 18:00:59,580 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 97 [2019-01-18 18:00:59,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:00:59,580 INFO L225 Difference]: With dead ends: 101 [2019-01-18 18:00:59,581 INFO L226 Difference]: Without dead ends: 99 [2019-01-18 18:00:59,582 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2019-01-18 18:00:59,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-01-18 18:00:59,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-01-18 18:00:59,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-01-18 18:00:59,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2019-01-18 18:00:59,585 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 97 [2019-01-18 18:00:59,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:00:59,585 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2019-01-18 18:00:59,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-01-18 18:00:59,585 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2019-01-18 18:00:59,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-18 18:00:59,586 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:00:59,586 INFO L402 BasicCegarLoop]: trace histogram [95, 1, 1, 1] [2019-01-18 18:00:59,586 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:00:59,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:00:59,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1424880244, now seen corresponding path program 95 times [2019-01-18 18:00:59,587 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:00:59,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:00:59,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:00:59,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:00:59,588 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:00:59,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:01:03,098 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:01:03,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:01:03,098 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:01:03,099 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:01:03,099 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:01:03,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:01:03,099 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:01:03,109 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 18:01:03,109 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 18:01:04,594 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 49 check-sat command(s) [2019-01-18 18:01:04,594 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:01:04,600 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:01:04,615 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:01:04,615 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:01:14,654 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:01:14,675 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:01:14,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 193 [2019-01-18 18:01:14,675 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:01:14,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-01-18 18:01:14,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-01-18 18:01:14,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2019-01-18 18:01:14,678 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 98 states. [2019-01-18 18:01:14,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:01:14,844 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2019-01-18 18:01:14,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-01-18 18:01:14,845 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 98 [2019-01-18 18:01:14,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:01:14,845 INFO L225 Difference]: With dead ends: 102 [2019-01-18 18:01:14,845 INFO L226 Difference]: Without dead ends: 100 [2019-01-18 18:01:14,846 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2019-01-18 18:01:14,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-01-18 18:01:14,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-01-18 18:01:14,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-01-18 18:01:14,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2019-01-18 18:01:14,848 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 98 [2019-01-18 18:01:14,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:01:14,848 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2019-01-18 18:01:14,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-01-18 18:01:14,849 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2019-01-18 18:01:14,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-01-18 18:01:14,849 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:01:14,849 INFO L402 BasicCegarLoop]: trace histogram [96, 1, 1, 1] [2019-01-18 18:01:14,850 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:01:14,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:01:14,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1221612797, now seen corresponding path program 96 times [2019-01-18 18:01:14,850 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:01:14,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:01:14,851 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:01:14,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:01:14,851 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:01:14,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:01:18,425 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:01:18,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:01:18,426 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:01:18,426 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:01:18,426 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:01:18,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:01:18,426 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:01:18,436 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 18:01:18,436 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 18:01:18,497 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 18:01:18,498 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:01:18,501 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:01:18,518 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:01:18,518 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:01:28,639 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:01:28,657 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:01:28,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 195 [2019-01-18 18:01:28,657 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:01:28,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-01-18 18:01:28,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-01-18 18:01:28,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2019-01-18 18:01:28,660 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 99 states. [2019-01-18 18:01:28,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:01:28,878 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2019-01-18 18:01:28,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-01-18 18:01:28,878 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 99 [2019-01-18 18:01:28,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:01:28,879 INFO L225 Difference]: With dead ends: 103 [2019-01-18 18:01:28,879 INFO L226 Difference]: Without dead ends: 101 [2019-01-18 18:01:28,880 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2019-01-18 18:01:28,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-01-18 18:01:28,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-01-18 18:01:28,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-01-18 18:01:28,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2019-01-18 18:01:28,884 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 99 [2019-01-18 18:01:28,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:01:28,884 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2019-01-18 18:01:28,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-01-18 18:01:28,884 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2019-01-18 18:01:28,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-18 18:01:28,884 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:01:28,885 INFO L402 BasicCegarLoop]: trace histogram [97, 1, 1, 1] [2019-01-18 18:01:28,885 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:01:28,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:01:28,885 INFO L82 PathProgramCache]: Analyzing trace with hash 784710764, now seen corresponding path program 97 times [2019-01-18 18:01:28,885 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:01:28,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:01:28,886 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:01:28,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:01:28,886 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:01:28,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:01:32,266 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:01:32,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:01:32,266 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:01:32,266 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:01:32,267 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:01:32,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:01:32,267 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:01:32,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:01:32,275 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:01:32,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:01:32,338 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:01:32,354 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:01:32,354 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:01:42,960 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:01:42,980 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:01:42,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 197 [2019-01-18 18:01:42,980 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:01:42,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-01-18 18:01:42,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-01-18 18:01:42,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2019-01-18 18:01:42,983 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 100 states. [2019-01-18 18:01:43,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:01:43,289 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2019-01-18 18:01:43,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-01-18 18:01:43,290 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 100 [2019-01-18 18:01:43,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:01:43,290 INFO L225 Difference]: With dead ends: 104 [2019-01-18 18:01:43,291 INFO L226 Difference]: Without dead ends: 102 [2019-01-18 18:01:43,292 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2019-01-18 18:01:43,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-01-18 18:01:43,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-01-18 18:01:43,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-01-18 18:01:43,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2019-01-18 18:01:43,294 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 100 [2019-01-18 18:01:43,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:01:43,294 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2019-01-18 18:01:43,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-01-18 18:01:43,294 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2019-01-18 18:01:43,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-01-18 18:01:43,295 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:01:43,295 INFO L402 BasicCegarLoop]: trace histogram [98, 1, 1, 1] [2019-01-18 18:01:43,295 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:01:43,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:01:43,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1443768285, now seen corresponding path program 98 times [2019-01-18 18:01:43,295 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:01:43,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:01:43,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:01:43,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:01:43,296 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:01:43,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:01:46,762 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:01:46,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:01:46,762 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:01:46,762 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:01:46,762 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:01:46,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:01:46,763 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:01:46,771 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 18:01:46,771 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 18:01:48,406 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 50 check-sat command(s) [2019-01-18 18:01:48,406 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:01:48,413 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:01:48,429 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:01:48,429 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:01:58,936 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:01:58,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:01:58,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100, 100] total 199 [2019-01-18 18:01:58,958 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:01:58,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-01-18 18:01:58,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-01-18 18:01:58,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2019-01-18 18:01:58,960 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 101 states. [2019-01-18 18:01:59,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:01:59,207 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2019-01-18 18:01:59,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-01-18 18:01:59,208 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 101 [2019-01-18 18:01:59,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:01:59,208 INFO L225 Difference]: With dead ends: 105 [2019-01-18 18:01:59,208 INFO L226 Difference]: Without dead ends: 103 [2019-01-18 18:01:59,209 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2019-01-18 18:01:59,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-01-18 18:01:59,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-01-18 18:01:59,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-01-18 18:01:59,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2019-01-18 18:01:59,212 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 101 [2019-01-18 18:01:59,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:01:59,213 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2019-01-18 18:01:59,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-01-18 18:01:59,213 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2019-01-18 18:01:59,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-18 18:01:59,213 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:01:59,213 INFO L402 BasicCegarLoop]: trace histogram [99, 1, 1, 1] [2019-01-18 18:01:59,213 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:01:59,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:01:59,214 INFO L82 PathProgramCache]: Analyzing trace with hash -1807142068, now seen corresponding path program 99 times [2019-01-18 18:01:59,214 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:01:59,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:01:59,214 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:01:59,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:01:59,214 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:01:59,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:02:02,646 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:02:02,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:02:02,647 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:02:02,647 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:02:02,647 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:02:02,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:02:02,647 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:02:02,656 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 18:02:02,656 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 18:02:02,714 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 18:02:02,715 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:02:02,718 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:02:02,735 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:02:02,735 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:02:14,045 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:02:14,063 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:02:14,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101, 101] total 201 [2019-01-18 18:02:14,063 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:02:14,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-01-18 18:02:14,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-01-18 18:02:14,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2019-01-18 18:02:14,066 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 102 states. [2019-01-18 18:02:14,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:02:14,346 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2019-01-18 18:02:14,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-01-18 18:02:14,347 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 102 [2019-01-18 18:02:14,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:02:14,348 INFO L225 Difference]: With dead ends: 106 [2019-01-18 18:02:14,348 INFO L226 Difference]: Without dead ends: 104 [2019-01-18 18:02:14,349 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2019-01-18 18:02:14,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-01-18 18:02:14,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-01-18 18:02:14,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-01-18 18:02:14,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2019-01-18 18:02:14,351 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 102 [2019-01-18 18:02:14,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:02:14,352 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2019-01-18 18:02:14,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-01-18 18:02:14,352 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2019-01-18 18:02:14,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-01-18 18:02:14,352 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:02:14,353 INFO L402 BasicCegarLoop]: trace histogram [100, 1, 1, 1] [2019-01-18 18:02:14,353 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:02:14,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:02:14,353 INFO L82 PathProgramCache]: Analyzing trace with hash -186827453, now seen corresponding path program 100 times [2019-01-18 18:02:14,353 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:02:14,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:02:14,354 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:02:14,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:02:14,354 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:02:14,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:02:17,881 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:02:17,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:02:17,881 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:02:17,881 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:02:17,881 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:02:17,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:02:17,881 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:02:17,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:02:17,892 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:02:17,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:02:17,957 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:02:17,976 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:02:17,976 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:02:29,254 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:02:29,272 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:02:29,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 102, 102] total 203 [2019-01-18 18:02:29,273 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:02:29,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-01-18 18:02:29,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-01-18 18:02:29,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2019-01-18 18:02:29,275 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 103 states. [2019-01-18 18:02:29,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:02:29,456 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2019-01-18 18:02:29,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-01-18 18:02:29,456 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 103 [2019-01-18 18:02:29,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:02:29,457 INFO L225 Difference]: With dead ends: 107 [2019-01-18 18:02:29,458 INFO L226 Difference]: Without dead ends: 105 [2019-01-18 18:02:29,459 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2019-01-18 18:02:29,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-01-18 18:02:29,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-01-18 18:02:29,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-01-18 18:02:29,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2019-01-18 18:02:29,462 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 103 [2019-01-18 18:02:29,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:02:29,463 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2019-01-18 18:02:29,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-01-18 18:02:29,463 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2019-01-18 18:02:29,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-01-18 18:02:29,463 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:02:29,464 INFO L402 BasicCegarLoop]: trace histogram [101, 1, 1, 1] [2019-01-18 18:02:29,464 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:02:29,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:02:29,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1496681940, now seen corresponding path program 101 times [2019-01-18 18:02:29,464 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:02:29,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:02:29,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:02:29,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:02:29,465 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:02:29,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:02:33,110 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:02:33,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:02:33,110 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:02:33,110 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:02:33,111 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:02:33,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:02:33,111 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:02:33,120 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 18:02:33,120 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 18:02:35,039 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2019-01-18 18:02:35,039 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:02:35,046 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:02:35,063 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:02:35,063 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:02:46,282 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:02:46,304 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:02:46,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 103, 103] total 205 [2019-01-18 18:02:46,305 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:02:46,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-01-18 18:02:46,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-01-18 18:02:46,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2019-01-18 18:02:46,309 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 104 states. [2019-01-18 18:02:46,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:02:46,645 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2019-01-18 18:02:46,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-01-18 18:02:46,645 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 104 [2019-01-18 18:02:46,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:02:46,646 INFO L225 Difference]: With dead ends: 108 [2019-01-18 18:02:46,646 INFO L226 Difference]: Without dead ends: 106 [2019-01-18 18:02:46,648 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.7s TimeCoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2019-01-18 18:02:46,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-01-18 18:02:46,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2019-01-18 18:02:46,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-01-18 18:02:46,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2019-01-18 18:02:46,651 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 104 [2019-01-18 18:02:46,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:02:46,651 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2019-01-18 18:02:46,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-01-18 18:02:46,651 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2019-01-18 18:02:46,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-01-18 18:02:46,652 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:02:46,652 INFO L402 BasicCegarLoop]: trace histogram [102, 1, 1, 1] [2019-01-18 18:02:46,652 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:02:46,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:02:46,653 INFO L82 PathProgramCache]: Analyzing trace with hash 847501923, now seen corresponding path program 102 times [2019-01-18 18:02:46,653 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:02:46,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:02:46,653 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:02:46,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:02:46,654 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:02:46,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:02:50,655 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:02:50,656 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:02:50,656 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:02:50,656 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:02:50,656 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:02:50,656 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:02:50,656 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:02:50,665 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 18:02:50,665 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 18:02:50,728 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 18:02:50,729 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:02:50,733 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:02:50,759 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:02:50,759 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:03:02,015 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:03:02,034 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:03:02,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104, 104, 104] total 207 [2019-01-18 18:03:02,034 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:03:02,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-01-18 18:03:02,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-01-18 18:03:02,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2019-01-18 18:03:02,038 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 105 states. [2019-01-18 18:03:02,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:03:02,340 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2019-01-18 18:03:02,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-01-18 18:03:02,341 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 105 [2019-01-18 18:03:02,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:03:02,341 INFO L225 Difference]: With dead ends: 109 [2019-01-18 18:03:02,341 INFO L226 Difference]: Without dead ends: 107 [2019-01-18 18:03:02,343 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-01-18 18:03:02,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-01-18 18:03:02,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-01-18 18:03:02,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-01-18 18:03:02,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2019-01-18 18:03:02,347 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 105 [2019-01-18 18:03:02,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:03:02,347 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2019-01-18 18:03:02,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-01-18 18:03:02,347 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2019-01-18 18:03:02,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-01-18 18:03:02,348 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:03:02,348 INFO L402 BasicCegarLoop]: trace histogram [103, 1, 1, 1] [2019-01-18 18:03:02,348 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:03:02,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:03:02,348 INFO L82 PathProgramCache]: Analyzing trace with hash 502757644, now seen corresponding path program 103 times [2019-01-18 18:03:02,348 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:03:02,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:03:02,349 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:03:02,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:03:02,349 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:03:02,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:03:06,433 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:03:06,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:03:06,433 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:03:06,433 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:03:06,434 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:03:06,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:03:06,434 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:03:06,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:03:06,445 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:03:06,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:03:06,513 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:03:06,538 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:03:06,539 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:03:18,166 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:03:18,184 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:03:18,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105, 105, 105] total 209 [2019-01-18 18:03:18,185 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:03:18,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-01-18 18:03:18,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-01-18 18:03:18,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2019-01-18 18:03:18,187 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 106 states. [2019-01-18 18:03:18,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:03:18,433 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2019-01-18 18:03:18,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-01-18 18:03:18,434 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 106 [2019-01-18 18:03:18,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:03:18,434 INFO L225 Difference]: With dead ends: 110 [2019-01-18 18:03:18,434 INFO L226 Difference]: Without dead ends: 108 [2019-01-18 18:03:18,435 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-01-18 18:03:18,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-01-18 18:03:18,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-01-18 18:03:18,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-01-18 18:03:18,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2019-01-18 18:03:18,439 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 106 [2019-01-18 18:03:18,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:03:18,439 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2019-01-18 18:03:18,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-01-18 18:03:18,439 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2019-01-18 18:03:18,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-01-18 18:03:18,440 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:03:18,440 INFO L402 BasicCegarLoop]: trace histogram [104, 1, 1, 1] [2019-01-18 18:03:18,440 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:03:18,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:03:18,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1594380413, now seen corresponding path program 104 times [2019-01-18 18:03:18,441 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:03:18,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:03:18,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:03:18,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:03:18,442 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:03:18,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:03:22,389 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:03:22,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:03:22,389 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:03:22,389 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:03:22,390 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:03:22,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:03:22,390 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:03:22,399 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 18:03:22,399 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 18:03:24,436 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 53 check-sat command(s) [2019-01-18 18:03:24,437 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:03:24,444 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:03:24,471 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:03:24,471 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:03:36,469 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:03:36,491 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:03:36,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106, 106, 106] total 211 [2019-01-18 18:03:36,491 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:03:36,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-01-18 18:03:36,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-01-18 18:03:36,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2019-01-18 18:03:36,493 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 107 states. [2019-01-18 18:03:36,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:03:36,727 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2019-01-18 18:03:36,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-01-18 18:03:36,728 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 107 [2019-01-18 18:03:36,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:03:36,729 INFO L225 Difference]: With dead ends: 111 [2019-01-18 18:03:36,729 INFO L226 Difference]: Without dead ends: 109 [2019-01-18 18:03:36,730 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2019-01-18 18:03:36,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-01-18 18:03:36,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-01-18 18:03:36,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-01-18 18:03:36,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2019-01-18 18:03:36,732 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 107 [2019-01-18 18:03:36,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:03:36,732 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2019-01-18 18:03:36,732 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-01-18 18:03:36,733 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2019-01-18 18:03:36,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-01-18 18:03:36,733 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:03:36,733 INFO L402 BasicCegarLoop]: trace histogram [105, 1, 1, 1] [2019-01-18 18:03:36,733 INFO L423 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:03:36,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:03:36,733 INFO L82 PathProgramCache]: Analyzing trace with hash 2113816556, now seen corresponding path program 105 times [2019-01-18 18:03:36,733 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:03:36,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:03:36,734 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:03:36,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:03:36,734 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:03:36,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:03:40,872 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:03:40,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:03:40,873 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:03:40,873 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:03:40,873 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:03:40,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:03:40,873 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:03:40,881 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 18:03:40,882 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 18:03:40,948 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 18:03:40,948 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:03:40,952 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:03:40,971 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:03:40,972 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:03:53,107 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:03:53,125 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:03:53,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107, 107, 107] total 213 [2019-01-18 18:03:53,126 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:03:53,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-01-18 18:03:53,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-01-18 18:03:53,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22791, Invalid=22791, Unknown=0, NotChecked=0, Total=45582 [2019-01-18 18:03:53,128 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 108 states. [2019-01-18 18:03:53,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:03:53,377 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2019-01-18 18:03:53,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2019-01-18 18:03:53,378 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 108 [2019-01-18 18:03:53,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:03:53,378 INFO L225 Difference]: With dead ends: 112 [2019-01-18 18:03:53,378 INFO L226 Difference]: Without dead ends: 110 [2019-01-18 18:03:53,379 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.1s TimeCoverageRelationStatistics Valid=22791, Invalid=22791, Unknown=0, NotChecked=0, Total=45582 [2019-01-18 18:03:53,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-01-18 18:03:53,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2019-01-18 18:03:53,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-01-18 18:03:53,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2019-01-18 18:03:53,381 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 108 [2019-01-18 18:03:53,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:03:53,382 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2019-01-18 18:03:53,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-01-18 18:03:53,382 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2019-01-18 18:03:53,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-01-18 18:03:53,382 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:03:53,382 INFO L402 BasicCegarLoop]: trace histogram [106, 1, 1, 1] [2019-01-18 18:03:53,383 INFO L423 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:03:53,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:03:53,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1103805603, now seen corresponding path program 106 times [2019-01-18 18:03:53,383 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:03:53,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:03:53,384 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:03:53,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:03:53,384 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:03:53,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:03:57,572 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:03:57,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:03:57,572 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:03:57,572 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:03:57,572 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:03:57,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:03:57,573 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-18 18:03:57,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:03:57,586 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:03:57,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:03:57,654 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:03:57,672 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:03:57,673 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:04:09,927 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:04:09,946 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:04:09,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108, 108, 108] total 215 [2019-01-18 18:04:09,946 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:04:09,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 109 states [2019-01-18 18:04:09,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2019-01-18 18:04:09,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23220, Invalid=23220, Unknown=0, NotChecked=0, Total=46440 [2019-01-18 18:04:09,949 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 109 states. [2019-01-18 18:04:10,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:04:10,212 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2019-01-18 18:04:10,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2019-01-18 18:04:10,213 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 109 [2019-01-18 18:04:10,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:04:10,213 INFO L225 Difference]: With dead ends: 113 [2019-01-18 18:04:10,213 INFO L226 Difference]: Without dead ends: 111 [2019-01-18 18:04:10,215 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.3s TimeCoverageRelationStatistics Valid=23220, Invalid=23220, Unknown=0, NotChecked=0, Total=46440 [2019-01-18 18:04:10,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-01-18 18:04:10,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-01-18 18:04:10,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-01-18 18:04:10,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2019-01-18 18:04:10,218 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 109 [2019-01-18 18:04:10,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:04:10,218 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2019-01-18 18:04:10,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 109 states. [2019-01-18 18:04:10,218 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2019-01-18 18:04:10,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-01-18 18:04:10,219 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:04:10,219 INFO L402 BasicCegarLoop]: trace histogram [107, 1, 1, 1] [2019-01-18 18:04:10,219 INFO L423 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:04:10,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:04:10,219 INFO L82 PathProgramCache]: Analyzing trace with hash -141762868, now seen corresponding path program 107 times [2019-01-18 18:04:10,219 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:04:10,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:04:10,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:04:10,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:04:10,220 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:04:10,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:04:14,556 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:04:14,557 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:04:14,557 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:04:14,557 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:04:14,557 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:04:14,557 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:04:14,557 INFO 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-01-18 18:04:14,566 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 18:04:14,567 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 18:04:16,949 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 55 check-sat command(s) [2019-01-18 18:04:16,950 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:04:16,956 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:04:16,974 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:04:16,974 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:04:29,243 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:04:29,265 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:04:29,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109, 109, 109] total 217 [2019-01-18 18:04:29,266 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:04:29,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-01-18 18:04:29,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-01-18 18:04:29,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23653, Invalid=23653, Unknown=0, NotChecked=0, Total=47306 [2019-01-18 18:04:29,270 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 110 states. [2019-01-18 18:04:29,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:04:29,624 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2019-01-18 18:04:29,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2019-01-18 18:04:29,624 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 110 [2019-01-18 18:04:29,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:04:29,625 INFO L225 Difference]: With dead ends: 114 [2019-01-18 18:04:29,625 INFO L226 Difference]: Without dead ends: 112 [2019-01-18 18:04:29,627 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.4s TimeCoverageRelationStatistics Valid=23653, Invalid=23653, Unknown=0, NotChecked=0, Total=47306 [2019-01-18 18:04:29,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-01-18 18:04:29,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2019-01-18 18:04:29,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-01-18 18:04:29,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2019-01-18 18:04:29,629 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 110 [2019-01-18 18:04:29,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:04:29,629 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2019-01-18 18:04:29,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2019-01-18 18:04:29,629 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2019-01-18 18:04:29,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-01-18 18:04:29,629 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:04:29,630 INFO L402 BasicCegarLoop]: trace histogram [108, 1, 1, 1] [2019-01-18 18:04:29,630 INFO L423 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:04:29,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:04:29,630 INFO L82 PathProgramCache]: Analyzing trace with hash -99679805, now seen corresponding path program 108 times [2019-01-18 18:04:29,630 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:04:29,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:04:29,631 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:04:29,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:04:29,631 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:04:29,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:04:34,050 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:04:34,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:04:34,050 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:04:34,050 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:04:34,050 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:04:34,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:04:34,050 INFO 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-01-18 18:04:34,060 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 18:04:34,061 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 18:04:34,125 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 18:04:34,125 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:04:34,129 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:04:34,149 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:04:34,149 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:04:46,689 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:04:46,708 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:04:46,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110, 110, 110] total 219 [2019-01-18 18:04:46,708 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:04:46,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-01-18 18:04:46,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-01-18 18:04:46,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24090, Invalid=24090, Unknown=0, NotChecked=0, Total=48180 [2019-01-18 18:04:46,712 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 111 states. [2019-01-18 18:04:46,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:04:46,984 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2019-01-18 18:04:46,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-01-18 18:04:46,984 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 111 [2019-01-18 18:04:46,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:04:46,985 INFO L225 Difference]: With dead ends: 115 [2019-01-18 18:04:46,985 INFO L226 Difference]: Without dead ends: 113 [2019-01-18 18:04:46,987 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.8s TimeCoverageRelationStatistics Valid=24090, Invalid=24090, Unknown=0, NotChecked=0, Total=48180 [2019-01-18 18:04:46,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-01-18 18:04:46,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-01-18 18:04:46,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-01-18 18:04:46,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2019-01-18 18:04:46,990 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 111 [2019-01-18 18:04:46,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:04:46,990 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2019-01-18 18:04:46,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-01-18 18:04:46,990 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2019-01-18 18:04:46,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-01-18 18:04:46,991 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:04:46,991 INFO L402 BasicCegarLoop]: trace histogram [109, 1, 1, 1] [2019-01-18 18:04:46,991 INFO L423 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:04:46,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:04:46,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1204895148, now seen corresponding path program 109 times [2019-01-18 18:04:46,992 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:04:46,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:04:46,992 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:04:46,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:04:46,993 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:04:47,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:04:51,219 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:04:51,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:04:51,220 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:04:51,220 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:04:51,220 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:04:51,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:04:51,220 INFO 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-01-18 18:04:51,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:04:51,229 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:04:51,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:04:51,299 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:04:51,319 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:04:51,320 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:05:04,730 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:05:04,748 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:05:04,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111, 111, 111] total 221 [2019-01-18 18:05:04,748 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:05:04,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-01-18 18:05:04,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-01-18 18:05:04,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24531, Invalid=24531, Unknown=0, NotChecked=0, Total=49062 [2019-01-18 18:05:04,752 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 112 states. [2019-01-18 18:05:04,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:05:04,986 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2019-01-18 18:05:04,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2019-01-18 18:05:04,986 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 112 [2019-01-18 18:05:04,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:05:04,986 INFO L225 Difference]: With dead ends: 116 [2019-01-18 18:05:04,987 INFO L226 Difference]: Without dead ends: 114 [2019-01-18 18:05:04,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.4s TimeCoverageRelationStatistics Valid=24531, Invalid=24531, Unknown=0, NotChecked=0, Total=49062 [2019-01-18 18:05:04,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-01-18 18:05:04,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-01-18 18:05:04,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-01-18 18:05:04,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2019-01-18 18:05:04,992 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 112 [2019-01-18 18:05:04,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:05:04,992 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2019-01-18 18:05:04,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-01-18 18:05:04,992 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2019-01-18 18:05:04,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-01-18 18:05:04,993 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:05:04,993 INFO L402 BasicCegarLoop]: trace histogram [110, 1, 1, 1] [2019-01-18 18:05:04,993 INFO L423 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:05:04,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:05:04,994 INFO L82 PathProgramCache]: Analyzing trace with hash -1302954269, now seen corresponding path program 110 times [2019-01-18 18:05:04,994 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:05:04,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:05:04,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:05:04,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:05:04,995 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:05:05,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:05:09,713 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:05:09,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:05:09,713 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:05:09,714 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:05:09,714 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:05:09,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:05:09,714 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-18 18:05:09,722 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 18:05:09,723 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 18:05:12,299 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 56 check-sat command(s) [2019-01-18 18:05:12,300 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:05:12,307 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:05:12,325 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:05:12,326 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:05:25,710 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:05:25,733 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:05:25,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112, 112, 112] total 223 [2019-01-18 18:05:25,734 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:05:25,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-01-18 18:05:25,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-01-18 18:05:25,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24976, Invalid=24976, Unknown=0, NotChecked=0, Total=49952 [2019-01-18 18:05:25,738 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand 113 states. [2019-01-18 18:05:26,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:05:26,111 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2019-01-18 18:05:26,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2019-01-18 18:05:26,111 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 113 [2019-01-18 18:05:26,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:05:26,112 INFO L225 Difference]: With dead ends: 117 [2019-01-18 18:05:26,112 INFO L226 Difference]: Without dead ends: 115 [2019-01-18 18:05:26,115 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.9s TimeCoverageRelationStatistics Valid=24976, Invalid=24976, Unknown=0, NotChecked=0, Total=49952 [2019-01-18 18:05:26,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-01-18 18:05:26,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2019-01-18 18:05:26,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-01-18 18:05:26,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2019-01-18 18:05:26,117 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 113 [2019-01-18 18:05:26,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:05:26,118 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2019-01-18 18:05:26,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-01-18 18:05:26,118 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2019-01-18 18:05:26,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-01-18 18:05:26,118 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:05:26,119 INFO L402 BasicCegarLoop]: trace histogram [111, 1, 1, 1] [2019-01-18 18:05:26,119 INFO L423 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:05:26,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:05:26,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1736874868, now seen corresponding path program 111 times [2019-01-18 18:05:26,119 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:05:26,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:05:26,120 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:05:26,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:05:26,120 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:05:26,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:05:30,715 INFO L134 CoverageAnalysis]: Checked inductivity of 6216 backedges. 0 proven. 6216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:05:30,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:05:30,715 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:05:30,715 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:05:30,715 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:05:30,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:05:30,715 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:05:30,723 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 18:05:30,724 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 18:05:30,793 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 18:05:30,793 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:05:30,796 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:05:30,816 INFO L134 CoverageAnalysis]: Checked inductivity of 6216 backedges. 0 proven. 6216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:05:30,817 INFO L316 TraceCheckSpWp]: Computing backward predicates...