java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/array1.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b7bd044-m [2019-01-20 09:57:21,519 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-20 09:57:21,521 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-20 09:57:21,537 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-20 09:57:21,537 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-20 09:57:21,539 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-20 09:57:21,543 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-20 09:57:21,546 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-20 09:57:21,549 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-20 09:57:21,551 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-20 09:57:21,555 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-20 09:57:21,555 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-20 09:57:21,556 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-20 09:57:21,557 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-20 09:57:21,566 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-20 09:57:21,567 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-20 09:57:21,571 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-20 09:57:21,573 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-20 09:57:21,579 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-20 09:57:21,581 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-20 09:57:21,583 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-20 09:57:21,584 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-20 09:57:21,588 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-20 09:57:21,588 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-20 09:57:21,588 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-20 09:57:21,590 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-20 09:57:21,592 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-20 09:57:21,593 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-20 09:57:21,595 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-20 09:57:21,596 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-20 09:57:21,596 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-20 09:57:21,598 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-20 09:57:21,599 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-20 09:57:21,600 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-20 09:57:21,601 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-20 09:57:21,602 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-20 09:57:21,602 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-01-20 09:57:21,623 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-20 09:57:21,623 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-20 09:57:21,624 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-20 09:57:21,625 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-20 09:57:21,625 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-20 09:57:21,625 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-20 09:57:21,625 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-20 09:57:21,626 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-20 09:57:21,626 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-20 09:57:21,626 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-20 09:57:21,626 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-20 09:57:21,626 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-20 09:57:21,627 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-20 09:57:21,627 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-20 09:57:21,628 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-20 09:57:21,628 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-20 09:57:21,628 INFO L133 SettingsManager]: * Use SBE=true [2019-01-20 09:57:21,629 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-20 09:57:21,630 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-20 09:57:21,631 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-20 09:57:21,631 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-20 09:57:21,631 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-20 09:57:21,631 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-20 09:57:21,631 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-20 09:57:21,632 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-20 09:57:21,632 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-20 09:57:21,632 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-20 09:57:21,632 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-20 09:57:21,633 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-20 09:57:21,633 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-20 09:57:21,633 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-20 09:57:21,633 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-20 09:57:21,634 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-20 09:57:21,634 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-20 09:57:21,634 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-20 09:57:21,634 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-20 09:57:21,634 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-20 09:57:21,634 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-20 09:57:21,635 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-20 09:57:21,635 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-20 09:57:21,688 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-20 09:57:21,703 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-20 09:57:21,708 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-20 09:57:21,709 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-20 09:57:21,710 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-20 09:57:21,711 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-20 09:57:21,711 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array1.i_3.bpl' [2019-01-20 09:57:21,753 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-20 09:57:21,755 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-20 09:57:21,755 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-20 09:57:21,756 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-20 09:57:21,756 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-20 09:57:21,772 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 20.01 09:57:21" (1/1) ... [2019-01-20 09:57:21,784 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 20.01 09:57:21" (1/1) ... [2019-01-20 09:57:21,792 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-20 09:57:21,793 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-20 09:57:21,793 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-20 09:57:21,794 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-20 09:57:21,805 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 09:57:21" (1/1) ... [2019-01-20 09:57:21,806 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 09:57:21" (1/1) ... [2019-01-20 09:57:21,806 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 09:57:21" (1/1) ... [2019-01-20 09:57:21,807 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 09:57:21" (1/1) ... [2019-01-20 09:57:21,810 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 09:57:21" (1/1) ... [2019-01-20 09:57:21,812 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 09:57:21" (1/1) ... [2019-01-20 09:57:21,813 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 09:57:21" (1/1) ... [2019-01-20 09:57:21,814 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-20 09:57:21,815 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-20 09:57:21,815 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-20 09:57:21,815 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-20 09:57:21,816 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 09:57:21" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-20 09:57:21,894 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-20 09:57:21,894 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-20 09:57:22,070 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-20 09:57:22,070 INFO L286 CfgBuilder]: Removed 1 assue(true) statements. [2019-01-20 09:57:22,072 INFO L202 PluginConnector]: Adding new model array1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 09:57:22 BoogieIcfgContainer [2019-01-20 09:57:22,072 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-20 09:57:22,073 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-20 09:57:22,073 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-20 09:57:22,076 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-20 09:57:22,077 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 09:57:21" (1/2) ... [2019-01-20 09:57:22,078 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 20.01 09:57:22, skipping insertion in model container [2019-01-20 09:57:22,078 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 09:57:22" (2/2) ... [2019-01-20 09:57:22,080 INFO L112 eAbstractionObserver]: Analyzing ICFG array1.i_3.bpl [2019-01-20 09:57:22,090 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-20 09:57:22,098 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-20 09:57:22,115 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-20 09:57:22,148 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-20 09:57:22,149 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-20 09:57:22,149 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-20 09:57:22,149 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-20 09:57:22,149 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-20 09:57:22,149 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-20 09:57:22,150 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-20 09:57:22,150 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-20 09:57:22,165 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-01-20 09:57:22,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-20 09:57:22,171 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:22,172 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-20 09:57:22,175 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:22,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:22,182 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2019-01-20 09:57:22,185 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:22,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:22,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:22,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:22,238 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:22,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:22,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:22,325 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-20 09:57:22,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-20 09:57:22,326 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 09:57:22,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-20 09:57:22,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-20 09:57:22,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-20 09:57:22,343 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2019-01-20 09:57:22,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:22,414 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2019-01-20 09:57:22,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-20 09:57:22,418 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-20 09:57:22,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:22,432 INFO L225 Difference]: With dead ends: 9 [2019-01-20 09:57:22,433 INFO L226 Difference]: Without dead ends: 5 [2019-01-20 09:57:22,436 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-20 09:57:22,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-01-20 09:57:22,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-01-20 09:57:22,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-20 09:57:22,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-01-20 09:57:22,471 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-01-20 09:57:22,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:22,472 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-01-20 09:57:22,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-20 09:57:22,472 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-01-20 09:57:22,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 09:57:22,472 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:22,473 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 09:57:22,473 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:22,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:22,473 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2019-01-20 09:57:22,474 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:22,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:22,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:22,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:22,475 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:22,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:22,589 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-20 09:57:22,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:22,590 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:22,591 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 09:57:22,593 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [9] [2019-01-20 09:57:22,643 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 09:57:22,644 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 09:57:22,755 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 09:57:22,757 INFO L272 AbstractInterpreter]: Visited 4 different actions 10 times. Merged at 1 different actions 3 times. Never widened. Performed 76 root evaluator evaluations with a maximum evaluation depth of 5. Performed 76 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 09:57:22,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:22,763 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 09:57:22,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:22,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 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:22,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:22,775 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:57:22,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:22,822 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:22,842 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-20 09:57:22,843 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:22,967 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-20 09:57:23,012 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:23,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2019-01-20 09:57:23,013 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:23,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-20 09:57:23,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-20 09:57:23,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-20 09:57:23,014 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-01-20 09:57:23,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:23,031 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-01-20 09:57:23,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-20 09:57:23,032 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-20 09:57:23,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:23,032 INFO L225 Difference]: With dead ends: 8 [2019-01-20 09:57:23,033 INFO L226 Difference]: Without dead ends: 6 [2019-01-20 09:57:23,034 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-20 09:57:23,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-01-20 09:57:23,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-01-20 09:57:23,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-20 09:57:23,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-01-20 09:57:23,036 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-01-20 09:57:23,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:23,037 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-01-20 09:57:23,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-20 09:57:23,037 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-01-20 09:57:23,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 09:57:23,037 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:23,038 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-01-20 09:57:23,038 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:23,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:23,038 INFO L82 PathProgramCache]: Analyzing trace with hash 28844579, now seen corresponding path program 2 times [2019-01-20 09:57:23,039 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:23,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:23,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:23,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:23,040 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:23,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:23,119 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-20 09:57:23,120 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:23,120 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:23,120 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:23,120 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:23,120 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:23,120 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:23,131 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:57:23,131 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:57:23,141 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-20 09:57:23,142 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:57:23,144 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:23,149 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-20 09:57:23,149 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:23,239 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-20 09:57:23,257 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:23,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2019-01-20 09:57:23,258 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:23,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-20 09:57:23,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-20 09:57:23,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-20 09:57:23,259 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-01-20 09:57:23,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:23,334 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-01-20 09:57:23,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-20 09:57:23,335 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-01-20 09:57:23,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:23,335 INFO L225 Difference]: With dead ends: 9 [2019-01-20 09:57:23,336 INFO L226 Difference]: Without dead ends: 7 [2019-01-20 09:57:23,336 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-20 09:57:23,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-01-20 09:57:23,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-01-20 09:57:23,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-20 09:57:23,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-01-20 09:57:23,339 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-01-20 09:57:23,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:23,340 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-01-20 09:57:23,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-20 09:57:23,340 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-01-20 09:57:23,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 09:57:23,341 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:23,341 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-01-20 09:57:23,342 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:23,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:23,342 INFO L82 PathProgramCache]: Analyzing trace with hash 894183756, now seen corresponding path program 3 times [2019-01-20 09:57:23,342 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:23,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:23,343 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:57:23,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:23,344 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:23,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:23,619 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-20 09:57:23,619 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:23,619 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:23,620 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:23,620 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:23,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:23,620 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:23,629 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 09:57:23,629 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 09:57:23,648 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 09:57:23,649 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:57:23,650 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:23,655 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-20 09:57:23,656 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:23,798 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-20 09:57:23,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:23,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2019-01-20 09:57:23,824 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:23,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-20 09:57:23,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-20 09:57:23,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-20 09:57:23,826 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-01-20 09:57:23,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:23,841 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-01-20 09:57:23,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 09:57:23,842 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-01-20 09:57:23,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:23,843 INFO L225 Difference]: With dead ends: 10 [2019-01-20 09:57:23,843 INFO L226 Difference]: Without dead ends: 8 [2019-01-20 09:57:23,844 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-20 09:57:23,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-01-20 09:57:23,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-01-20 09:57:23,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-20 09:57:23,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-01-20 09:57:23,847 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-01-20 09:57:23,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:23,847 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-01-20 09:57:23,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-20 09:57:23,848 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-01-20 09:57:23,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 09:57:23,848 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:23,849 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-01-20 09:57:23,849 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:23,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:23,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1949894467, now seen corresponding path program 4 times [2019-01-20 09:57:23,849 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:23,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:23,850 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:57:23,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:23,850 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:23,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:24,026 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-20 09:57:24,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:24,026 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:24,026 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:24,027 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:24,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:24,027 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:24,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:24,036 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:57:24,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:24,050 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:24,056 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-20 09:57:24,056 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:24,183 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-20 09:57:24,203 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:24,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2019-01-20 09:57:24,203 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:24,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-20 09:57:24,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-20 09:57:24,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-20 09:57:24,205 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-01-20 09:57:24,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:24,233 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-01-20 09:57:24,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 09:57:24,235 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-01-20 09:57:24,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:24,235 INFO L225 Difference]: With dead ends: 11 [2019-01-20 09:57:24,235 INFO L226 Difference]: Without dead ends: 9 [2019-01-20 09:57:24,236 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-20 09:57:24,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-01-20 09:57:24,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-01-20 09:57:24,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-20 09:57:24,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-01-20 09:57:24,239 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-01-20 09:57:24,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:24,239 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-01-20 09:57:24,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-20 09:57:24,239 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-01-20 09:57:24,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-20 09:57:24,240 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:24,240 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-01-20 09:57:24,240 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:24,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:24,240 INFO L82 PathProgramCache]: Analyzing trace with hash 317188140, now seen corresponding path program 5 times [2019-01-20 09:57:24,241 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:24,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:24,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:24,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:24,242 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:24,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:24,358 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-20 09:57:24,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:24,358 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:24,358 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:24,358 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:24,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:24,359 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:24,367 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:57:24,368 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:57:24,380 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-20 09:57:24,380 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:57:24,381 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:24,391 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-20 09:57:24,391 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:24,828 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-20 09:57:24,847 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:24,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2019-01-20 09:57:24,848 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:24,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 09:57:24,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 09:57:24,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-01-20 09:57:24,849 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2019-01-20 09:57:24,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:24,879 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-01-20 09:57:24,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 09:57:24,880 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-01-20 09:57:24,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:24,881 INFO L225 Difference]: With dead ends: 12 [2019-01-20 09:57:24,881 INFO L226 Difference]: Without dead ends: 10 [2019-01-20 09:57:24,882 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-01-20 09:57:24,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-01-20 09:57:24,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-01-20 09:57:24,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-20 09:57:24,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-01-20 09:57:24,885 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-01-20 09:57:24,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:24,885 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-01-20 09:57:24,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 09:57:24,886 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-01-20 09:57:24,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-20 09:57:24,886 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:24,886 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-01-20 09:57:24,886 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:24,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:24,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1242899555, now seen corresponding path program 6 times [2019-01-20 09:57:24,887 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:24,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:24,888 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:57:24,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:24,888 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:24,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:25,024 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-20 09:57:25,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:25,025 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:25,025 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:25,025 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:25,025 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:25,026 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:25,035 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 09:57:25,035 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 09:57:25,043 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 09:57:25,044 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:57:25,045 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:25,051 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-20 09:57:25,051 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:25,191 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-20 09:57:25,210 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:25,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2019-01-20 09:57:25,210 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:25,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-20 09:57:25,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-20 09:57:25,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-01-20 09:57:25,211 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2019-01-20 09:57:25,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:25,240 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-01-20 09:57:25,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 09:57:25,242 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-01-20 09:57:25,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:25,242 INFO L225 Difference]: With dead ends: 13 [2019-01-20 09:57:25,242 INFO L226 Difference]: Without dead ends: 11 [2019-01-20 09:57:25,243 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-01-20 09:57:25,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-01-20 09:57:25,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-01-20 09:57:25,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-20 09:57:25,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-01-20 09:57:25,245 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-01-20 09:57:25,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:25,246 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-01-20 09:57:25,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-20 09:57:25,246 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-01-20 09:57:25,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-20 09:57:25,246 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:25,246 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-01-20 09:57:25,247 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:25,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:25,247 INFO L82 PathProgramCache]: Analyzing trace with hash -124817652, now seen corresponding path program 7 times [2019-01-20 09:57:25,247 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:25,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:25,248 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:57:25,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:25,249 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:25,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:25,412 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-20 09:57:25,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:25,412 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:25,413 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:25,413 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:25,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:25,413 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:25,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:25,421 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:57:25,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:25,434 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:25,439 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-20 09:57:25,440 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:25,687 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-20 09:57:25,705 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:25,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2019-01-20 09:57:25,706 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:25,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 09:57:25,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 09:57:25,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-01-20 09:57:25,707 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2019-01-20 09:57:25,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:25,765 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-01-20 09:57:25,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-20 09:57:25,766 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-01-20 09:57:25,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:25,767 INFO L225 Difference]: With dead ends: 14 [2019-01-20 09:57:25,767 INFO L226 Difference]: Without dead ends: 12 [2019-01-20 09:57:25,767 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-20 09:57:25,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-01-20 09:57:25,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-01-20 09:57:25,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-20 09:57:25,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-01-20 09:57:25,770 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-01-20 09:57:25,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:25,771 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-01-20 09:57:25,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 09:57:25,771 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-01-20 09:57:25,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-20 09:57:25,771 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:25,771 INFO L402 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-01-20 09:57:25,772 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:25,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:25,772 INFO L82 PathProgramCache]: Analyzing trace with hash 425621891, now seen corresponding path program 8 times [2019-01-20 09:57:25,772 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:25,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:25,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:25,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:25,774 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:25,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:26,009 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-20 09:57:26,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:26,010 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:26,010 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:26,010 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:26,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:26,010 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:26,022 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:57:26,022 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:57:26,035 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-01-20 09:57:26,035 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:57:26,037 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:26,043 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-20 09:57:26,043 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:26,236 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-20 09:57:26,256 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:26,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2019-01-20 09:57:26,256 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:26,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-20 09:57:26,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-20 09:57:26,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-01-20 09:57:26,258 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2019-01-20 09:57:26,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:26,293 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-01-20 09:57:26,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-20 09:57:26,293 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-01-20 09:57:26,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:26,294 INFO L225 Difference]: With dead ends: 15 [2019-01-20 09:57:26,294 INFO L226 Difference]: Without dead ends: 13 [2019-01-20 09:57:26,295 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-01-20 09:57:26,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-01-20 09:57:26,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-01-20 09:57:26,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-20 09:57:26,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-01-20 09:57:26,298 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-01-20 09:57:26,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:26,298 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-01-20 09:57:26,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-20 09:57:26,299 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-01-20 09:57:26,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-20 09:57:26,299 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:26,299 INFO L402 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2019-01-20 09:57:26,299 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:26,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:26,300 INFO L82 PathProgramCache]: Analyzing trace with hash 309378540, now seen corresponding path program 9 times [2019-01-20 09:57:26,300 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:26,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:26,301 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:57:26,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:26,301 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:26,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:26,439 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-20 09:57:26,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:26,439 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:26,439 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:26,440 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:26,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:26,440 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:26,449 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 09:57:26,450 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 09:57:26,537 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 09:57:26,538 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:57:26,539 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:26,546 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-20 09:57:26,546 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:26,769 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-20 09:57:26,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:26,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2019-01-20 09:57:26,798 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:26,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-20 09:57:26,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-20 09:57:26,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-01-20 09:57:26,799 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2019-01-20 09:57:26,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:26,841 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-01-20 09:57:26,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-20 09:57:26,842 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-01-20 09:57:26,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:26,843 INFO L225 Difference]: With dead ends: 16 [2019-01-20 09:57:26,843 INFO L226 Difference]: Without dead ends: 14 [2019-01-20 09:57:26,844 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-01-20 09:57:26,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-01-20 09:57:26,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-01-20 09:57:26,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-20 09:57:26,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-01-20 09:57:26,848 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-01-20 09:57:26,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:26,848 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-01-20 09:57:26,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-20 09:57:26,848 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-01-20 09:57:26,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-20 09:57:26,849 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:26,849 INFO L402 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2019-01-20 09:57:26,849 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:26,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:26,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1000801955, now seen corresponding path program 10 times [2019-01-20 09:57:26,850 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:26,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:26,851 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:57:26,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:26,851 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:26,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:27,004 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-20 09:57:27,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:27,005 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:27,005 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:27,005 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:27,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:27,005 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:27,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:27,014 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:57:27,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:27,028 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:27,035 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-20 09:57:27,036 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:27,289 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-20 09:57:27,309 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:27,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2019-01-20 09:57:27,309 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:27,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-20 09:57:27,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-20 09:57:27,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-01-20 09:57:27,311 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2019-01-20 09:57:27,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:27,339 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-01-20 09:57:27,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-20 09:57:27,340 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-01-20 09:57:27,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:27,341 INFO L225 Difference]: With dead ends: 17 [2019-01-20 09:57:27,341 INFO L226 Difference]: Without dead ends: 15 [2019-01-20 09:57:27,342 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-20 09:57:27,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-01-20 09:57:27,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-01-20 09:57:27,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-20 09:57:27,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-01-20 09:57:27,345 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-01-20 09:57:27,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:27,346 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-01-20 09:57:27,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-20 09:57:27,346 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-01-20 09:57:27,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-20 09:57:27,346 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:27,347 INFO L402 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2019-01-20 09:57:27,347 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:27,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:27,347 INFO L82 PathProgramCache]: Analyzing trace with hash 960091340, now seen corresponding path program 11 times [2019-01-20 09:57:27,347 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:27,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:27,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:27,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:27,348 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:27,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:27,645 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-20 09:57:27,645 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:27,646 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:27,646 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:27,646 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:27,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:27,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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:27,664 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:57:27,664 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:57:27,721 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-01-20 09:57:27,721 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:57:27,723 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:27,729 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-20 09:57:27,730 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:28,140 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-20 09:57:28,163 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:28,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2019-01-20 09:57:28,164 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:28,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-20 09:57:28,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-20 09:57:28,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-01-20 09:57:28,165 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2019-01-20 09:57:28,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:28,190 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-01-20 09:57:28,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-20 09:57:28,190 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-01-20 09:57:28,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:28,191 INFO L225 Difference]: With dead ends: 18 [2019-01-20 09:57:28,191 INFO L226 Difference]: Without dead ends: 16 [2019-01-20 09:57:28,192 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-01-20 09:57:28,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-01-20 09:57:28,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-01-20 09:57:28,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-20 09:57:28,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-01-20 09:57:28,196 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-01-20 09:57:28,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:28,196 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-01-20 09:57:28,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-20 09:57:28,196 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-01-20 09:57:28,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-20 09:57:28,197 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:28,197 INFO L402 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2019-01-20 09:57:28,197 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:28,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:28,198 INFO L82 PathProgramCache]: Analyzing trace with hash -301937725, now seen corresponding path program 12 times [2019-01-20 09:57:28,198 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:28,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:28,199 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:57:28,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:28,199 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:28,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:28,354 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-20 09:57:28,355 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:28,355 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:28,355 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:28,356 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:28,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:28,356 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:28,365 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 09:57:28,365 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 09:57:28,381 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 09:57:28,381 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:57:28,383 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:28,388 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-20 09:57:28,389 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:28,711 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-20 09:57:28,730 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:28,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2019-01-20 09:57:28,730 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:28,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-20 09:57:28,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-20 09:57:28,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-01-20 09:57:28,732 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2019-01-20 09:57:28,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:28,820 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-01-20 09:57:28,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-20 09:57:28,826 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-01-20 09:57:28,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:28,827 INFO L225 Difference]: With dead ends: 19 [2019-01-20 09:57:28,827 INFO L226 Difference]: Without dead ends: 17 [2019-01-20 09:57:28,828 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-01-20 09:57:28,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-20 09:57:28,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-01-20 09:57:28,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-20 09:57:28,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-01-20 09:57:28,831 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-01-20 09:57:28,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:28,833 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-01-20 09:57:28,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-20 09:57:28,833 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-01-20 09:57:28,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-20 09:57:28,834 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:28,834 INFO L402 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2019-01-20 09:57:28,834 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:28,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:28,835 INFO L82 PathProgramCache]: Analyzing trace with hash -770133076, now seen corresponding path program 13 times [2019-01-20 09:57:28,835 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:28,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:28,836 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:57:28,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:28,836 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:28,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:29,216 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-20 09:57:29,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:29,216 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:29,217 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:29,217 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:29,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:29,217 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:29,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:29,227 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:57:29,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:29,241 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:29,248 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-20 09:57:29,248 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:29,653 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-20 09:57:29,673 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:29,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2019-01-20 09:57:29,673 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:29,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-20 09:57:29,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-20 09:57:29,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-01-20 09:57:29,674 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2019-01-20 09:57:29,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:29,702 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-01-20 09:57:29,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-20 09:57:29,706 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-01-20 09:57:29,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:29,707 INFO L225 Difference]: With dead ends: 20 [2019-01-20 09:57:29,707 INFO L226 Difference]: Without dead ends: 18 [2019-01-20 09:57:29,707 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-01-20 09:57:29,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-01-20 09:57:29,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-01-20 09:57:29,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-20 09:57:29,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-01-20 09:57:29,710 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-01-20 09:57:29,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:29,711 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-01-20 09:57:29,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-20 09:57:29,711 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-01-20 09:57:29,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-20 09:57:29,711 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:29,711 INFO L402 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2019-01-20 09:57:29,711 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:29,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:29,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1895680227, now seen corresponding path program 14 times [2019-01-20 09:57:29,712 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:29,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:29,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:29,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:29,713 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:29,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:30,141 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-20 09:57:30,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:30,142 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:30,142 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:30,142 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:30,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:30,143 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:30,152 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:57:30,152 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:57:30,168 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-01-20 09:57:30,168 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:57:30,170 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:30,177 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-20 09:57:30,177 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:30,541 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-20 09:57:30,560 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:30,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2019-01-20 09:57:30,561 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:30,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-20 09:57:30,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-20 09:57:30,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-01-20 09:57:30,562 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2019-01-20 09:57:30,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:30,594 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-01-20 09:57:30,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-20 09:57:30,595 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-01-20 09:57:30,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:30,596 INFO L225 Difference]: With dead ends: 21 [2019-01-20 09:57:30,596 INFO L226 Difference]: Without dead ends: 19 [2019-01-20 09:57:30,597 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-20 09:57:30,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-01-20 09:57:30,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-01-20 09:57:30,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-20 09:57:30,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-01-20 09:57:30,600 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-01-20 09:57:30,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:30,601 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-01-20 09:57:30,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-20 09:57:30,601 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-01-20 09:57:30,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-20 09:57:30,601 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:30,602 INFO L402 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2019-01-20 09:57:30,602 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:30,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:30,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1363453300, now seen corresponding path program 15 times [2019-01-20 09:57:30,602 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:30,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:30,603 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:57:30,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:30,604 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:30,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:30,889 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-20 09:57:30,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:30,889 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:30,890 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:30,890 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:30,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:30,890 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:30,899 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 09:57:30,899 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 09:57:30,912 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 09:57:30,912 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:57:30,914 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:30,923 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-20 09:57:30,923 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:31,371 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-20 09:57:31,392 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:31,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2019-01-20 09:57:31,392 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:31,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-20 09:57:31,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-20 09:57:31,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-01-20 09:57:31,393 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2019-01-20 09:57:31,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:31,535 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-01-20 09:57:31,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-20 09:57:31,535 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-01-20 09:57:31,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:31,536 INFO L225 Difference]: With dead ends: 22 [2019-01-20 09:57:31,536 INFO L226 Difference]: Without dead ends: 20 [2019-01-20 09:57:31,536 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-01-20 09:57:31,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-01-20 09:57:31,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-01-20 09:57:31,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-20 09:57:31,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-01-20 09:57:31,539 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-01-20 09:57:31,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:31,540 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-01-20 09:57:31,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-20 09:57:31,540 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-01-20 09:57:31,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-20 09:57:31,541 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:31,541 INFO L402 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2019-01-20 09:57:31,541 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:31,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:31,541 INFO L82 PathProgramCache]: Analyzing trace with hash 682622467, now seen corresponding path program 16 times [2019-01-20 09:57:31,541 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:31,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:31,542 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:57:31,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:31,542 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:31,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:32,194 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-20 09:57:32,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:32,195 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:32,195 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:32,195 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:32,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:32,195 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:32,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:32,213 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:57:32,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:32,231 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:32,239 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-20 09:57:32,239 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:33,131 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-20 09:57:33,150 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:33,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2019-01-20 09:57:33,150 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:33,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-01-20 09:57:33,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-01-20 09:57:33,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-01-20 09:57:33,152 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2019-01-20 09:57:33,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:33,177 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-01-20 09:57:33,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-20 09:57:33,178 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-01-20 09:57:33,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:33,178 INFO L225 Difference]: With dead ends: 23 [2019-01-20 09:57:33,179 INFO L226 Difference]: Without dead ends: 21 [2019-01-20 09:57:33,179 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-01-20 09:57:33,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-01-20 09:57:33,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-01-20 09:57:33,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-20 09:57:33,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-01-20 09:57:33,182 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-01-20 09:57:33,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:33,182 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-01-20 09:57:33,182 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-01-20 09:57:33,182 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-01-20 09:57:33,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-20 09:57:33,183 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:33,183 INFO L402 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2019-01-20 09:57:33,183 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:33,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:33,183 INFO L82 PathProgramCache]: Analyzing trace with hash -313538196, now seen corresponding path program 17 times [2019-01-20 09:57:33,183 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:33,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:33,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:33,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:33,184 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:33,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:33,397 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-20 09:57:33,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:33,397 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:33,397 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:33,397 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:33,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:33,397 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:33,406 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:57:33,406 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:57:33,429 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-01-20 09:57:33,429 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:57:33,431 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:33,438 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-20 09:57:33,438 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:34,455 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-20 09:57:34,477 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:34,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2019-01-20 09:57:34,478 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:34,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-20 09:57:34,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-20 09:57:34,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-01-20 09:57:34,480 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2019-01-20 09:57:34,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:34,510 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-01-20 09:57:34,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-20 09:57:34,511 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-01-20 09:57:34,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:34,512 INFO L225 Difference]: With dead ends: 24 [2019-01-20 09:57:34,512 INFO L226 Difference]: Without dead ends: 22 [2019-01-20 09:57:34,513 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-20 09:57:34,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-01-20 09:57:34,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-01-20 09:57:34,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-20 09:57:34,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-01-20 09:57:34,517 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-01-20 09:57:34,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:34,518 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-01-20 09:57:34,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-20 09:57:34,518 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-01-20 09:57:34,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-20 09:57:34,519 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:34,519 INFO L402 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2019-01-20 09:57:34,519 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:34,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:34,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1129747677, now seen corresponding path program 18 times [2019-01-20 09:57:34,519 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:34,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:34,520 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:57:34,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:34,520 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:34,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:35,419 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-20 09:57:35,419 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:35,419 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:35,420 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:35,420 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:35,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:35,420 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:35,428 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 09:57:35,428 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 09:57:35,441 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 09:57:35,441 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:57:35,443 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:35,451 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-20 09:57:35,451 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:36,008 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-20 09:57:36,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:36,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2019-01-20 09:57:36,029 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:36,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-01-20 09:57:36,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-20 09:57:36,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-01-20 09:57:36,030 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2019-01-20 09:57:36,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:36,074 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-01-20 09:57:36,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-20 09:57:36,074 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-01-20 09:57:36,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:36,075 INFO L225 Difference]: With dead ends: 25 [2019-01-20 09:57:36,075 INFO L226 Difference]: Without dead ends: 23 [2019-01-20 09:57:36,077 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-01-20 09:57:36,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-01-20 09:57:36,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-01-20 09:57:36,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-20 09:57:36,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-01-20 09:57:36,080 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-01-20 09:57:36,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:36,081 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-01-20 09:57:36,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-01-20 09:57:36,081 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-01-20 09:57:36,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-20 09:57:36,081 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:36,081 INFO L402 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2019-01-20 09:57:36,082 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:36,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:36,082 INFO L82 PathProgramCache]: Analyzing trace with hash -662437812, now seen corresponding path program 19 times [2019-01-20 09:57:36,082 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:36,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:36,083 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:57:36,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:36,083 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:36,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:36,317 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-20 09:57:36,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:36,317 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:36,317 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:36,318 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:36,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:36,318 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:36,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:36,328 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:57:36,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:36,344 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:36,350 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-20 09:57:36,351 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:36,904 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-20 09:57:36,925 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:36,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2019-01-20 09:57:36,925 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:36,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-20 09:57:36,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-20 09:57:36,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-01-20 09:57:36,926 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2019-01-20 09:57:37,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:37,004 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-01-20 09:57:37,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-20 09:57:37,006 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-01-20 09:57:37,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:37,007 INFO L225 Difference]: With dead ends: 26 [2019-01-20 09:57:37,007 INFO L226 Difference]: Without dead ends: 24 [2019-01-20 09:57:37,007 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-01-20 09:57:37,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-01-20 09:57:37,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-01-20 09:57:37,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-20 09:57:37,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-01-20 09:57:37,010 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-01-20 09:57:37,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:37,010 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-01-20 09:57:37,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-20 09:57:37,011 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-01-20 09:57:37,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-20 09:57:37,011 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:37,011 INFO L402 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2019-01-20 09:57:37,012 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:37,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:37,012 INFO L82 PathProgramCache]: Analyzing trace with hash 939266115, now seen corresponding path program 20 times [2019-01-20 09:57:37,012 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:37,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:37,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:37,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:37,013 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:37,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:37,320 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-20 09:57:37,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:37,320 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:37,321 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:37,321 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:37,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:37,321 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:37,330 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:57:37,330 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:57:37,358 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-01-20 09:57:37,358 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:57:37,360 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:37,366 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-20 09:57:37,367 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:37,946 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-20 09:57:37,964 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:37,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2019-01-20 09:57:37,965 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:37,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-20 09:57:37,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-20 09:57:37,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-01-20 09:57:37,966 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2019-01-20 09:57:38,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:38,009 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-01-20 09:57:38,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-20 09:57:38,010 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-01-20 09:57:38,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:38,010 INFO L225 Difference]: With dead ends: 27 [2019-01-20 09:57:38,011 INFO L226 Difference]: Without dead ends: 25 [2019-01-20 09:57:38,012 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-20 09:57:38,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-01-20 09:57:38,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-01-20 09:57:38,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-20 09:57:38,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-01-20 09:57:38,015 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-01-20 09:57:38,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:38,016 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-01-20 09:57:38,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-20 09:57:38,016 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-01-20 09:57:38,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-20 09:57:38,016 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:38,017 INFO L402 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2019-01-20 09:57:38,017 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:38,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:38,017 INFO L82 PathProgramCache]: Analyzing trace with hash -947519700, now seen corresponding path program 21 times [2019-01-20 09:57:38,017 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:38,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:38,018 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:57:38,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:38,018 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:38,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:38,291 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-20 09:57:38,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:38,291 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:38,291 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:38,291 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:38,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:38,291 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:38,304 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 09:57:38,304 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 09:57:38,332 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 09:57:38,332 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:57:38,334 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:38,341 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-20 09:57:38,342 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:39,332 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-20 09:57:39,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:39,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2019-01-20 09:57:39,351 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:39,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-01-20 09:57:39,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-20 09:57:39,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-01-20 09:57:39,356 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2019-01-20 09:57:39,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:39,447 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-01-20 09:57:39,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-01-20 09:57:39,451 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-01-20 09:57:39,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:39,452 INFO L225 Difference]: With dead ends: 28 [2019-01-20 09:57:39,452 INFO L226 Difference]: Without dead ends: 26 [2019-01-20 09:57:39,453 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-01-20 09:57:39,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-01-20 09:57:39,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-01-20 09:57:39,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-20 09:57:39,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-01-20 09:57:39,458 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-01-20 09:57:39,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:39,458 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-01-20 09:57:39,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-01-20 09:57:39,458 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-01-20 09:57:39,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-20 09:57:39,459 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:39,459 INFO L402 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2019-01-20 09:57:39,459 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:39,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:39,459 INFO L82 PathProgramCache]: Analyzing trace with hash 691662179, now seen corresponding path program 22 times [2019-01-20 09:57:39,459 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:39,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:39,460 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:57:39,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:39,460 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:39,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:40,462 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-20 09:57:40,462 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:40,462 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:40,462 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:40,463 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:40,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:40,463 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:40,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:40,471 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:57:40,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:40,490 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:40,496 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-20 09:57:40,497 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:41,274 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-20 09:57:41,293 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:41,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2019-01-20 09:57:41,293 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:41,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-01-20 09:57:41,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-01-20 09:57:41,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-01-20 09:57:41,295 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2019-01-20 09:57:41,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:41,363 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-01-20 09:57:41,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-01-20 09:57:41,365 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2019-01-20 09:57:41,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:41,366 INFO L225 Difference]: With dead ends: 29 [2019-01-20 09:57:41,366 INFO L226 Difference]: Without dead ends: 27 [2019-01-20 09:57:41,367 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-01-20 09:57:41,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-01-20 09:57:41,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-01-20 09:57:41,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-20 09:57:41,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-01-20 09:57:41,370 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-01-20 09:57:41,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:41,370 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-01-20 09:57:41,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-01-20 09:57:41,370 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-01-20 09:57:41,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-20 09:57:41,371 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:41,371 INFO L402 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2019-01-20 09:57:41,371 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:41,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:41,372 INFO L82 PathProgramCache]: Analyzing trace with hash -33307124, now seen corresponding path program 23 times [2019-01-20 09:57:41,372 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:41,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:41,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:41,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:41,373 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:41,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:41,647 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-20 09:57:41,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:41,647 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:41,647 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:41,647 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:41,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:41,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 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:41,655 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:57:41,656 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:57:41,689 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-01-20 09:57:41,689 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:57:41,691 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:41,699 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-20 09:57:41,699 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:42,558 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-20 09:57:42,577 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:42,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2019-01-20 09:57:42,577 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:42,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-01-20 09:57:42,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-01-20 09:57:42,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-01-20 09:57:42,579 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2019-01-20 09:57:42,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:42,640 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-01-20 09:57:42,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-20 09:57:42,641 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-01-20 09:57:42,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:42,642 INFO L225 Difference]: With dead ends: 30 [2019-01-20 09:57:42,642 INFO L226 Difference]: Without dead ends: 28 [2019-01-20 09:57:42,643 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-01-20 09:57:42,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-01-20 09:57:42,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-01-20 09:57:42,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-20 09:57:42,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-01-20 09:57:42,647 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-01-20 09:57:42,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:42,647 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-01-20 09:57:42,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-01-20 09:57:42,647 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-01-20 09:57:42,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-20 09:57:42,648 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:42,648 INFO L402 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2019-01-20 09:57:42,648 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:42,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:42,649 INFO L82 PathProgramCache]: Analyzing trace with hash -1032519037, now seen corresponding path program 24 times [2019-01-20 09:57:42,649 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:42,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:42,650 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:57:42,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:42,650 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:42,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:43,077 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-20 09:57:43,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:43,078 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:43,078 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:43,078 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:43,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:43,078 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:43,086 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 09:57:43,087 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 09:57:43,104 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 09:57:43,104 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:57:43,107 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:43,114 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-20 09:57:43,114 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:43,890 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-20 09:57:43,911 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:43,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2019-01-20 09:57:43,911 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:43,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-01-20 09:57:43,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-01-20 09:57:43,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-01-20 09:57:43,913 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2019-01-20 09:57:43,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:43,978 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-01-20 09:57:43,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-01-20 09:57:43,978 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2019-01-20 09:57:43,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:43,978 INFO L225 Difference]: With dead ends: 31 [2019-01-20 09:57:43,978 INFO L226 Difference]: Without dead ends: 29 [2019-01-20 09:57:43,979 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-01-20 09:57:43,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-20 09:57:43,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-01-20 09:57:43,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-20 09:57:43,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-01-20 09:57:43,982 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-01-20 09:57:43,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:43,983 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-01-20 09:57:43,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-01-20 09:57:43,983 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-01-20 09:57:43,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-20 09:57:43,983 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:43,984 INFO L402 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2019-01-20 09:57:43,984 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:43,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:43,984 INFO L82 PathProgramCache]: Analyzing trace with hash -1943317268, now seen corresponding path program 25 times [2019-01-20 09:57:43,984 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:43,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:43,985 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:57:43,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:43,985 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:43,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:44,559 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-20 09:57:44,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:44,560 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:44,560 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:44,560 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:44,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:44,560 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:44,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:44,570 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:57:44,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:44,590 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:44,598 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-20 09:57:44,598 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:45,908 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-20 09:57:45,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:45,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2019-01-20 09:57:45,927 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:45,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-01-20 09:57:45,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-01-20 09:57:45,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-01-20 09:57:45,929 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2019-01-20 09:57:45,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:45,987 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-01-20 09:57:45,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-01-20 09:57:45,988 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2019-01-20 09:57:45,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:45,989 INFO L225 Difference]: With dead ends: 32 [2019-01-20 09:57:45,989 INFO L226 Difference]: Without dead ends: 30 [2019-01-20 09:57:45,990 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-01-20 09:57:45,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-01-20 09:57:45,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-01-20 09:57:45,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-20 09:57:45,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-01-20 09:57:45,993 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-01-20 09:57:45,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:45,993 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-01-20 09:57:45,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-01-20 09:57:45,993 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-01-20 09:57:45,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-20 09:57:45,993 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:45,994 INFO L402 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2019-01-20 09:57:45,994 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:45,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:45,994 INFO L82 PathProgramCache]: Analyzing trace with hash -113291357, now seen corresponding path program 26 times [2019-01-20 09:57:45,994 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:45,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:45,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:45,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:45,995 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:46,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:46,597 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-20 09:57:46,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:46,598 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:46,598 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:46,598 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:46,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:46,599 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:46,609 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:57:46,609 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:57:46,651 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-01-20 09:57:46,651 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:57:46,653 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:46,661 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-20 09:57:46,662 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:47,635 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-20 09:57:47,654 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:47,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2019-01-20 09:57:47,655 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:47,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-01-20 09:57:47,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-01-20 09:57:47,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-01-20 09:57:47,656 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2019-01-20 09:57:47,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:47,814 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-01-20 09:57:47,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-01-20 09:57:47,814 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2019-01-20 09:57:47,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:47,815 INFO L225 Difference]: With dead ends: 33 [2019-01-20 09:57:47,815 INFO L226 Difference]: Without dead ends: 31 [2019-01-20 09:57:47,817 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-20 09:57:47,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-01-20 09:57:47,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-01-20 09:57:47,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-20 09:57:47,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-01-20 09:57:47,820 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-01-20 09:57:47,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:47,820 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-01-20 09:57:47,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-01-20 09:57:47,820 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-01-20 09:57:47,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-20 09:57:47,821 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:47,821 INFO L402 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2019-01-20 09:57:47,821 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:47,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:47,821 INFO L82 PathProgramCache]: Analyzing trace with hash 782937036, now seen corresponding path program 27 times [2019-01-20 09:57:47,821 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:47,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:47,822 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:57:47,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:47,822 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:47,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:48,697 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-20 09:57:48,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:48,698 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:48,698 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:48,698 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:48,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:48,698 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:48,706 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 09:57:48,707 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 09:57:48,725 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 09:57:48,726 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:57:48,728 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:48,735 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-20 09:57:48,735 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:49,935 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-20 09:57:49,953 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:49,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2019-01-20 09:57:49,953 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:49,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-01-20 09:57:49,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-01-20 09:57:49,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-01-20 09:57:49,955 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2019-01-20 09:57:49,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:49,992 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-01-20 09:57:49,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-01-20 09:57:49,993 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2019-01-20 09:57:49,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:49,993 INFO L225 Difference]: With dead ends: 34 [2019-01-20 09:57:49,993 INFO L226 Difference]: Without dead ends: 32 [2019-01-20 09:57:49,995 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-01-20 09:57:49,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-01-20 09:57:49,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-01-20 09:57:49,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-20 09:57:49,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-01-20 09:57:49,999 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-01-20 09:57:49,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:49,999 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-01-20 09:57:49,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-01-20 09:57:49,999 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-01-20 09:57:49,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-20 09:57:49,999 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:50,000 INFO L402 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2019-01-20 09:57:50,000 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:50,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:50,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1498753853, now seen corresponding path program 28 times [2019-01-20 09:57:50,000 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:50,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:50,001 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:57:50,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:50,001 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:50,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:50,394 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-20 09:57:50,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:50,395 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:50,395 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:50,395 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:50,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:50,395 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:50,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:50,406 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:57:50,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:50,425 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:50,433 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-20 09:57:50,433 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:51,488 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-20 09:57:51,509 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:51,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 59 [2019-01-20 09:57:51,509 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:51,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-01-20 09:57:51,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-01-20 09:57:51,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-01-20 09:57:51,510 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2019-01-20 09:57:51,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:51,615 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-01-20 09:57:51,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-01-20 09:57:51,616 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2019-01-20 09:57:51,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:51,617 INFO L225 Difference]: With dead ends: 35 [2019-01-20 09:57:51,617 INFO L226 Difference]: Without dead ends: 33 [2019-01-20 09:57:51,617 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-01-20 09:57:51,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-01-20 09:57:51,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-01-20 09:57:51,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-20 09:57:51,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-01-20 09:57:51,624 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-01-20 09:57:51,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:51,625 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-01-20 09:57:51,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-01-20 09:57:51,625 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-01-20 09:57:51,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-20 09:57:51,625 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:51,625 INFO L402 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2019-01-20 09:57:51,626 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:51,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:51,626 INFO L82 PathProgramCache]: Analyzing trace with hash 783272620, now seen corresponding path program 29 times [2019-01-20 09:57:51,626 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:51,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:51,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:51,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:51,627 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:51,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:52,082 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-20 09:57:52,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:52,082 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:52,083 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:52,083 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:52,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:52,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 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:52,096 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:57:52,096 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:57:52,147 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-01-20 09:57:52,147 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:57:52,149 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:52,156 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-20 09:57:52,156 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:53,215 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-20 09:57:53,234 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:53,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2019-01-20 09:57:53,235 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:53,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-01-20 09:57:53,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-01-20 09:57:53,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-01-20 09:57:53,236 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2019-01-20 09:57:53,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:53,288 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-01-20 09:57:53,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-20 09:57:53,289 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2019-01-20 09:57:53,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:53,290 INFO L225 Difference]: With dead ends: 36 [2019-01-20 09:57:53,290 INFO L226 Difference]: Without dead ends: 34 [2019-01-20 09:57:53,291 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-20 09:57:53,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-01-20 09:57:53,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-01-20 09:57:53,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-01-20 09:57:53,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-01-20 09:57:53,293 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-01-20 09:57:53,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:53,294 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-01-20 09:57:53,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-01-20 09:57:53,294 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-01-20 09:57:53,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-20 09:57:53,294 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:53,295 INFO L402 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2019-01-20 09:57:53,295 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:53,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:53,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1488350749, now seen corresponding path program 30 times [2019-01-20 09:57:53,295 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:53,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:53,296 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:57:53,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:53,296 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:53,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:53,882 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-20 09:57:53,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:53,883 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:53,883 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:53,883 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:53,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:53,884 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:53,894 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 09:57:53,895 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 09:57:53,916 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 09:57:53,916 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:57:53,918 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:53,927 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-20 09:57:53,927 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:55,332 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-20 09:57:55,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:55,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2019-01-20 09:57:55,351 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:55,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-01-20 09:57:55,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-01-20 09:57:55,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-01-20 09:57:55,352 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2019-01-20 09:57:55,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:55,437 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-01-20 09:57:55,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-01-20 09:57:55,437 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2019-01-20 09:57:55,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:55,437 INFO L225 Difference]: With dead ends: 37 [2019-01-20 09:57:55,438 INFO L226 Difference]: Without dead ends: 35 [2019-01-20 09:57:55,438 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-01-20 09:57:55,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-20 09:57:55,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-01-20 09:57:55,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-20 09:57:55,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-01-20 09:57:55,440 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-01-20 09:57:55,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:55,441 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-01-20 09:57:55,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-01-20 09:57:55,441 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-01-20 09:57:55,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-20 09:57:55,441 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:55,442 INFO L402 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2019-01-20 09:57:55,442 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:55,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:55,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1105768844, now seen corresponding path program 31 times [2019-01-20 09:57:55,442 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:55,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:55,443 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:57:55,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:55,443 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:55,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:56,167 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-20 09:57:56,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:56,168 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:56,168 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:56,168 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:56,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:56,168 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:56,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:56,177 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:57:56,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:56,200 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:56,206 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-20 09:57:56,206 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:57,429 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-20 09:57:57,447 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:57,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2019-01-20 09:57:57,447 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:57,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-01-20 09:57:57,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-01-20 09:57:57,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-01-20 09:57:57,449 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2019-01-20 09:57:57,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:57,514 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-01-20 09:57:57,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-01-20 09:57:57,514 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2019-01-20 09:57:57,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:57,515 INFO L225 Difference]: With dead ends: 38 [2019-01-20 09:57:57,515 INFO L226 Difference]: Without dead ends: 36 [2019-01-20 09:57:57,516 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-01-20 09:57:57,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-20 09:57:57,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-01-20 09:57:57,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-20 09:57:57,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-01-20 09:57:57,519 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-01-20 09:57:57,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:57,520 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-01-20 09:57:57,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-01-20 09:57:57,520 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-01-20 09:57:57,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-20 09:57:57,520 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:57,521 INFO L402 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2019-01-20 09:57:57,521 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:57,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:57,521 INFO L82 PathProgramCache]: Analyzing trace with hash -80902397, now seen corresponding path program 32 times [2019-01-20 09:57:57,521 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:57,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:57,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:57,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:57,522 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:57,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:58,218 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-20 09:57:58,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:58,219 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:58,219 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:58,219 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:58,219 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:58,219 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:58,228 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:57:58,228 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:57:58,288 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-01-20 09:57:58,288 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:57:58,290 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:58,297 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-20 09:57:58,297 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:59,947 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-20 09:57:59,965 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:59,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 67 [2019-01-20 09:57:59,966 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:59,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-01-20 09:57:59,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-01-20 09:57:59,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-01-20 09:57:59,967 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2019-01-20 09:58:00,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:00,033 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-01-20 09:58:00,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-01-20 09:58:00,034 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2019-01-20 09:58:00,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:00,035 INFO L225 Difference]: With dead ends: 39 [2019-01-20 09:58:00,035 INFO L226 Difference]: Without dead ends: 37 [2019-01-20 09:58:00,036 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-01-20 09:58:00,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-01-20 09:58:00,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-01-20 09:58:00,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-20 09:58:00,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-01-20 09:58:00,039 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-01-20 09:58:00,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:00,039 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-01-20 09:58:00,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-01-20 09:58:00,040 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-01-20 09:58:00,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-20 09:58:00,040 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:00,040 INFO L402 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2019-01-20 09:58:00,040 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:58:00,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:00,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1786994796, now seen corresponding path program 33 times [2019-01-20 09:58:00,041 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:00,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:00,041 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:58:00,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:00,041 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:00,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:00,564 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-20 09:58:00,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:00,564 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:00,565 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:00,565 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:00,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:00,565 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:58:00,574 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 09:58:00,574 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 09:58:00,596 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 09:58:00,597 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:58:00,598 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:00,604 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-20 09:58:00,605 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:01,966 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-20 09:58:01,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:01,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2019-01-20 09:58:01,984 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:01,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-01-20 09:58:01,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-01-20 09:58:01,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-01-20 09:58:01,985 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2019-01-20 09:58:02,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:02,083 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-01-20 09:58:02,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-01-20 09:58:02,084 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2019-01-20 09:58:02,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:02,085 INFO L225 Difference]: With dead ends: 40 [2019-01-20 09:58:02,085 INFO L226 Difference]: Without dead ends: 38 [2019-01-20 09:58:02,085 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-01-20 09:58:02,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-20 09:58:02,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-01-20 09:58:02,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-20 09:58:02,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-01-20 09:58:02,087 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-01-20 09:58:02,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:02,088 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-01-20 09:58:02,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-01-20 09:58:02,088 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-01-20 09:58:02,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-20 09:58:02,088 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:02,088 INFO L402 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2019-01-20 09:58:02,089 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:58:02,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:02,089 INFO L82 PathProgramCache]: Analyzing trace with hash -437734365, now seen corresponding path program 34 times [2019-01-20 09:58:02,089 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:02,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:02,090 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:58:02,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:02,090 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:02,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:02,697 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-20 09:58:02,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:02,697 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:02,697 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:02,697 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:02,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:02,697 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:58:02,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:58:02,705 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:58:02,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:02,740 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:02,749 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-20 09:58:02,749 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:04,230 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-20 09:58:04,247 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:04,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 71 [2019-01-20 09:58:04,247 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:04,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-01-20 09:58:04,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-01-20 09:58:04,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-01-20 09:58:04,248 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2019-01-20 09:58:04,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:04,314 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-01-20 09:58:04,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-01-20 09:58:04,314 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2019-01-20 09:58:04,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:04,315 INFO L225 Difference]: With dead ends: 41 [2019-01-20 09:58:04,315 INFO L226 Difference]: Without dead ends: 39 [2019-01-20 09:58:04,316 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-01-20 09:58:04,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-01-20 09:58:04,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-01-20 09:58:04,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-20 09:58:04,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-01-20 09:58:04,319 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-01-20 09:58:04,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:04,320 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-01-20 09:58:04,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-01-20 09:58:04,320 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-01-20 09:58:04,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-01-20 09:58:04,320 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:04,321 INFO L402 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2019-01-20 09:58:04,321 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:58:04,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:04,321 INFO L82 PathProgramCache]: Analyzing trace with hash -684861620, now seen corresponding path program 35 times [2019-01-20 09:58:04,321 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:04,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:04,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:58:04,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:04,322 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:04,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:05,218 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-20 09:58:05,219 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:05,219 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:05,219 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:05,219 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:05,219 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:05,219 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:58:05,229 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:58:05,229 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:58:05,304 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2019-01-20 09:58:05,304 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:58:05,307 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:05,315 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-20 09:58:05,315 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:06,869 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-20 09:58:06,887 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:06,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2019-01-20 09:58:06,887 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:06,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-01-20 09:58:06,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-01-20 09:58:06,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-01-20 09:58:06,888 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2019-01-20 09:58:06,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:06,938 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-01-20 09:58:06,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-01-20 09:58:06,939 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2019-01-20 09:58:06,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:06,939 INFO L225 Difference]: With dead ends: 42 [2019-01-20 09:58:06,940 INFO L226 Difference]: Without dead ends: 40 [2019-01-20 09:58:06,940 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-01-20 09:58:06,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-01-20 09:58:06,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-01-20 09:58:06,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-20 09:58:06,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-01-20 09:58:06,943 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-01-20 09:58:06,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:06,943 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-01-20 09:58:06,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-01-20 09:58:06,943 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-01-20 09:58:06,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-20 09:58:06,943 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:06,944 INFO L402 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2019-01-20 09:58:06,944 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:58:06,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:06,944 INFO L82 PathProgramCache]: Analyzing trace with hash 244128067, now seen corresponding path program 36 times [2019-01-20 09:58:06,944 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:06,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:06,945 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:58:06,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:06,945 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:06,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:07,532 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-20 09:58:07,533 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:07,533 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:07,533 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:07,533 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:07,533 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:07,533 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:58:07,541 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 09:58:07,541 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 09:58:07,563 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 09:58:07,563 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:58:07,565 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:07,573 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-20 09:58:07,573 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:09,492 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-20 09:58:09,510 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:09,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 75 [2019-01-20 09:58:09,511 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:09,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-01-20 09:58:09,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-01-20 09:58:09,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-01-20 09:58:09,512 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2019-01-20 09:58:09,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:09,579 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-01-20 09:58:09,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-01-20 09:58:09,580 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2019-01-20 09:58:09,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:09,580 INFO L225 Difference]: With dead ends: 43 [2019-01-20 09:58:09,580 INFO L226 Difference]: Without dead ends: 41 [2019-01-20 09:58:09,581 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-01-20 09:58:09,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-20 09:58:09,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-01-20 09:58:09,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-20 09:58:09,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-01-20 09:58:09,582 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-01-20 09:58:09,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:09,583 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-01-20 09:58:09,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-01-20 09:58:09,583 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-01-20 09:58:09,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-01-20 09:58:09,584 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:09,584 INFO L402 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2019-01-20 09:58:09,584 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:58:09,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:09,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1021962708, now seen corresponding path program 37 times [2019-01-20 09:58:09,585 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:09,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:09,585 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:58:09,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:09,586 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:09,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:10,729 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-20 09:58:10,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:10,729 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:10,729 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:10,730 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:10,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:10,730 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:58:10,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:58:10,738 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:58:10,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:10,774 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:10,783 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-20 09:58:10,783 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:12,547 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-20 09:58:12,566 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:12,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 77 [2019-01-20 09:58:12,567 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:12,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-01-20 09:58:12,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-01-20 09:58:12,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-01-20 09:58:12,568 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2019-01-20 09:58:12,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:12,633 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-01-20 09:58:12,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-01-20 09:58:12,633 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2019-01-20 09:58:12,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:12,634 INFO L225 Difference]: With dead ends: 44 [2019-01-20 09:58:12,634 INFO L226 Difference]: Without dead ends: 42 [2019-01-20 09:58:12,635 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-01-20 09:58:12,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-01-20 09:58:12,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-01-20 09:58:12,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-20 09:58:12,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-01-20 09:58:12,636 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2019-01-20 09:58:12,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:12,637 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-01-20 09:58:12,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-01-20 09:58:12,637 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-01-20 09:58:12,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-01-20 09:58:12,637 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:12,637 INFO L402 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2019-01-20 09:58:12,638 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:58:12,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:12,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1616071069, now seen corresponding path program 38 times [2019-01-20 09:58:12,638 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:12,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:12,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:58:12,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:12,640 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:12,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:13,296 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-20 09:58:13,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:13,297 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:13,297 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:13,297 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:13,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:13,297 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:58:13,307 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:58:13,307 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:58:13,390 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-01-20 09:58:13,390 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:58:13,392 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:13,400 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-20 09:58:13,400 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:15,606 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-20 09:58:15,624 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:15,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 79 [2019-01-20 09:58:15,625 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:15,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-01-20 09:58:15,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-01-20 09:58:15,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-01-20 09:58:15,626 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2019-01-20 09:58:15,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:15,683 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-01-20 09:58:15,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-01-20 09:58:15,684 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2019-01-20 09:58:15,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:15,684 INFO L225 Difference]: With dead ends: 45 [2019-01-20 09:58:15,684 INFO L226 Difference]: Without dead ends: 43 [2019-01-20 09:58:15,685 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-01-20 09:58:15,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-01-20 09:58:15,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-01-20 09:58:15,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-20 09:58:15,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-01-20 09:58:15,688 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2019-01-20 09:58:15,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:15,688 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-01-20 09:58:15,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-01-20 09:58:15,688 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-01-20 09:58:15,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-01-20 09:58:15,689 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:15,689 INFO L402 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2019-01-20 09:58:15,689 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:58:15,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:15,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1441406220, now seen corresponding path program 39 times [2019-01-20 09:58:15,689 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:15,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:15,690 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:58:15,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:15,690 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:15,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:16,385 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-20 09:58:16,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:16,386 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:16,386 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:16,386 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:16,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:16,386 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:58:16,395 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 09:58:16,396 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 09:58:16,422 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 09:58:16,422 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:58:16,424 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:16,430 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-20 09:58:16,430 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:18,295 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-20 09:58:18,313 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:18,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 81 [2019-01-20 09:58:18,314 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:18,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-01-20 09:58:18,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-01-20 09:58:18,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-01-20 09:58:18,315 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2019-01-20 09:58:18,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:18,384 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-01-20 09:58:18,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-01-20 09:58:18,385 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2019-01-20 09:58:18,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:18,385 INFO L225 Difference]: With dead ends: 46 [2019-01-20 09:58:18,385 INFO L226 Difference]: Without dead ends: 44 [2019-01-20 09:58:18,386 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-01-20 09:58:18,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-20 09:58:18,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-01-20 09:58:18,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-01-20 09:58:18,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-01-20 09:58:18,389 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2019-01-20 09:58:18,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:18,389 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-01-20 09:58:18,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-01-20 09:58:18,389 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-01-20 09:58:18,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-01-20 09:58:18,390 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:18,390 INFO L402 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2019-01-20 09:58:18,390 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:58:18,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:18,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1733921667, now seen corresponding path program 40 times [2019-01-20 09:58:18,390 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:18,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:18,391 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:58:18,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:18,391 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:18,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:19,081 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-20 09:58:19,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:19,082 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:19,082 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:19,082 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:19,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:19,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 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:58:19,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:58:19,091 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:58:19,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:19,130 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:19,140 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-20 09:58:19,140 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:21,531 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-20 09:58:21,548 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:21,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 83 [2019-01-20 09:58:21,549 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:21,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-01-20 09:58:21,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-01-20 09:58:21,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-01-20 09:58:21,550 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2019-01-20 09:58:21,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:21,644 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-01-20 09:58:21,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-01-20 09:58:21,645 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2019-01-20 09:58:21,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:21,645 INFO L225 Difference]: With dead ends: 47 [2019-01-20 09:58:21,645 INFO L226 Difference]: Without dead ends: 45 [2019-01-20 09:58:21,646 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-01-20 09:58:21,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-01-20 09:58:21,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-01-20 09:58:21,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-20 09:58:21,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-01-20 09:58:21,648 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2019-01-20 09:58:21,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:21,648 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-01-20 09:58:21,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-01-20 09:58:21,648 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-01-20 09:58:21,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-20 09:58:21,649 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:21,649 INFO L402 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2019-01-20 09:58:21,649 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:58:21,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:21,649 INFO L82 PathProgramCache]: Analyzing trace with hash -2083001364, now seen corresponding path program 41 times [2019-01-20 09:58:21,649 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:21,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:21,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:58:21,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:21,650 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:21,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:22,432 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-20 09:58:22,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:22,433 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:22,433 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:22,433 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:22,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:22,433 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:58:22,442 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:58:22,443 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:58:22,550 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-01-20 09:58:22,550 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:58:22,553 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:22,563 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-20 09:58:22,563 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:24,657 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-20 09:58:24,677 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:24,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 85 [2019-01-20 09:58:24,678 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:24,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-01-20 09:58:24,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-01-20 09:58:24,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-01-20 09:58:24,679 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2019-01-20 09:58:24,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:24,757 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-01-20 09:58:24,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-01-20 09:58:24,758 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2019-01-20 09:58:24,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:24,759 INFO L225 Difference]: With dead ends: 48 [2019-01-20 09:58:24,759 INFO L226 Difference]: Without dead ends: 46 [2019-01-20 09:58:24,759 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-01-20 09:58:24,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-01-20 09:58:24,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-01-20 09:58:24,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-20 09:58:24,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-01-20 09:58:24,761 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2019-01-20 09:58:24,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:24,761 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-01-20 09:58:24,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-01-20 09:58:24,761 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-01-20 09:58:24,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-20 09:58:24,762 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:24,762 INFO L402 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2019-01-20 09:58:24,762 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:58:24,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:24,762 INFO L82 PathProgramCache]: Analyzing trace with hash -148531037, now seen corresponding path program 42 times [2019-01-20 09:58:24,762 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:24,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:24,763 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:58:24,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:24,764 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:24,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:25,881 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-20 09:58:25,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:25,882 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:25,882 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:25,882 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:25,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:25,882 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:58:25,891 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 09:58:25,891 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 09:58:25,920 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 09:58:25,920 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:58:25,922 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:25,929 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-20 09:58:25,929 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:28,210 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-20 09:58:28,227 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:28,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 87 [2019-01-20 09:58:28,228 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:28,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-01-20 09:58:28,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-01-20 09:58:28,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-01-20 09:58:28,229 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2019-01-20 09:58:28,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:28,282 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-01-20 09:58:28,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-01-20 09:58:28,283 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2019-01-20 09:58:28,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:28,283 INFO L225 Difference]: With dead ends: 49 [2019-01-20 09:58:28,284 INFO L226 Difference]: Without dead ends: 47 [2019-01-20 09:58:28,284 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-01-20 09:58:28,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-20 09:58:28,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-01-20 09:58:28,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-20 09:58:28,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-01-20 09:58:28,287 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2019-01-20 09:58:28,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:28,287 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-01-20 09:58:28,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-01-20 09:58:28,288 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-01-20 09:58:28,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-01-20 09:58:28,288 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:28,288 INFO L402 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2019-01-20 09:58:28,288 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:58:28,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:28,289 INFO L82 PathProgramCache]: Analyzing trace with hash -309493044, now seen corresponding path program 43 times [2019-01-20 09:58:28,289 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:28,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:28,290 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:58:28,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:28,290 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:28,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:29,194 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-20 09:58:29,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:29,195 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:29,195 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:29,195 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:29,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:29,195 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:58:29,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:58:29,205 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:58:29,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:29,233 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:29,244 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-20 09:58:29,244 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:31,772 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-20 09:58:31,790 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:31,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 89 [2019-01-20 09:58:31,791 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:31,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-01-20 09:58:31,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-01-20 09:58:31,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-01-20 09:58:31,792 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2019-01-20 09:58:31,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:31,877 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-01-20 09:58:31,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-01-20 09:58:31,877 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2019-01-20 09:58:31,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:31,878 INFO L225 Difference]: With dead ends: 50 [2019-01-20 09:58:31,878 INFO L226 Difference]: Without dead ends: 48 [2019-01-20 09:58:31,879 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-01-20 09:58:31,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-01-20 09:58:31,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-01-20 09:58:31,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-20 09:58:31,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-01-20 09:58:31,880 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2019-01-20 09:58:31,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:31,881 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-01-20 09:58:31,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-01-20 09:58:31,881 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-01-20 09:58:31,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-01-20 09:58:31,882 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:31,882 INFO L402 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2019-01-20 09:58:31,882 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:58:31,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:31,882 INFO L82 PathProgramCache]: Analyzing trace with hash -1004347965, now seen corresponding path program 44 times [2019-01-20 09:58:31,883 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:31,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:31,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:58:31,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:31,884 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:31,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:32,712 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-20 09:58:32,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:32,712 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:32,712 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:32,713 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:32,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:32,713 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:58:32,721 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:58:32,721 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:58:32,842 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2019-01-20 09:58:32,842 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:58:32,845 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:32,852 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-20 09:58:32,852 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:35,435 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-20 09:58:35,455 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:35,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 91 [2019-01-20 09:58:35,456 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:35,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-01-20 09:58:35,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-01-20 09:58:35,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-01-20 09:58:35,457 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2019-01-20 09:58:35,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:35,586 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-01-20 09:58:35,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-01-20 09:58:35,586 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2019-01-20 09:58:35,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:35,587 INFO L225 Difference]: With dead ends: 51 [2019-01-20 09:58:35,587 INFO L226 Difference]: Without dead ends: 49 [2019-01-20 09:58:35,588 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-01-20 09:58:35,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-01-20 09:58:35,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-01-20 09:58:35,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-01-20 09:58:35,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-01-20 09:58:35,590 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2019-01-20 09:58:35,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:35,591 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-01-20 09:58:35,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-01-20 09:58:35,591 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-01-20 09:58:35,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-20 09:58:35,592 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:35,592 INFO L402 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2019-01-20 09:58:35,592 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:58:35,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:35,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1070014036, now seen corresponding path program 45 times [2019-01-20 09:58:35,592 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:35,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:35,593 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:58:35,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:35,593 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:35,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:36,574 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-20 09:58:36,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:36,574 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:36,574 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:36,574 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:36,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:36,574 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:58:36,583 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 09:58:36,583 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 09:58:36,637 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 09:58:36,637 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:58:36,640 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:36,650 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-20 09:58:36,650 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:39,177 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-20 09:58:39,195 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:39,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 93 [2019-01-20 09:58:39,196 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:39,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-01-20 09:58:39,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-01-20 09:58:39,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-01-20 09:58:39,197 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2019-01-20 09:58:39,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:39,533 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-01-20 09:58:39,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-01-20 09:58:39,534 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2019-01-20 09:58:39,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:39,534 INFO L225 Difference]: With dead ends: 52 [2019-01-20 09:58:39,534 INFO L226 Difference]: Without dead ends: 50 [2019-01-20 09:58:39,535 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-01-20 09:58:39,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-01-20 09:58:39,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-01-20 09:58:39,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-01-20 09:58:39,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-01-20 09:58:39,537 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2019-01-20 09:58:39,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:39,537 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-01-20 09:58:39,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-01-20 09:58:39,537 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-01-20 09:58:39,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-01-20 09:58:39,538 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:39,538 INFO L402 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2019-01-20 09:58:39,538 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:58:39,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:39,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1189305059, now seen corresponding path program 46 times [2019-01-20 09:58:39,539 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:39,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:39,539 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:58:39,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:39,539 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:39,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:40,773 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-20 09:58:40,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:40,773 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:40,773 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:40,774 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:40,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:40,774 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:58:40,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:58:40,782 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:58:40,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:40,813 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:40,820 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-20 09:58:40,820 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:43,491 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-20 09:58:43,509 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:43,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2019-01-20 09:58:43,510 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:43,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-01-20 09:58:43,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-01-20 09:58:43,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-01-20 09:58:43,511 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2019-01-20 09:58:43,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:43,599 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-01-20 09:58:43,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-01-20 09:58:43,599 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2019-01-20 09:58:43,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:43,600 INFO L225 Difference]: With dead ends: 53 [2019-01-20 09:58:43,600 INFO L226 Difference]: Without dead ends: 51 [2019-01-20 09:58:43,601 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-01-20 09:58:43,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-01-20 09:58:43,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-01-20 09:58:43,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-20 09:58:43,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-01-20 09:58:43,602 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2019-01-20 09:58:43,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:43,603 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-01-20 09:58:43,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-01-20 09:58:43,603 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-01-20 09:58:43,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-20 09:58:43,603 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:43,603 INFO L402 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2019-01-20 09:58:43,603 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:58:43,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:43,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1786247028, now seen corresponding path program 47 times [2019-01-20 09:58:43,604 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:43,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:43,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:58:43,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:43,604 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:43,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:44,545 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-20 09:58:44,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:44,545 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:44,545 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:44,545 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:44,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:44,545 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:58:44,554 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:58:44,554 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:58:44,709 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2019-01-20 09:58:44,709 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:58:44,712 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:44,720 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-20 09:58:44,720 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:47,674 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-20 09:58:47,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:47,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2019-01-20 09:58:47,693 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:47,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-01-20 09:58:47,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-01-20 09:58:47,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-01-20 09:58:47,694 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2019-01-20 09:58:47,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:47,753 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-01-20 09:58:47,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-01-20 09:58:47,754 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2019-01-20 09:58:47,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:47,755 INFO L225 Difference]: With dead ends: 54 [2019-01-20 09:58:47,755 INFO L226 Difference]: Without dead ends: 52 [2019-01-20 09:58:47,756 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-01-20 09:58:47,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-01-20 09:58:47,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-01-20 09:58:47,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-01-20 09:58:47,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-01-20 09:58:47,758 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2019-01-20 09:58:47,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:47,758 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-01-20 09:58:47,758 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-01-20 09:58:47,759 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-01-20 09:58:47,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-01-20 09:58:47,759 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:47,759 INFO L402 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2019-01-20 09:58:47,759 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:58:47,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:47,760 INFO L82 PathProgramCache]: Analyzing trace with hash 460918787, now seen corresponding path program 48 times [2019-01-20 09:58:47,760 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:47,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:47,761 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:58:47,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:47,761 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:47,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:48,734 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-20 09:58:48,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:48,734 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:48,735 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:48,735 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:48,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:48,735 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:58:48,743 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 09:58:48,743 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 09:58:48,773 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 09:58:48,774 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:58:48,775 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:48,784 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-20 09:58:48,784 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:51,831 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-20 09:58:51,858 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:51,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 99 [2019-01-20 09:58:51,859 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:51,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-01-20 09:58:51,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-01-20 09:58:51,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-01-20 09:58:51,860 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2019-01-20 09:58:52,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:52,000 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-01-20 09:58:52,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-01-20 09:58:52,001 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2019-01-20 09:58:52,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:52,002 INFO L225 Difference]: With dead ends: 55 [2019-01-20 09:58:52,002 INFO L226 Difference]: Without dead ends: 53 [2019-01-20 09:58:52,003 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-01-20 09:58:52,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-20 09:58:52,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-01-20 09:58:52,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-20 09:58:52,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-01-20 09:58:52,006 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2019-01-20 09:58:52,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:52,006 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-01-20 09:58:52,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-01-20 09:58:52,007 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-01-20 09:58:52,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-01-20 09:58:52,007 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:52,007 INFO L402 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2019-01-20 09:58:52,007 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:58:52,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:52,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1403582316, now seen corresponding path program 49 times [2019-01-20 09:58:52,008 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:52,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:52,008 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:58:52,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:52,009 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:52,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:53,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-20 09:58:53,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:53,011 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:53,011 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:53,011 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:53,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:53,011 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:58:53,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:58:53,020 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:58:53,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:53,054 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:53,066 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-20 09:58:53,066 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:56,511 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-20 09:58:56,530 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:56,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 101 [2019-01-20 09:58:56,531 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:56,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-01-20 09:58:56,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-01-20 09:58:56,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-01-20 09:58:56,532 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2019-01-20 09:58:56,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:56,593 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-01-20 09:58:56,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-01-20 09:58:56,594 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2019-01-20 09:58:56,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:56,594 INFO L225 Difference]: With dead ends: 56 [2019-01-20 09:58:56,594 INFO L226 Difference]: Without dead ends: 54 [2019-01-20 09:58:56,595 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-01-20 09:58:56,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-01-20 09:58:56,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-01-20 09:58:56,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-01-20 09:58:56,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-01-20 09:58:56,598 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2019-01-20 09:58:56,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:56,598 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-01-20 09:58:56,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-01-20 09:58:56,598 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-01-20 09:58:56,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-01-20 09:58:56,598 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:56,598 INFO L402 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2019-01-20 09:58:56,599 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:58:56,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:56,599 INFO L82 PathProgramCache]: Analyzing trace with hash 561380643, now seen corresponding path program 50 times [2019-01-20 09:58:56,599 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:56,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:56,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:58:56,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:56,600 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:56,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:57,590 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-20 09:58:57,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:57,590 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:57,590 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:57,590 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:57,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:57,590 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:58:57,601 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:58:57,601 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:58:57,778 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2019-01-20 09:58:57,779 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:58:57,782 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:57,794 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-20 09:58:57,794 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:59:01,222 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-20 09:59:01,251 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:59:01,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 103 [2019-01-20 09:59:01,252 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:59:01,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-01-20 09:59:01,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-01-20 09:59:01,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-01-20 09:59:01,253 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 53 states. [2019-01-20 09:59:01,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:59:01,402 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-01-20 09:59:01,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-01-20 09:59:01,402 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2019-01-20 09:59:01,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:59:01,403 INFO L225 Difference]: With dead ends: 57 [2019-01-20 09:59:01,403 INFO L226 Difference]: Without dead ends: 55 [2019-01-20 09:59:01,404 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-01-20 09:59:01,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-20 09:59:01,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-01-20 09:59:01,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-01-20 09:59:01,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-01-20 09:59:01,406 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2019-01-20 09:59:01,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:59:01,406 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-01-20 09:59:01,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-01-20 09:59:01,406 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-01-20 09:59:01,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-20 09:59:01,406 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:59:01,407 INFO L402 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2019-01-20 09:59:01,407 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:59:01,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:59:01,407 INFO L82 PathProgramCache]: Analyzing trace with hash 222932556, now seen corresponding path program 51 times [2019-01-20 09:59:01,407 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:59:01,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:01,408 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:59:01,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:01,408 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:59:01,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:59:02,569 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-20 09:59:02,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:02,569 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:59:02,569 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:59:02,569 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:59:02,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:02,570 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:59:02,581 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 09:59:02,581 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 09:59:02,614 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 09:59:02,614 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:59:02,616 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:59:02,628 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-20 09:59:02,628 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:59:05,846 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-20 09:59:05,864 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:59:05,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 105 [2019-01-20 09:59:05,864 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:59:05,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-01-20 09:59:05,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-01-20 09:59:05,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-01-20 09:59:05,866 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 54 states. [2019-01-20 09:59:06,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:59:06,004 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-01-20 09:59:06,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-01-20 09:59:06,005 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2019-01-20 09:59:06,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:59:06,005 INFO L225 Difference]: With dead ends: 58 [2019-01-20 09:59:06,005 INFO L226 Difference]: Without dead ends: 56 [2019-01-20 09:59:06,006 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-01-20 09:59:06,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-01-20 09:59:06,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-01-20 09:59:06,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-01-20 09:59:06,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-01-20 09:59:06,008 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2019-01-20 09:59:06,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:59:06,009 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-01-20 09:59:06,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-01-20 09:59:06,009 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-01-20 09:59:06,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-01-20 09:59:06,009 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:59:06,009 INFO L402 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2019-01-20 09:59:06,010 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:59:06,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:59:06,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1679023549, now seen corresponding path program 52 times [2019-01-20 09:59:06,010 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:59:06,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:06,011 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:59:06,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:06,011 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:59:06,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:59:07,209 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-20 09:59:07,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:07,210 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:59:07,210 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:59:07,210 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:59:07,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:07,210 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:59:07,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:59:07,219 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:59:07,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:59:07,253 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:59:07,261 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-20 09:59:07,261 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:59:10,521 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-20 09:59:10,539 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:59:10,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 107 [2019-01-20 09:59:10,540 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:59:10,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-01-20 09:59:10,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-01-20 09:59:10,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-01-20 09:59:10,541 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 55 states. [2019-01-20 09:59:10,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:59:10,637 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-01-20 09:59:10,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-01-20 09:59:10,637 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2019-01-20 09:59:10,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:59:10,638 INFO L225 Difference]: With dead ends: 59 [2019-01-20 09:59:10,638 INFO L226 Difference]: Without dead ends: 57 [2019-01-20 09:59:10,639 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-01-20 09:59:10,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-01-20 09:59:10,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-01-20 09:59:10,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-01-20 09:59:10,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-01-20 09:59:10,640 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2019-01-20 09:59:10,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:59:10,641 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-01-20 09:59:10,641 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-01-20 09:59:10,641 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-01-20 09:59:10,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-20 09:59:10,641 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:59:10,642 INFO L402 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2019-01-20 09:59:10,642 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:59:10,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:59:10,642 INFO L82 PathProgramCache]: Analyzing trace with hash -510120660, now seen corresponding path program 53 times [2019-01-20 09:59:10,642 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:59:10,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:10,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:59:10,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:10,643 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:59:10,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:59:12,161 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-20 09:59:12,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:12,161 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:59:12,161 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:59:12,161 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:59:12,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:12,161 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:59:12,170 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:59:12,170 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:59:12,390 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2019-01-20 09:59:12,390 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:59:12,394 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:59:12,403 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-20 09:59:12,403 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:59:15,833 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-20 09:59:15,853 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:59:15,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 109 [2019-01-20 09:59:15,853 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:59:15,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-01-20 09:59:15,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-01-20 09:59:15,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-01-20 09:59:15,855 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 56 states. [2019-01-20 09:59:15,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:59:15,932 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-01-20 09:59:15,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-01-20 09:59:15,933 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2019-01-20 09:59:15,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:59:15,934 INFO L225 Difference]: With dead ends: 60 [2019-01-20 09:59:15,934 INFO L226 Difference]: Without dead ends: 58 [2019-01-20 09:59:15,935 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-01-20 09:59:15,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-01-20 09:59:15,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-01-20 09:59:15,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-01-20 09:59:15,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-01-20 09:59:15,937 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2019-01-20 09:59:15,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:59:15,937 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-01-20 09:59:15,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-01-20 09:59:15,937 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-01-20 09:59:15,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-01-20 09:59:15,938 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:59:15,938 INFO L402 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2019-01-20 09:59:15,938 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:59:15,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:59:15,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1366130531, now seen corresponding path program 54 times [2019-01-20 09:59:15,938 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:59:15,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:15,939 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:59:15,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:15,939 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:59:15,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:59:17,438 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-20 09:59:17,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:17,438 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:59:17,438 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:59:17,438 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:59:17,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:17,439 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:59:17,448 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 09:59:17,448 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 09:59:17,480 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 09:59:17,480 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:59:17,482 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:59:17,490 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-20 09:59:17,490 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:59:21,080 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-20 09:59:21,097 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:59:21,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 111 [2019-01-20 09:59:21,098 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:59:21,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-01-20 09:59:21,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-01-20 09:59:21,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-01-20 09:59:21,099 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 57 states. [2019-01-20 09:59:21,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:59:21,191 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-01-20 09:59:21,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-01-20 09:59:21,192 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2019-01-20 09:59:21,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:59:21,193 INFO L225 Difference]: With dead ends: 61 [2019-01-20 09:59:21,193 INFO L226 Difference]: Without dead ends: 59 [2019-01-20 09:59:21,194 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-01-20 09:59:21,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-01-20 09:59:21,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-01-20 09:59:21,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-20 09:59:21,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-01-20 09:59:21,195 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2019-01-20 09:59:21,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:59:21,195 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-01-20 09:59:21,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-01-20 09:59:21,196 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-01-20 09:59:21,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-01-20 09:59:21,196 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:59:21,196 INFO L402 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2019-01-20 09:59:21,196 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:59:21,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:59:21,197 INFO L82 PathProgramCache]: Analyzing trace with hash -599624692, now seen corresponding path program 55 times [2019-01-20 09:59:21,197 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:59:21,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:21,197 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:59:21,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:21,198 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:59:21,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:59:22,437 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-20 09:59:22,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:22,438 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:59:22,438 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:59:22,438 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:59:22,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:22,438 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:59:22,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:59:22,448 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:59:22,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:59:22,484 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:59:22,492 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-20 09:59:22,492 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:59:26,077 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-20 09:59:26,096 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:59:26,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 113 [2019-01-20 09:59:26,096 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:59:26,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-01-20 09:59:26,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-01-20 09:59:26,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-01-20 09:59:26,097 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 58 states. [2019-01-20 09:59:26,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:59:26,211 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-01-20 09:59:26,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-01-20 09:59:26,212 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2019-01-20 09:59:26,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:59:26,213 INFO L225 Difference]: With dead ends: 62 [2019-01-20 09:59:26,213 INFO L226 Difference]: Without dead ends: 60 [2019-01-20 09:59:26,213 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-20 09:59:26,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-01-20 09:59:26,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-01-20 09:59:26,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-01-20 09:59:26,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-01-20 09:59:26,216 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2019-01-20 09:59:26,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:59:26,216 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-01-20 09:59:26,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-01-20 09:59:26,216 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-01-20 09:59:26,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-01-20 09:59:26,217 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:59:26,217 INFO L402 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2019-01-20 09:59:26,217 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:59:26,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:59:26,217 INFO L82 PathProgramCache]: Analyzing trace with hash -1408494461, now seen corresponding path program 56 times [2019-01-20 09:59:26,218 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:59:26,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:26,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:59:26,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:26,218 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:59:26,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:59:27,840 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-20 09:59:27,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:27,841 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:59:27,841 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:59:27,841 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:59:27,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:27,841 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:59:27,850 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:59:27,851 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:59:28,092 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2019-01-20 09:59:28,093 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:59:28,097 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:59:28,107 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-20 09:59:28,107 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:59:32,207 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-20 09:59:32,226 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:59:32,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 115 [2019-01-20 09:59:32,226 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:59:32,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-01-20 09:59:32,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-01-20 09:59:32,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-01-20 09:59:32,227 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2019-01-20 09:59:32,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:59:32,302 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-01-20 09:59:32,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-01-20 09:59:32,303 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2019-01-20 09:59:32,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:59:32,304 INFO L225 Difference]: With dead ends: 63 [2019-01-20 09:59:32,304 INFO L226 Difference]: Without dead ends: 61 [2019-01-20 09:59:32,305 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-01-20 09:59:32,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-01-20 09:59:32,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-01-20 09:59:32,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-20 09:59:32,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-01-20 09:59:32,308 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2019-01-20 09:59:32,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:59:32,309 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-01-20 09:59:32,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-01-20 09:59:32,309 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-01-20 09:59:32,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-01-20 09:59:32,309 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:59:32,310 INFO L402 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2019-01-20 09:59:32,310 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:59:32,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:59:32,310 INFO L82 PathProgramCache]: Analyzing trace with hash -713653524, now seen corresponding path program 57 times [2019-01-20 09:59:32,310 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:59:32,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:32,311 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:59:32,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:32,311 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:59:32,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:59:33,697 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-20 09:59:33,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:33,698 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:59:33,698 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:59:33,698 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:59:33,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:33,698 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:59:33,706 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 09:59:33,706 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 09:59:33,743 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 09:59:33,743 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:59:33,745 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:59:33,754 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-20 09:59:33,754 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:59:37,982 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-20 09:59:38,000 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:59:38,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 117 [2019-01-20 09:59:38,000 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:59:38,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-01-20 09:59:38,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-01-20 09:59:38,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-01-20 09:59:38,001 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2019-01-20 09:59:38,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:59:38,105 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-01-20 09:59:38,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-01-20 09:59:38,105 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2019-01-20 09:59:38,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:59:38,106 INFO L225 Difference]: With dead ends: 64 [2019-01-20 09:59:38,106 INFO L226 Difference]: Without dead ends: 62 [2019-01-20 09:59:38,107 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-01-20 09:59:38,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-01-20 09:59:38,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-01-20 09:59:38,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-01-20 09:59:38,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-01-20 09:59:38,109 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2019-01-20 09:59:38,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:59:38,110 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-01-20 09:59:38,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-01-20 09:59:38,110 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-01-20 09:59:38,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-01-20 09:59:38,111 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:59:38,111 INFO L402 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2019-01-20 09:59:38,111 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:59:38,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:59:38,111 INFO L82 PathProgramCache]: Analyzing trace with hash -648420957, now seen corresponding path program 58 times [2019-01-20 09:59:38,111 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:59:38,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:38,112 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:59:38,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:38,112 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:59:38,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:59:39,474 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-20 09:59:39,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:39,474 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:59:39,474 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:59:39,474 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:59:39,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:39,475 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:59:39,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:59:39,484 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:59:39,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:59:39,522 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:59:39,534 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-20 09:59:39,534 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:59:43,937 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-20 09:59:43,954 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:59:43,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 119 [2019-01-20 09:59:43,955 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:59:43,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-01-20 09:59:43,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-01-20 09:59:43,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-01-20 09:59:43,956 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 61 states. [2019-01-20 09:59:44,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:59:44,050 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-01-20 09:59:44,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-01-20 09:59:44,051 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2019-01-20 09:59:44,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:59:44,051 INFO L225 Difference]: With dead ends: 65 [2019-01-20 09:59:44,051 INFO L226 Difference]: Without dead ends: 63 [2019-01-20 09:59:44,052 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-01-20 09:59:44,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-01-20 09:59:44,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-01-20 09:59:44,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-01-20 09:59:44,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-01-20 09:59:44,054 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2019-01-20 09:59:44,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:59:44,054 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-01-20 09:59:44,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-01-20 09:59:44,054 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-01-20 09:59:44,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-01-20 09:59:44,054 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:59:44,055 INFO L402 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2019-01-20 09:59:44,055 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:59:44,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:59:44,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1373788620, now seen corresponding path program 59 times [2019-01-20 09:59:44,055 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:59:44,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:44,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:59:44,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:44,056 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:59:44,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:59:45,513 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-20 09:59:45,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:45,514 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:59:45,514 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:59:45,514 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:59:45,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:45,514 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:59:45,522 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:59:45,522 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:59:45,823 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2019-01-20 09:59:45,824 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:59:45,829 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:59:45,838 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-20 09:59:45,839 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:59:50,257 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-20 09:59:50,276 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:59:50,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 121 [2019-01-20 09:59:50,276 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:59:50,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-01-20 09:59:50,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-01-20 09:59:50,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2019-01-20 09:59:50,277 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 62 states. [2019-01-20 09:59:50,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:59:50,355 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-01-20 09:59:50,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-01-20 09:59:50,355 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2019-01-20 09:59:50,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:59:50,356 INFO L225 Difference]: With dead ends: 66 [2019-01-20 09:59:50,356 INFO L226 Difference]: Without dead ends: 64 [2019-01-20 09:59:50,357 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2019-01-20 09:59:50,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-01-20 09:59:50,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-01-20 09:59:50,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-01-20 09:59:50,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-01-20 09:59:50,359 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2019-01-20 09:59:50,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:59:50,360 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-01-20 09:59:50,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-01-20 09:59:50,360 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-01-20 09:59:50,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-01-20 09:59:50,360 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:59:50,361 INFO L402 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2019-01-20 09:59:50,361 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:59:50,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:59:50,361 INFO L82 PathProgramCache]: Analyzing trace with hash -362223933, now seen corresponding path program 60 times [2019-01-20 09:59:50,361 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:59:50,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:50,362 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:59:50,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:50,362 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:59:50,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:59:51,740 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-20 09:59:51,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:51,741 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:59:51,741 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:59:51,741 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:59:51,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:51,741 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:59:51,760 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 09:59:51,760 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 09:59:51,798 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 09:59:51,798 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:59:51,800 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:59:51,808 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-20 09:59:51,809 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:59:56,445 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-20 09:59:56,463 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:59:56,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 123 [2019-01-20 09:59:56,463 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:59:56,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-01-20 09:59:56,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-01-20 09:59:56,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2019-01-20 09:59:56,464 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 63 states. [2019-01-20 09:59:56,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:59:56,573 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-01-20 09:59:56,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-01-20 09:59:56,573 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2019-01-20 09:59:56,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:59:56,574 INFO L225 Difference]: With dead ends: 67 [2019-01-20 09:59:56,574 INFO L226 Difference]: Without dead ends: 65 [2019-01-20 09:59:56,575 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2019-01-20 09:59:56,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-20 09:59:56,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-01-20 09:59:56,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-01-20 09:59:56,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-01-20 09:59:56,576 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2019-01-20 09:59:56,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:59:56,577 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-01-20 09:59:56,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-01-20 09:59:56,577 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-01-20 09:59:56,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-01-20 09:59:56,577 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:59:56,577 INFO L402 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2019-01-20 09:59:56,577 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:59:56,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:59:56,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1655961772, now seen corresponding path program 61 times [2019-01-20 09:59:56,578 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:59:56,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:56,578 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:59:56,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:56,578 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:59:56,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:59:58,641 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-20 09:59:58,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:58,641 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:59:58,641 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:59:58,641 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:59:58,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:58,641 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:59:58,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:59:58,650 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:59:58,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:59:58,692 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:59:58,702 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-20 09:59:58,702 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:00:03,418 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-20 10:00:03,436 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:00:03,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 125 [2019-01-20 10:00:03,437 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:00:03,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-01-20 10:00:03,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-01-20 10:00:03,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2019-01-20 10:00:03,439 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 64 states. [2019-01-20 10:00:03,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:00:03,569 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-01-20 10:00:03,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-01-20 10:00:03,570 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2019-01-20 10:00:03,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:00:03,571 INFO L225 Difference]: With dead ends: 68 [2019-01-20 10:00:03,571 INFO L226 Difference]: Without dead ends: 66 [2019-01-20 10:00:03,572 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2019-01-20 10:00:03,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-01-20 10:00:03,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-01-20 10:00:03,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-01-20 10:00:03,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-01-20 10:00:03,573 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2019-01-20 10:00:03,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:00:03,574 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-01-20 10:00:03,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-01-20 10:00:03,574 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-01-20 10:00:03,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-01-20 10:00:03,574 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:00:03,574 INFO L402 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2019-01-20 10:00:03,574 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:00:03,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:00:03,575 INFO L82 PathProgramCache]: Analyzing trace with hash -204790813, now seen corresponding path program 62 times [2019-01-20 10:00:03,575 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:00:03,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:00:03,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:00:03,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:00:03,575 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:00:03,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:00:06,938 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-20 10:00:06,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:00:06,938 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:00:06,938 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:00:06,938 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:00:06,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:00:06,938 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:00:06,952 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:00:06,952 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:00:07,282 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2019-01-20 10:00:07,282 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:00:07,286 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:00:07,295 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-20 10:00:07,296 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:00:12,242 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-20 10:00:12,260 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:00:12,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 127 [2019-01-20 10:00:12,261 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:00:12,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-01-20 10:00:12,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-01-20 10:00:12,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2019-01-20 10:00:12,262 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 65 states. [2019-01-20 10:00:12,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:00:12,380 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-01-20 10:00:12,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-01-20 10:00:12,380 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2019-01-20 10:00:12,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:00:12,381 INFO L225 Difference]: With dead ends: 69 [2019-01-20 10:00:12,381 INFO L226 Difference]: Without dead ends: 67 [2019-01-20 10:00:12,382 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2019-01-20 10:00:12,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-01-20 10:00:12,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-01-20 10:00:12,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-01-20 10:00:12,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-01-20 10:00:12,385 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2019-01-20 10:00:12,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:00:12,385 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-01-20 10:00:12,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-01-20 10:00:12,386 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-01-20 10:00:12,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-20 10:00:12,386 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:00:12,386 INFO L402 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2019-01-20 10:00:12,386 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:00:12,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:00:12,387 INFO L82 PathProgramCache]: Analyzing trace with hash -2053546100, now seen corresponding path program 63 times [2019-01-20 10:00:12,387 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:00:12,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:00:12,387 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:00:12,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:00:12,388 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:00:12,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:00:14,630 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-20 10:00:14,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:00:14,630 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:00:14,631 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:00:14,631 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:00:14,631 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:00:14,631 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:00:14,642 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:00:14,642 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:00:14,707 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:00:14,707 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:00:14,710 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:00:14,723 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-20 10:00:14,724 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:00:19,696 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-20 10:00:19,715 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:00:19,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 129 [2019-01-20 10:00:19,716 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:00:19,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-01-20 10:00:19,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-01-20 10:00:19,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2019-01-20 10:00:19,717 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 66 states. [2019-01-20 10:00:19,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:00:19,835 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-01-20 10:00:19,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-01-20 10:00:19,840 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2019-01-20 10:00:19,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:00:19,841 INFO L225 Difference]: With dead ends: 70 [2019-01-20 10:00:19,841 INFO L226 Difference]: Without dead ends: 68 [2019-01-20 10:00:19,842 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2019-01-20 10:00:19,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-01-20 10:00:19,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-01-20 10:00:19,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-01-20 10:00:19,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-01-20 10:00:19,844 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2019-01-20 10:00:19,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:00:19,844 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-01-20 10:00:19,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-01-20 10:00:19,845 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-01-20 10:00:19,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-20 10:00:19,845 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:00:19,845 INFO L402 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2019-01-20 10:00:19,845 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:00:19,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:00:19,846 INFO L82 PathProgramCache]: Analyzing trace with hash 764582147, now seen corresponding path program 64 times [2019-01-20 10:00:19,846 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:00:19,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:00:19,847 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:00:19,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:00:19,847 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:00:19,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:00:21,451 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-20 10:00:21,451 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:00:21,451 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:00:21,451 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:00:21,451 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:00:21,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:00:21,452 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:00:21,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:00:21,460 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:00:21,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:00:21,500 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:00:21,512 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-20 10:00:21,512 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:00:26,660 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-20 10:00:26,678 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:00:26,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 131 [2019-01-20 10:00:26,678 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:00:26,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-01-20 10:00:26,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-01-20 10:00:26,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2019-01-20 10:00:26,680 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2019-01-20 10:00:26,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:00:26,768 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-01-20 10:00:26,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-01-20 10:00:26,768 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2019-01-20 10:00:26,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:00:26,769 INFO L225 Difference]: With dead ends: 71 [2019-01-20 10:00:26,769 INFO L226 Difference]: Without dead ends: 69 [2019-01-20 10:00:26,770 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2019-01-20 10:00:26,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-01-20 10:00:26,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-01-20 10:00:26,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-01-20 10:00:26,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-01-20 10:00:26,772 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2019-01-20 10:00:26,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:00:26,773 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-01-20 10:00:26,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-01-20 10:00:26,773 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-01-20 10:00:26,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-01-20 10:00:26,773 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:00:26,773 INFO L402 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2019-01-20 10:00:26,774 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:00:26,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:00:26,774 INFO L82 PathProgramCache]: Analyzing trace with hash -2067755412, now seen corresponding path program 65 times [2019-01-20 10:00:26,774 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:00:26,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:00:26,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:00:26,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:00:26,775 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:00:26,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:00:29,234 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-20 10:00:29,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:00:29,235 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:00:29,235 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:00:29,235 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:00:29,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:00:29,235 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:00:29,243 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:00:29,243 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:00:29,649 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2019-01-20 10:00:29,650 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:00:29,655 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:00:29,672 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-20 10:00:29,672 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:00:35,991 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-20 10:00:36,011 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:00:36,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 133 [2019-01-20 10:00:36,012 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:00:36,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-01-20 10:00:36,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-01-20 10:00:36,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2019-01-20 10:00:36,013 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 68 states. [2019-01-20 10:00:36,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:00:36,116 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-01-20 10:00:36,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-01-20 10:00:36,117 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2019-01-20 10:00:36,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:00:36,118 INFO L225 Difference]: With dead ends: 72 [2019-01-20 10:00:36,118 INFO L226 Difference]: Without dead ends: 70 [2019-01-20 10:00:36,118 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2019-01-20 10:00:36,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-01-20 10:00:36,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-01-20 10:00:36,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-01-20 10:00:36,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-01-20 10:00:36,120 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2019-01-20 10:00:36,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:00:36,120 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-01-20 10:00:36,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-01-20 10:00:36,121 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-01-20 10:00:36,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-01-20 10:00:36,121 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:00:36,121 INFO L402 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2019-01-20 10:00:36,121 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:00:36,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:00:36,122 INFO L82 PathProgramCache]: Analyzing trace with hash 324093475, now seen corresponding path program 66 times [2019-01-20 10:00:36,122 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:00:36,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:00:36,122 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:00:36,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:00:36,123 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:00:36,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:00:37,750 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-20 10:00:37,750 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:00:37,750 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:00:37,750 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:00:37,750 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:00:37,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:00:37,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 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:00:37,761 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:00:37,761 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:00:37,803 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:00:37,803 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:00:37,806 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:00:37,822 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-20 10:00:37,822 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:00:43,320 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-20 10:00:43,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:00:43,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 135 [2019-01-20 10:00:43,338 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:00:43,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-01-20 10:00:43,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-01-20 10:00:43,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2019-01-20 10:00:43,340 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 69 states. [2019-01-20 10:00:43,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:00:43,636 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-01-20 10:00:43,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-01-20 10:00:43,636 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2019-01-20 10:00:43,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:00:43,637 INFO L225 Difference]: With dead ends: 73 [2019-01-20 10:00:43,637 INFO L226 Difference]: Without dead ends: 71 [2019-01-20 10:00:43,637 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2019-01-20 10:00:43,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-20 10:00:43,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-01-20 10:00:43,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-20 10:00:43,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-01-20 10:00:43,639 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2019-01-20 10:00:43,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:00:43,639 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-01-20 10:00:43,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-01-20 10:00:43,639 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-01-20 10:00:43,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-01-20 10:00:43,640 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:00:43,640 INFO L402 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2019-01-20 10:00:43,640 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:00:43,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:00:43,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1456964940, now seen corresponding path program 67 times [2019-01-20 10:00:43,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:00:43,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:00:43,641 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:00:43,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:00:43,641 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:00:43,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:00:45,334 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-20 10:00:45,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:00:45,334 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:00:45,334 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:00:45,334 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:00:45,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:00:45,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 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:00:45,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:00:45,345 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:00:45,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:00:45,388 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:00:45,399 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-20 10:00:45,399 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:00:50,853 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-20 10:00:50,871 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:00:50,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 137 [2019-01-20 10:00:50,872 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:00:50,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-01-20 10:00:50,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-01-20 10:00:50,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2019-01-20 10:00:50,873 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 70 states. [2019-01-20 10:00:50,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:00:50,967 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-01-20 10:00:50,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-01-20 10:00:50,968 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2019-01-20 10:00:50,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:00:50,969 INFO L225 Difference]: With dead ends: 74 [2019-01-20 10:00:50,969 INFO L226 Difference]: Without dead ends: 72 [2019-01-20 10:00:50,970 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2019-01-20 10:00:50,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-01-20 10:00:50,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-01-20 10:00:50,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-01-20 10:00:50,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-01-20 10:00:50,972 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2019-01-20 10:00:50,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:00:50,972 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-01-20 10:00:50,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-01-20 10:00:50,973 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-01-20 10:00:50,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-01-20 10:00:50,973 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:00:50,973 INFO L402 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2019-01-20 10:00:50,973 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:00:50,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:00:50,973 INFO L82 PathProgramCache]: Analyzing trace with hash -2078725309, now seen corresponding path program 68 times [2019-01-20 10:00:50,974 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:00:50,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:00:50,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:00:50,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:00:50,974 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:00:50,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:00:52,688 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-20 10:00:52,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:00:52,689 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:00:52,689 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:00:52,689 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:00:52,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:00:52,689 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:00:52,698 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:00:52,698 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:00:53,150 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2019-01-20 10:00:53,150 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:00:53,154 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:00:53,165 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-20 10:00:53,165 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:00:59,096 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-20 10:00:59,116 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:00:59,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 139 [2019-01-20 10:00:59,117 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:00:59,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-01-20 10:00:59,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-01-20 10:00:59,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2019-01-20 10:00:59,118 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 71 states. [2019-01-20 10:00:59,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:00:59,323 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-01-20 10:00:59,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-01-20 10:00:59,323 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2019-01-20 10:00:59,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:00:59,324 INFO L225 Difference]: With dead ends: 75 [2019-01-20 10:00:59,324 INFO L226 Difference]: Without dead ends: 73 [2019-01-20 10:00:59,325 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2019-01-20 10:00:59,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-01-20 10:00:59,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-01-20 10:00:59,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-20 10:00:59,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-01-20 10:00:59,326 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2019-01-20 10:00:59,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:00:59,327 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-01-20 10:00:59,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-01-20 10:00:59,327 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-01-20 10:00:59,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-01-20 10:00:59,327 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:00:59,328 INFO L402 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2019-01-20 10:00:59,328 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:00:59,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:00:59,328 INFO L82 PathProgramCache]: Analyzing trace with hash -15973332, now seen corresponding path program 69 times [2019-01-20 10:00:59,328 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:00:59,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:00:59,329 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:00:59,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:00:59,329 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:00:59,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:01:01,088 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-20 10:01:01,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:01:01,088 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:01:01,089 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:01:01,089 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:01:01,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:01:01,089 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:01:01,098 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:01:01,098 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:01:01,154 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:01:01,154 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:01:01,157 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:01:01,168 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-20 10:01:01,168 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:01:07,051 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-20 10:01:07,069 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:01:07,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 141 [2019-01-20 10:01:07,069 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:01:07,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-01-20 10:01:07,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-01-20 10:01:07,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2019-01-20 10:01:07,071 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 72 states. [2019-01-20 10:01:07,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:01:07,267 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-01-20 10:01:07,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-01-20 10:01:07,268 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2019-01-20 10:01:07,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:01:07,269 INFO L225 Difference]: With dead ends: 76 [2019-01-20 10:01:07,269 INFO L226 Difference]: Without dead ends: 74 [2019-01-20 10:01:07,269 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2019-01-20 10:01:07,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-01-20 10:01:07,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-01-20 10:01:07,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-01-20 10:01:07,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-01-20 10:01:07,271 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2019-01-20 10:01:07,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:01:07,272 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-01-20 10:01:07,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-01-20 10:01:07,272 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-01-20 10:01:07,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-01-20 10:01:07,273 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:01:07,273 INFO L402 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2019-01-20 10:01:07,273 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:01:07,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:01:07,274 INFO L82 PathProgramCache]: Analyzing trace with hash -495171485, now seen corresponding path program 70 times [2019-01-20 10:01:07,274 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:01:07,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:07,274 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:01:07,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:07,275 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:01:07,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:01:09,417 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-20 10:01:09,417 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:01:09,417 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:01:09,418 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:01:09,418 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:01:09,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:01:09,418 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:01:09,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:01:09,426 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:01:09,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:01:09,469 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:01:09,485 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-20 10:01:09,485 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:01:15,728 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-20 10:01:15,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:01:15,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 143 [2019-01-20 10:01:15,746 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:01:15,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-01-20 10:01:15,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-01-20 10:01:15,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2019-01-20 10:01:15,748 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 73 states. [2019-01-20 10:01:15,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:01:15,935 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-01-20 10:01:15,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-01-20 10:01:15,935 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2019-01-20 10:01:15,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:01:15,936 INFO L225 Difference]: With dead ends: 77 [2019-01-20 10:01:15,936 INFO L226 Difference]: Without dead ends: 75 [2019-01-20 10:01:15,937 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2019-01-20 10:01:15,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-01-20 10:01:15,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-01-20 10:01:15,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-01-20 10:01:15,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-01-20 10:01:15,940 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2019-01-20 10:01:15,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:01:15,941 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-01-20 10:01:15,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-01-20 10:01:15,941 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-01-20 10:01:15,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-01-20 10:01:15,941 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:01:15,942 INFO L402 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2019-01-20 10:01:15,942 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:01:15,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:01:15,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1829554956, now seen corresponding path program 71 times [2019-01-20 10:01:15,942 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:01:15,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:15,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:01:15,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:15,943 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:01:15,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:01:18,113 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-20 10:01:18,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:01:18,113 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:01:18,113 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:01:18,113 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:01:18,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:01:18,114 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:01:18,121 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:01:18,121 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:01:18,658 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 37 check-sat command(s) [2019-01-20 10:01:18,658 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:01:18,663 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:01:18,676 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-20 10:01:18,676 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:01:25,041 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-20 10:01:25,062 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:01:25,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 145 [2019-01-20 10:01:25,063 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:01:25,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-01-20 10:01:25,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-01-20 10:01:25,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2019-01-20 10:01:25,064 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 74 states. [2019-01-20 10:01:25,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:01:25,209 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-01-20 10:01:25,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-01-20 10:01:25,209 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2019-01-20 10:01:25,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:01:25,210 INFO L225 Difference]: With dead ends: 78 [2019-01-20 10:01:25,210 INFO L226 Difference]: Without dead ends: 76 [2019-01-20 10:01:25,211 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2019-01-20 10:01:25,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-01-20 10:01:25,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-01-20 10:01:25,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-01-20 10:01:25,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-01-20 10:01:25,214 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2019-01-20 10:01:25,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:01:25,214 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-01-20 10:01:25,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-01-20 10:01:25,214 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-01-20 10:01:25,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-01-20 10:01:25,215 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:01:25,215 INFO L402 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2019-01-20 10:01:25,215 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:01:25,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:01:25,216 INFO L82 PathProgramCache]: Analyzing trace with hash 881630595, now seen corresponding path program 72 times [2019-01-20 10:01:25,216 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:01:25,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:25,216 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:01:25,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:25,217 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:01:25,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:01:27,154 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-20 10:01:27,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:01:27,154 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:01:27,155 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:01:27,155 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:01:27,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:01:27,155 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:01:27,162 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:01:27,163 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:01:27,208 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:01:27,208 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:01:27,210 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:01:27,228 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-20 10:01:27,228 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:01:33,696 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-20 10:01:33,714 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:01:33,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 147 [2019-01-20 10:01:33,714 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:01:33,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-01-20 10:01:33,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-01-20 10:01:33,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2019-01-20 10:01:33,716 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 75 states. [2019-01-20 10:01:33,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:01:33,880 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-01-20 10:01:33,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-01-20 10:01:33,880 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2019-01-20 10:01:33,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:01:33,881 INFO L225 Difference]: With dead ends: 79 [2019-01-20 10:01:33,881 INFO L226 Difference]: Without dead ends: 77 [2019-01-20 10:01:33,882 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2019-01-20 10:01:33,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-01-20 10:01:33,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-01-20 10:01:33,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-20 10:01:33,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-01-20 10:01:33,884 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2019-01-20 10:01:33,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:01:33,884 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-01-20 10:01:33,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-01-20 10:01:33,885 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-01-20 10:01:33,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-01-20 10:01:33,885 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:01:33,886 INFO L402 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2019-01-20 10:01:33,886 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:01:33,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:01:33,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1560746476, now seen corresponding path program 73 times [2019-01-20 10:01:33,886 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:01:33,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:33,887 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:01:33,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:33,887 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:01:33,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:01:36,064 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-20 10:01:36,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:01:36,064 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:01:36,064 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:01:36,065 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:01:36,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:01:36,065 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:01:36,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:01:36,084 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:01:36,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:01:36,129 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:01:36,143 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-20 10:01:36,143 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:01:42,570 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-20 10:01:42,589 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:01:42,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 149 [2019-01-20 10:01:42,589 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:01:42,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-01-20 10:01:42,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-01-20 10:01:42,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2019-01-20 10:01:42,591 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 76 states. [2019-01-20 10:01:42,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:01:42,744 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-01-20 10:01:42,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-01-20 10:01:42,744 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2019-01-20 10:01:42,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:01:42,745 INFO L225 Difference]: With dead ends: 80 [2019-01-20 10:01:42,745 INFO L226 Difference]: Without dead ends: 78 [2019-01-20 10:01:42,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2019-01-20 10:01:42,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-01-20 10:01:42,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-01-20 10:01:42,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-01-20 10:01:42,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-01-20 10:01:42,747 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2019-01-20 10:01:42,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:01:42,748 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-01-20 10:01:42,748 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-01-20 10:01:42,748 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-01-20 10:01:42,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-01-20 10:01:42,748 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:01:42,748 INFO L402 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2019-01-20 10:01:42,749 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:01:42,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:01:42,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1138502307, now seen corresponding path program 74 times [2019-01-20 10:01:42,749 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:01:42,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:42,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:01:42,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:42,750 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:01:42,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:01:45,017 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-20 10:01:45,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:01:45,017 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:01:45,017 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:01:45,017 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:01:45,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:01:45,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 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:01:45,026 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:01:45,026 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:01:45,624 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2019-01-20 10:01:45,625 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:01:45,631 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:01:45,647 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-20 10:01:45,647 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:01:52,506 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-20 10:01:52,525 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:01:52,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 151 [2019-01-20 10:01:52,526 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:01:52,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-01-20 10:01:52,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-01-20 10:01:52,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2019-01-20 10:01:52,527 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 77 states. [2019-01-20 10:01:52,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:01:52,637 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-01-20 10:01:52,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-01-20 10:01:52,638 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2019-01-20 10:01:52,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:01:52,638 INFO L225 Difference]: With dead ends: 81 [2019-01-20 10:01:52,638 INFO L226 Difference]: Without dead ends: 79 [2019-01-20 10:01:52,639 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2019-01-20 10:01:52,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-01-20 10:01:52,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-01-20 10:01:52,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-01-20 10:01:52,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-01-20 10:01:52,642 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2019-01-20 10:01:52,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:01:52,643 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-01-20 10:01:52,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-01-20 10:01:52,643 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-01-20 10:01:52,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-01-20 10:01:52,643 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:01:52,643 INFO L402 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2019-01-20 10:01:52,644 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:01:52,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:01:52,644 INFO L82 PathProgramCache]: Analyzing trace with hash 933834956, now seen corresponding path program 75 times [2019-01-20 10:01:52,644 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:01:52,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:52,645 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:01:52,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:52,645 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:01:52,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:01:54,687 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-20 10:01:54,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:01:54,687 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:01:54,687 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:01:54,687 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:01:54,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:01:54,688 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:01:54,695 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:01:54,695 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:01:54,742 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:01:54,742 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:01:54,745 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:01:54,763 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-20 10:01:54,764 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:02:02,115 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-20 10:02:02,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:02:02,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 153 [2019-01-20 10:02:02,133 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:02:02,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-01-20 10:02:02,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-01-20 10:02:02,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2019-01-20 10:02:02,135 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 78 states. [2019-01-20 10:02:02,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:02:02,247 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-01-20 10:02:02,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-01-20 10:02:02,247 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2019-01-20 10:02:02,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:02:02,248 INFO L225 Difference]: With dead ends: 82 [2019-01-20 10:02:02,248 INFO L226 Difference]: Without dead ends: 80 [2019-01-20 10:02:02,249 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2019-01-20 10:02:02,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-01-20 10:02:02,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-01-20 10:02:02,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-01-20 10:02:02,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-01-20 10:02:02,253 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2019-01-20 10:02:02,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:02:02,253 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-01-20 10:02:02,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-01-20 10:02:02,253 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-01-20 10:02:02,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-01-20 10:02:02,254 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:02:02,254 INFO L402 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2019-01-20 10:02:02,254 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:02:02,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:02,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1115885629, now seen corresponding path program 76 times [2019-01-20 10:02:02,254 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:02:02,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:02,255 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:02:02,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:02,255 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:02:02,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:04,369 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-20 10:02:04,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:04,369 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:02:04,369 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:02:04,369 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:02:04,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:04,369 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:02:04,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:02:04,379 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:02:04,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:04,428 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:02:04,447 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-20 10:02:04,448 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:02:12,354 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-20 10:02:12,373 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:02:12,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 155 [2019-01-20 10:02:12,373 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:02:12,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-01-20 10:02:12,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-01-20 10:02:12,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2019-01-20 10:02:12,375 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 79 states. [2019-01-20 10:02:13,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:02:13,162 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-01-20 10:02:13,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-01-20 10:02:13,163 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 79 [2019-01-20 10:02:13,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:02:13,163 INFO L225 Difference]: With dead ends: 83 [2019-01-20 10:02:13,163 INFO L226 Difference]: Without dead ends: 81 [2019-01-20 10:02:13,164 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2019-01-20 10:02:13,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-01-20 10:02:13,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-01-20 10:02:13,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-01-20 10:02:13,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-01-20 10:02:13,168 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2019-01-20 10:02:13,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:02:13,169 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-01-20 10:02:13,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-01-20 10:02:13,169 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-01-20 10:02:13,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-01-20 10:02:13,169 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:02:13,169 INFO L402 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2019-01-20 10:02:13,170 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:02:13,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:13,170 INFO L82 PathProgramCache]: Analyzing trace with hash -232714324, now seen corresponding path program 77 times [2019-01-20 10:02:13,170 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:02:13,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:13,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:02:13,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:13,171 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:02:13,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:15,345 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-20 10:02:15,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:15,346 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:02:15,346 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:02:15,346 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:02:15,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:15,346 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:02:15,354 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:02:15,354 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:02:16,070 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2019-01-20 10:02:16,071 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:02:16,077 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:02:16,096 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-20 10:02:16,096 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:02:23,660 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-20 10:02:23,681 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:02:23,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 157 [2019-01-20 10:02:23,681 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:02:23,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-01-20 10:02:23,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-01-20 10:02:23,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2019-01-20 10:02:23,683 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 80 states. [2019-01-20 10:02:24,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:02:24,298 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-01-20 10:02:24,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-01-20 10:02:24,299 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 80 [2019-01-20 10:02:24,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:02:24,299 INFO L225 Difference]: With dead ends: 84 [2019-01-20 10:02:24,299 INFO L226 Difference]: Without dead ends: 82 [2019-01-20 10:02:24,300 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2019-01-20 10:02:24,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-01-20 10:02:24,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-01-20 10:02:24,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-01-20 10:02:24,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-01-20 10:02:24,303 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2019-01-20 10:02:24,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:02:24,303 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-01-20 10:02:24,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-01-20 10:02:24,303 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-01-20 10:02:24,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-01-20 10:02:24,303 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:02:24,304 INFO L402 BasicCegarLoop]: trace histogram [78, 1, 1, 1] [2019-01-20 10:02:24,304 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:02:24,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:24,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1375792355, now seen corresponding path program 78 times [2019-01-20 10:02:24,304 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:02:24,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:24,305 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:02:24,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:24,305 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:02:24,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:26,740 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-20 10:02:26,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:26,741 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:02:26,741 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:02:26,741 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:02:26,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:26,741 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:02:26,749 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:02:26,749 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:02:26,808 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:02:26,808 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:02:26,812 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:02:26,842 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-20 10:02:26,843 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:02:34,718 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-20 10:02:34,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:02:34,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 159 [2019-01-20 10:02:34,737 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:02:34,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-01-20 10:02:34,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-01-20 10:02:34,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2019-01-20 10:02:34,739 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 81 states. [2019-01-20 10:02:34,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:02:34,888 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2019-01-20 10:02:34,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-01-20 10:02:34,888 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 81 [2019-01-20 10:02:34,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:02:34,889 INFO L225 Difference]: With dead ends: 85 [2019-01-20 10:02:34,889 INFO L226 Difference]: Without dead ends: 83 [2019-01-20 10:02:34,890 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2019-01-20 10:02:34,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-01-20 10:02:34,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-01-20 10:02:34,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-01-20 10:02:34,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2019-01-20 10:02:34,893 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2019-01-20 10:02:34,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:02:34,893 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2019-01-20 10:02:34,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-01-20 10:02:34,893 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2019-01-20 10:02:34,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-01-20 10:02:34,894 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:02:34,894 INFO L402 BasicCegarLoop]: trace histogram [79, 1, 1, 1] [2019-01-20 10:02:34,894 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:02:34,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:34,894 INFO L82 PathProgramCache]: Analyzing trace with hash -300108148, now seen corresponding path program 79 times [2019-01-20 10:02:34,894 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:02:34,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:34,895 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:02:34,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:34,895 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:02:34,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:37,496 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-20 10:02:37,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:37,497 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:02:37,497 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:02:37,497 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:02:37,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:37,497 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:02:37,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:02:37,506 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:02:37,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:37,554 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:02:37,572 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-20 10:02:37,572 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:02:45,277 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-20 10:02:45,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:02:45,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 161 [2019-01-20 10:02:45,295 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:02:45,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-01-20 10:02:45,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-01-20 10:02:45,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2019-01-20 10:02:45,297 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 82 states. [2019-01-20 10:02:45,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:02:45,409 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2019-01-20 10:02:45,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-01-20 10:02:45,410 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 82 [2019-01-20 10:02:45,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:02:45,411 INFO L225 Difference]: With dead ends: 86 [2019-01-20 10:02:45,411 INFO L226 Difference]: Without dead ends: 84 [2019-01-20 10:02:45,413 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2019-01-20 10:02:45,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-01-20 10:02:45,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-01-20 10:02:45,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-01-20 10:02:45,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2019-01-20 10:02:45,415 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2019-01-20 10:02:45,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:02:45,415 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2019-01-20 10:02:45,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-01-20 10:02:45,415 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2019-01-20 10:02:45,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-01-20 10:02:45,416 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:02:45,416 INFO L402 BasicCegarLoop]: trace histogram [80, 1, 1, 1] [2019-01-20 10:02:45,416 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:02:45,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:45,416 INFO L82 PathProgramCache]: Analyzing trace with hash -713416189, now seen corresponding path program 80 times [2019-01-20 10:02:45,416 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:02:45,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:45,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:02:45,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:45,417 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:02:45,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:48,001 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-20 10:02:48,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:48,001 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:02:48,001 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:02:48,001 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:02:48,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:48,001 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:02:48,010 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:02:48,011 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:02:48,797 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 41 check-sat command(s) [2019-01-20 10:02:48,798 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:02:48,802 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:02:48,822 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-20 10:02:48,822 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:02:56,866 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-20 10:02:56,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:02:56,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 163 [2019-01-20 10:02:56,886 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:02:56,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-01-20 10:02:56,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-01-20 10:02:56,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2019-01-20 10:02:56,888 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 83 states. [2019-01-20 10:02:57,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:02:57,080 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2019-01-20 10:02:57,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-01-20 10:02:57,081 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 83 [2019-01-20 10:02:57,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:02:57,081 INFO L225 Difference]: With dead ends: 87 [2019-01-20 10:02:57,081 INFO L226 Difference]: Without dead ends: 85 [2019-01-20 10:02:57,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2019-01-20 10:02:57,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-20 10:02:57,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-01-20 10:02:57,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-01-20 10:02:57,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-01-20 10:02:57,084 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2019-01-20 10:02:57,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:02:57,084 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-01-20 10:02:57,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-01-20 10:02:57,084 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-01-20 10:02:57,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-01-20 10:02:57,085 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:02:57,085 INFO L402 BasicCegarLoop]: trace histogram [81, 1, 1, 1] [2019-01-20 10:02:57,085 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:02:57,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:57,085 INFO L82 PathProgramCache]: Analyzing trace with hash -641063572, now seen corresponding path program 81 times [2019-01-20 10:02:57,085 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:02:57,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:57,086 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:02:57,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:57,086 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:02:57,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:59,891 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-20 10:02:59,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:59,892 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:02:59,892 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:02:59,892 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:02:59,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:59,892 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:02:59,900 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:02:59,901 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:02:59,951 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:02:59,951 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:02:59,954 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:02:59,966 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-20 10:02:59,966 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:03:08,213 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-20 10:03:08,233 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:03:08,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 165 [2019-01-20 10:03:08,234 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:03:08,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-01-20 10:03:08,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-01-20 10:03:08,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2019-01-20 10:03:08,235 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 84 states. [2019-01-20 10:03:08,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:03:08,409 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2019-01-20 10:03:08,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-01-20 10:03:08,410 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 84 [2019-01-20 10:03:08,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:03:08,410 INFO L225 Difference]: With dead ends: 88 [2019-01-20 10:03:08,410 INFO L226 Difference]: Without dead ends: 86 [2019-01-20 10:03:08,411 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2019-01-20 10:03:08,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-01-20 10:03:08,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-01-20 10:03:08,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-01-20 10:03:08,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2019-01-20 10:03:08,413 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 84 [2019-01-20 10:03:08,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:03:08,413 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2019-01-20 10:03:08,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-01-20 10:03:08,413 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2019-01-20 10:03:08,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-01-20 10:03:08,414 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:03:08,414 INFO L402 BasicCegarLoop]: trace histogram [82, 1, 1, 1] [2019-01-20 10:03:08,414 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:03:08,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:03:08,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1601867555, now seen corresponding path program 82 times [2019-01-20 10:03:08,414 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:03:08,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:03:08,415 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:03:08,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:03:08,415 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:03:08,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:03:11,012 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-20 10:03:11,013 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:03:11,013 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:03:11,013 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:03:11,013 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:03:11,013 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:03:11,013 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:03:11,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:03:11,022 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:03:11,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:03:11,074 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:03:11,094 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-20 10:03:11,094 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:03:19,750 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-20 10:03:19,768 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:03:19,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 167 [2019-01-20 10:03:19,768 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:03:19,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-01-20 10:03:19,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-01-20 10:03:19,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2019-01-20 10:03:19,770 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 85 states. [2019-01-20 10:03:19,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:03:19,912 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2019-01-20 10:03:19,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-01-20 10:03:19,912 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 85 [2019-01-20 10:03:19,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:03:19,912 INFO L225 Difference]: With dead ends: 89 [2019-01-20 10:03:19,912 INFO L226 Difference]: Without dead ends: 87 [2019-01-20 10:03:19,913 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2019-01-20 10:03:19,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-01-20 10:03:19,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-01-20 10:03:19,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-01-20 10:03:19,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2019-01-20 10:03:19,916 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 85 [2019-01-20 10:03:19,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:03:19,917 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2019-01-20 10:03:19,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-01-20 10:03:19,917 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2019-01-20 10:03:19,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-01-20 10:03:19,917 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:03:19,918 INFO L402 BasicCegarLoop]: trace histogram [83, 1, 1, 1] [2019-01-20 10:03:19,918 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:03:19,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:03:19,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1881711540, now seen corresponding path program 83 times [2019-01-20 10:03:19,918 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:03:19,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:03:19,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:03:19,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:03:19,919 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:03:19,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:03:22,804 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-20 10:03:22,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:03:22,805 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:03:22,805 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:03:22,805 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:03:22,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:03:22,805 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:03:22,813 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:03:22,813 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:03:23,744 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 43 check-sat command(s) [2019-01-20 10:03:23,745 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:03:23,752 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:03:23,765 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-20 10:03:23,765 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:03:32,406 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-20 10:03:32,427 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:03:32,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 169 [2019-01-20 10:03:32,427 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:03:32,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-01-20 10:03:32,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-01-20 10:03:32,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2019-01-20 10:03:32,430 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 86 states. [2019-01-20 10:03:32,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:03:32,637 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-01-20 10:03:32,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-01-20 10:03:32,638 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 86 [2019-01-20 10:03:32,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:03:32,638 INFO L225 Difference]: With dead ends: 90 [2019-01-20 10:03:32,638 INFO L226 Difference]: Without dead ends: 88 [2019-01-20 10:03:32,639 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2019-01-20 10:03:32,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-01-20 10:03:32,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-01-20 10:03:32,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-01-20 10:03:32,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2019-01-20 10:03:32,641 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 86 [2019-01-20 10:03:32,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:03:32,641 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2019-01-20 10:03:32,641 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-01-20 10:03:32,641 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2019-01-20 10:03:32,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-01-20 10:03:32,642 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:03:32,642 INFO L402 BasicCegarLoop]: trace histogram [84, 1, 1, 1] [2019-01-20 10:03:32,642 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:03:32,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:03:32,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1796486211, now seen corresponding path program 84 times [2019-01-20 10:03:32,642 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:03:32,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:03:32,643 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:03:32,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:03:32,643 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:03:32,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:03:35,172 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-20 10:03:35,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:03:35,173 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:03:35,173 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:03:35,173 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:03:35,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:03:35,173 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:03:35,182 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:03:35,182 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:03:35,233 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:03:35,234 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:03:35,236 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:03:35,250 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-20 10:03:35,250 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:03:44,291 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-20 10:03:44,308 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:03:44,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 171 [2019-01-20 10:03:44,309 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:03:44,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-01-20 10:03:44,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-01-20 10:03:44,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2019-01-20 10:03:44,311 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 87 states. [2019-01-20 10:03:44,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:03:44,475 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2019-01-20 10:03:44,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-01-20 10:03:44,475 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 87 [2019-01-20 10:03:44,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:03:44,476 INFO L225 Difference]: With dead ends: 91 [2019-01-20 10:03:44,476 INFO L226 Difference]: Without dead ends: 89 [2019-01-20 10:03:44,476 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2019-01-20 10:03:44,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-01-20 10:03:44,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-01-20 10:03:44,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-01-20 10:03:44,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2019-01-20 10:03:44,479 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 87 [2019-01-20 10:03:44,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:03:44,479 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2019-01-20 10:03:44,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-01-20 10:03:44,480 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2019-01-20 10:03:44,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-01-20 10:03:44,480 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:03:44,480 INFO L402 BasicCegarLoop]: trace histogram [85, 1, 1, 1] [2019-01-20 10:03:44,481 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:03:44,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:03:44,481 INFO L82 PathProgramCache]: Analyzing trace with hash -143500500, now seen corresponding path program 85 times [2019-01-20 10:03:44,481 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:03:44,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:03:44,482 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:03:44,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:03:44,482 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:03:44,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:03:47,087 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-20 10:03:47,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:03:47,087 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:03:47,087 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:03:47,087 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:03:47,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:03:47,088 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:03:47,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:03:47,098 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:03:47,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:03:47,150 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:03:47,163 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-20 10:03:47,163 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:03:56,251 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-20 10:03:56,270 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:03:56,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 173 [2019-01-20 10:03:56,270 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:03:56,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-01-20 10:03:56,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-01-20 10:03:56,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2019-01-20 10:03:56,273 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 88 states. [2019-01-20 10:03:56,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:03:56,613 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2019-01-20 10:03:56,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-01-20 10:03:56,613 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 88 [2019-01-20 10:03:56,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:03:56,614 INFO L225 Difference]: With dead ends: 92 [2019-01-20 10:03:56,614 INFO L226 Difference]: Without dead ends: 90 [2019-01-20 10:03:56,615 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2019-01-20 10:03:56,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-01-20 10:03:56,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-01-20 10:03:56,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-01-20 10:03:56,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2019-01-20 10:03:56,618 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 88 [2019-01-20 10:03:56,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:03:56,619 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2019-01-20 10:03:56,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-01-20 10:03:56,619 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2019-01-20 10:03:56,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-01-20 10:03:56,619 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:03:56,619 INFO L402 BasicCegarLoop]: trace histogram [86, 1, 1, 1] [2019-01-20 10:03:56,620 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:03:56,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:03:56,620 INFO L82 PathProgramCache]: Analyzing trace with hash -153546397, now seen corresponding path program 86 times [2019-01-20 10:03:56,620 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:03:56,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:03:56,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:03:56,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:03:56,621 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:03:56,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:03:59,495 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-20 10:03:59,495 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:03:59,495 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:03:59,495 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:03:59,495 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:03:59,495 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:03:59,495 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:03:59,504 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:03:59,504 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:04:00,517 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) [2019-01-20 10:04:00,518 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:04:00,523 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:04:00,535 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-20 10:04:00,536 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:04:10,060 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-20 10:04:10,079 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:04:10,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 175 [2019-01-20 10:04:10,080 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:04:10,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-01-20 10:04:10,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-01-20 10:04:10,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2019-01-20 10:04:10,082 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 89 states. [2019-01-20 10:04:10,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:04:10,311 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2019-01-20 10:04:10,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-01-20 10:04:10,311 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 89 [2019-01-20 10:04:10,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:04:10,312 INFO L225 Difference]: With dead ends: 93 [2019-01-20 10:04:10,312 INFO L226 Difference]: Without dead ends: 91 [2019-01-20 10:04:10,313 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2019-01-20 10:04:10,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-01-20 10:04:10,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-01-20 10:04:10,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-01-20 10:04:10,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2019-01-20 10:04:10,315 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 89 [2019-01-20 10:04:10,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:04:10,315 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2019-01-20 10:04:10,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-01-20 10:04:10,315 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2019-01-20 10:04:10,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-01-20 10:04:10,316 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:04:10,316 INFO L402 BasicCegarLoop]: trace histogram [87, 1, 1, 1] [2019-01-20 10:04:10,316 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:04:10,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:04:10,317 INFO L82 PathProgramCache]: Analyzing trace with hash -464969204, now seen corresponding path program 87 times [2019-01-20 10:04:10,317 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:04:10,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:04:10,318 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:04:10,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:04:10,318 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:04:10,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:04:13,074 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-20 10:04:13,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:04:13,075 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:04:13,075 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:04:13,075 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:04:13,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:04:13,075 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:04:13,083 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:04:13,083 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:04:13,137 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:04:13,138 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:04:13,141 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:04:13,155 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-20 10:04:13,155 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:04:22,427 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-20 10:04:22,447 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:04:22,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 177 [2019-01-20 10:04:22,447 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:04:22,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-01-20 10:04:22,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-01-20 10:04:22,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2019-01-20 10:04:22,449 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 90 states. [2019-01-20 10:04:22,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:04:22,588 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2019-01-20 10:04:22,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-01-20 10:04:22,589 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 90 [2019-01-20 10:04:22,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:04:22,589 INFO L225 Difference]: With dead ends: 94 [2019-01-20 10:04:22,590 INFO L226 Difference]: Without dead ends: 92 [2019-01-20 10:04:22,590 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2019-01-20 10:04:22,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-01-20 10:04:22,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-01-20 10:04:22,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-01-20 10:04:22,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2019-01-20 10:04:22,593 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 90 [2019-01-20 10:04:22,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:04:22,593 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2019-01-20 10:04:22,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-01-20 10:04:22,593 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2019-01-20 10:04:22,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-20 10:04:22,593 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:04:22,593 INFO L402 BasicCegarLoop]: trace histogram [88, 1, 1, 1] [2019-01-20 10:04:22,594 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:04:22,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:04:22,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1529141629, now seen corresponding path program 88 times [2019-01-20 10:04:22,594 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:04:22,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:04:22,594 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:04:22,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:04:22,595 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:04:22,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:04:25,842 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-20 10:04:25,843 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:04:25,843 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:04:25,843 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:04:25,843 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:04:25,843 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:04:25,843 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:04:25,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:04:25,852 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:04:25,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:04:25,908 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:04:25,923 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-20 10:04:25,923 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:04:35,560 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-20 10:04:35,578 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:04:35,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90, 90] total 179 [2019-01-20 10:04:35,578 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:04:35,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-01-20 10:04:35,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-01-20 10:04:35,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2019-01-20 10:04:35,580 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 91 states. [2019-01-20 10:04:35,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:04:35,785 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2019-01-20 10:04:35,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-01-20 10:04:35,786 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 91 [2019-01-20 10:04:35,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:04:35,786 INFO L225 Difference]: With dead ends: 95 [2019-01-20 10:04:35,786 INFO L226 Difference]: Without dead ends: 93 [2019-01-20 10:04:35,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2019-01-20 10:04:35,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-01-20 10:04:35,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-01-20 10:04:35,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-01-20 10:04:35,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2019-01-20 10:04:35,790 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 91 [2019-01-20 10:04:35,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:04:35,790 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2019-01-20 10:04:35,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-01-20 10:04:35,791 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2019-01-20 10:04:35,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-20 10:04:35,791 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:04:35,791 INFO L402 BasicCegarLoop]: trace histogram [89, 1, 1, 1] [2019-01-20 10:04:35,791 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:04:35,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:04:35,792 INFO L82 PathProgramCache]: Analyzing trace with hash -158748436, now seen corresponding path program 89 times [2019-01-20 10:04:35,792 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:04:35,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:04:35,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:04:35,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:04:35,793 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:04:35,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:04:38,669 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-20 10:04:38,669 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:04:38,669 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:04:38,669 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:04:38,670 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:04:38,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:04:38,670 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:04:38,677 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:04:38,678 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:04:39,871 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2019-01-20 10:04:39,871 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:04:39,877 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:04:39,890 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-20 10:04:39,890 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:04:49,691 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-20 10:04:49,712 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:04:49,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 181 [2019-01-20 10:04:49,712 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:04:49,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-01-20 10:04:49,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-01-20 10:04:49,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2019-01-20 10:04:49,714 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 92 states. [2019-01-20 10:04:49,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:04:49,851 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2019-01-20 10:04:49,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-01-20 10:04:49,854 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 92 [2019-01-20 10:04:49,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:04:49,855 INFO L225 Difference]: With dead ends: 96 [2019-01-20 10:04:49,855 INFO L226 Difference]: Without dead ends: 94 [2019-01-20 10:04:49,856 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2019-01-20 10:04:49,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-01-20 10:04:49,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2019-01-20 10:04:49,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-01-20 10:04:49,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2019-01-20 10:04:49,859 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 92 [2019-01-20 10:04:49,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:04:49,859 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2019-01-20 10:04:49,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-01-20 10:04:49,859 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2019-01-20 10:04:49,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-20 10:04:49,860 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:04:49,860 INFO L402 BasicCegarLoop]: trace histogram [90, 1, 1, 1] [2019-01-20 10:04:49,860 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:04:49,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:04:49,861 INFO L82 PathProgramCache]: Analyzing trace with hash -626232413, now seen corresponding path program 90 times [2019-01-20 10:04:49,861 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:04:49,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:04:49,861 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:04:49,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:04:49,861 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:04:49,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:04:52,798 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-20 10:04:52,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:04:52,799 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:04:52,799 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:04:52,799 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:04:52,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:04:52,799 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:04:52,808 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:04:52,809 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:04:52,863 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:04:52,863 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:04:52,866 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:04:52,880 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-20 10:04:52,880 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:05:02,831 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-20 10:05:02,849 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:05:02,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92, 92] total 183 [2019-01-20 10:05:02,849 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:05:02,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-01-20 10:05:02,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-01-20 10:05:02,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2019-01-20 10:05:02,852 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 93 states. [2019-01-20 10:05:03,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:05:03,092 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2019-01-20 10:05:03,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-01-20 10:05:03,092 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 93 [2019-01-20 10:05:03,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:05:03,093 INFO L225 Difference]: With dead ends: 97 [2019-01-20 10:05:03,093 INFO L226 Difference]: Without dead ends: 95 [2019-01-20 10:05:03,094 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2019-01-20 10:05:03,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-01-20 10:05:03,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-01-20 10:05:03,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-01-20 10:05:03,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2019-01-20 10:05:03,096 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 93 [2019-01-20 10:05:03,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:05:03,096 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2019-01-20 10:05:03,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-01-20 10:05:03,096 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2019-01-20 10:05:03,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-20 10:05:03,096 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:05:03,096 INFO L402 BasicCegarLoop]: trace histogram [91, 1, 1, 1] [2019-01-20 10:05:03,097 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:05:03,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:03,097 INFO L82 PathProgramCache]: Analyzing trace with hash 2061633484, now seen corresponding path program 91 times [2019-01-20 10:05:03,097 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:05:03,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:03,098 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:05:03,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:03,098 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:05:03,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:06,398 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-20 10:05:06,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:06,398 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:05:06,398 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:05:06,398 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:05:06,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:06,398 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:05:06,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:05:06,408 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:05:06,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:06,466 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:05:06,481 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-20 10:05:06,481 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:05:16,855 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-20 10:05:16,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:05:16,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 185 [2019-01-20 10:05:16,874 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:05:16,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-01-20 10:05:16,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-01-20 10:05:16,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2019-01-20 10:05:16,876 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 94 states. [2019-01-20 10:05:17,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:05:17,076 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2019-01-20 10:05:17,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-01-20 10:05:17,077 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 94 [2019-01-20 10:05:17,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:05:17,077 INFO L225 Difference]: With dead ends: 98 [2019-01-20 10:05:17,077 INFO L226 Difference]: Without dead ends: 96 [2019-01-20 10:05:17,078 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2019-01-20 10:05:17,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-01-20 10:05:17,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-01-20 10:05:17,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-01-20 10:05:17,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2019-01-20 10:05:17,080 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 94 [2019-01-20 10:05:17,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:05:17,080 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2019-01-20 10:05:17,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-01-20 10:05:17,080 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2019-01-20 10:05:17,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-20 10:05:17,081 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:05:17,081 INFO L402 BasicCegarLoop]: trace histogram [92, 1, 1, 1] [2019-01-20 10:05:17,081 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:05:17,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:17,081 INFO L82 PathProgramCache]: Analyzing trace with hash -513869629, now seen corresponding path program 92 times [2019-01-20 10:05:17,081 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:05:17,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:17,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:05:17,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:17,082 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:05:17,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:20,537 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-20 10:05:20,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:20,538 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:05:20,538 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:05:20,538 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:05:20,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:20,538 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:05:20,547 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:05:20,547 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:05:21,863 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 47 check-sat command(s) [2019-01-20 10:05:21,863 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:05:21,868 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:05:21,882 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-20 10:05:21,882 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:05:32,505 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-20 10:05:32,527 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:05:32,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94, 94] total 187 [2019-01-20 10:05:32,527 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:05:32,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-01-20 10:05:32,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-01-20 10:05:32,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2019-01-20 10:05:32,529 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 95 states. [2019-01-20 10:05:32,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:05:32,692 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2019-01-20 10:05:32,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-01-20 10:05:32,692 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 95 [2019-01-20 10:05:32,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:05:32,693 INFO L225 Difference]: With dead ends: 99 [2019-01-20 10:05:32,693 INFO L226 Difference]: Without dead ends: 97 [2019-01-20 10:05:32,694 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2019-01-20 10:05:32,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-01-20 10:05:32,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-01-20 10:05:32,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-01-20 10:05:32,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2019-01-20 10:05:32,696 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 95 [2019-01-20 10:05:32,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:05:32,696 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2019-01-20 10:05:32,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-01-20 10:05:32,696 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2019-01-20 10:05:32,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-20 10:05:32,697 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:05:32,697 INFO L402 BasicCegarLoop]: trace histogram [93, 1, 1, 1] [2019-01-20 10:05:32,697 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:05:32,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:32,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1249912492, now seen corresponding path program 93 times [2019-01-20 10:05:32,697 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:05:32,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:32,698 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:05:32,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:32,698 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:05:32,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:36,032 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-20 10:05:36,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:36,032 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:05:36,033 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:05:36,033 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:05:36,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:36,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 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:05:36,041 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:05:36,041 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:05:36,098 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:05:36,098 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:05:36,101 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:05:36,115 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-20 10:05:36,116 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:05:46,900 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-20 10:05:46,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:05:46,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 189 [2019-01-20 10:05:46,918 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:05:46,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-01-20 10:05:46,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-01-20 10:05:46,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2019-01-20 10:05:46,920 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 96 states. [2019-01-20 10:05:47,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:05:47,073 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2019-01-20 10:05:47,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-01-20 10:05:47,073 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 96 [2019-01-20 10:05:47,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:05:47,074 INFO L225 Difference]: With dead ends: 100 [2019-01-20 10:05:47,074 INFO L226 Difference]: Without dead ends: 98 [2019-01-20 10:05:47,076 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2019-01-20 10:05:47,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-01-20 10:05:47,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2019-01-20 10:05:47,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-01-20 10:05:47,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2019-01-20 10:05:47,079 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 96 [2019-01-20 10:05:47,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:05:47,079 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2019-01-20 10:05:47,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-01-20 10:05:47,079 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2019-01-20 10:05:47,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-01-20 10:05:47,080 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:05:47,080 INFO L402 BasicCegarLoop]: trace histogram [94, 1, 1, 1] [2019-01-20 10:05:47,080 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:05:47,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:47,080 INFO L82 PathProgramCache]: Analyzing trace with hash 92583395, now seen corresponding path program 94 times [2019-01-20 10:05:47,081 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:05:47,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:47,081 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:05:47,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:47,081 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:05:47,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:50,255 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:50,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:50,256 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:05:50,256 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:05:50,256 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:05:50,256 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:50,256 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:05:50,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:05:50,278 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:05:50,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:50,336 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:05:50,352 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-20 10:05:50,352 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:06:01,503 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-20 10:06:01,521 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:06:01,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 191 [2019-01-20 10:06:01,521 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:06:01,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-01-20 10:06:01,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-01-20 10:06:01,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2019-01-20 10:06:01,524 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 97 states. [2019-01-20 10:06:01,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:06:01,688 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2019-01-20 10:06:01,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-01-20 10:06:01,689 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 97 [2019-01-20 10:06:01,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:06:01,689 INFO L225 Difference]: With dead ends: 101 [2019-01-20 10:06:01,690 INFO L226 Difference]: Without dead ends: 99 [2019-01-20 10:06:01,691 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2019-01-20 10:06:01,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-01-20 10:06:01,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-01-20 10:06:01,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-01-20 10:06:01,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2019-01-20 10:06:01,694 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 97 [2019-01-20 10:06:01,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:06:01,694 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2019-01-20 10:06:01,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-01-20 10:06:01,694 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2019-01-20 10:06:01,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-20 10:06:01,695 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:06:01,695 INFO L402 BasicCegarLoop]: trace histogram [95, 1, 1, 1] [2019-01-20 10:06:01,695 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:06:01,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:06:01,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1424880244, now seen corresponding path program 95 times [2019-01-20 10:06:01,696 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:06:01,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:01,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:06:01,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:01,696 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:06:01,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:06:05,004 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-20 10:06:05,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:05,004 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:06:05,005 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:06:05,005 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:06:05,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:05,005 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:06:05,013 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:06:05,013 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:06:06,543 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 49 check-sat command(s) [2019-01-20 10:06:06,543 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:06:06,551 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:06:06,565 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-20 10:06:06,566 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:06:17,565 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-20 10:06:17,586 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:06:17,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 193 [2019-01-20 10:06:17,586 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:06:17,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-01-20 10:06:17,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-01-20 10:06:17,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2019-01-20 10:06:17,588 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 98 states. [2019-01-20 10:06:17,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:06:17,748 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2019-01-20 10:06:17,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-01-20 10:06:17,748 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 98 [2019-01-20 10:06:17,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:06:17,749 INFO L225 Difference]: With dead ends: 102 [2019-01-20 10:06:17,749 INFO L226 Difference]: Without dead ends: 100 [2019-01-20 10:06:17,750 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2019-01-20 10:06:17,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-01-20 10:06:17,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-01-20 10:06:17,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-01-20 10:06:17,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2019-01-20 10:06:17,752 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 98 [2019-01-20 10:06:17,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:06:17,752 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2019-01-20 10:06:17,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-01-20 10:06:17,753 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2019-01-20 10:06:17,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-01-20 10:06:17,753 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:06:17,753 INFO L402 BasicCegarLoop]: trace histogram [96, 1, 1, 1] [2019-01-20 10:06:17,754 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:06:17,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:06:17,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1221612797, now seen corresponding path program 96 times [2019-01-20 10:06:17,754 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:06:17,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:17,755 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:06:17,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:17,755 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:06:17,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:06:21,060 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-20 10:06:21,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:21,061 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:06:21,061 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:06:21,061 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:06:21,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:21,061 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:06:21,070 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:06:21,070 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:06:21,134 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:06:21,134 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:06:21,153 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:06:21,170 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-20 10:06:21,170 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:06:32,863 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-20 10:06:32,881 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:06:32,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 195 [2019-01-20 10:06:32,882 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:06:32,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-01-20 10:06:32,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-01-20 10:06:32,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2019-01-20 10:06:32,884 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 99 states. [2019-01-20 10:06:33,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:06:33,103 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2019-01-20 10:06:33,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-01-20 10:06:33,103 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 99 [2019-01-20 10:06:33,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:06:33,104 INFO L225 Difference]: With dead ends: 103 [2019-01-20 10:06:33,104 INFO L226 Difference]: Without dead ends: 101 [2019-01-20 10:06:33,105 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2019-01-20 10:06:33,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-01-20 10:06:33,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-01-20 10:06:33,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-01-20 10:06:33,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2019-01-20 10:06:33,108 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 99 [2019-01-20 10:06:33,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:06:33,108 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2019-01-20 10:06:33,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-01-20 10:06:33,108 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2019-01-20 10:06:33,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-20 10:06:33,108 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:06:33,108 INFO L402 BasicCegarLoop]: trace histogram [97, 1, 1, 1] [2019-01-20 10:06:33,109 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:06:33,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:06:33,109 INFO L82 PathProgramCache]: Analyzing trace with hash 784710764, now seen corresponding path program 97 times [2019-01-20 10:06:33,109 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:06:33,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:33,109 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:06:33,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:33,110 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:06:33,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:06:36,541 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-20 10:06:36,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:36,541 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:06:36,541 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:06:36,541 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:06:36,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:36,542 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:06:36,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:06:36,551 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:06:36,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:06:36,613 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:06:36,628 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-20 10:06:36,629 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:06:48,197 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-20 10:06:48,216 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:06:48,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 197 [2019-01-20 10:06:48,216 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:06:48,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-01-20 10:06:48,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-01-20 10:06:48,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2019-01-20 10:06:48,218 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 100 states. [2019-01-20 10:06:48,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:06:48,522 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2019-01-20 10:06:48,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-01-20 10:06:48,522 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 100 [2019-01-20 10:06:48,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:06:48,523 INFO L225 Difference]: With dead ends: 104 [2019-01-20 10:06:48,523 INFO L226 Difference]: Without dead ends: 102 [2019-01-20 10:06:48,524 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2019-01-20 10:06:48,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-01-20 10:06:48,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-01-20 10:06:48,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-01-20 10:06:48,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2019-01-20 10:06:48,527 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 100 [2019-01-20 10:06:48,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:06:48,527 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2019-01-20 10:06:48,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-01-20 10:06:48,527 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2019-01-20 10:06:48,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-01-20 10:06:48,528 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:06:48,528 INFO L402 BasicCegarLoop]: trace histogram [98, 1, 1, 1] [2019-01-20 10:06:48,528 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:06:48,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:06:48,528 INFO L82 PathProgramCache]: Analyzing trace with hash -1443768285, now seen corresponding path program 98 times [2019-01-20 10:06:48,528 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:06:48,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:48,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:06:48,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:48,529 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:06:48,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:06:52,136 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-20 10:06:52,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:52,136 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:06:52,137 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:06:52,137 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:06:52,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:52,137 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:06:52,145 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:06:52,145 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:06:53,789 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 50 check-sat command(s) [2019-01-20 10:06:53,789 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:06:53,795 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:06:53,810 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-20 10:06:53,811 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:07:05,562 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-20 10:07:05,583 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:07:05,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100, 100] total 199 [2019-01-20 10:07:05,584 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:07:05,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-01-20 10:07:05,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-01-20 10:07:05,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2019-01-20 10:07:05,586 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 101 states. [2019-01-20 10:07:05,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:07:05,830 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2019-01-20 10:07:05,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-01-20 10:07:05,831 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 101 [2019-01-20 10:07:05,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:07:05,831 INFO L225 Difference]: With dead ends: 105 [2019-01-20 10:07:05,832 INFO L226 Difference]: Without dead ends: 103 [2019-01-20 10:07:05,833 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.2s TimeCoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2019-01-20 10:07:05,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-01-20 10:07:05,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-01-20 10:07:05,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-01-20 10:07:05,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2019-01-20 10:07:05,835 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 101 [2019-01-20 10:07:05,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:07:05,836 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2019-01-20 10:07:05,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-01-20 10:07:05,836 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2019-01-20 10:07:05,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-20 10:07:05,837 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:07:05,837 INFO L402 BasicCegarLoop]: trace histogram [99, 1, 1, 1] [2019-01-20 10:07:05,837 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:07:05,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:07:05,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1807142068, now seen corresponding path program 99 times [2019-01-20 10:07:05,837 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:07:05,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:07:05,838 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:07:05,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:07:05,838 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:07:05,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:07:09,707 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-20 10:07:09,708 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:07:09,708 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:07:09,708 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:07:09,708 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:07:09,708 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:07:09,708 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:07:09,717 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:07:09,717 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:07:09,779 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:07:09,779 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:07:09,782 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:07:09,799 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-20 10:07:09,800 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:07:21,652 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-20 10:07:21,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:07:21,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101, 101] total 201 [2019-01-20 10:07:21,671 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:07:21,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-01-20 10:07:21,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-01-20 10:07:21,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2019-01-20 10:07:21,674 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 102 states. [2019-01-20 10:07:21,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:07:21,953 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2019-01-20 10:07:21,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-01-20 10:07:21,954 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 102 [2019-01-20 10:07:21,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:07:21,954 INFO L225 Difference]: With dead ends: 106 [2019-01-20 10:07:21,955 INFO L226 Difference]: Without dead ends: 104 [2019-01-20 10:07:21,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2019-01-20 10:07:21,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-01-20 10:07:21,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-01-20 10:07:21,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-01-20 10:07:21,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2019-01-20 10:07:21,959 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 102 [2019-01-20 10:07:21,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:07:21,959 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2019-01-20 10:07:21,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-01-20 10:07:21,959 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2019-01-20 10:07:21,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-01-20 10:07:21,960 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:07:21,960 INFO L402 BasicCegarLoop]: trace histogram [100, 1, 1, 1] [2019-01-20 10:07:21,960 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:07:21,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:07:21,961 INFO L82 PathProgramCache]: Analyzing trace with hash -186827453, now seen corresponding path program 100 times [2019-01-20 10:07:21,961 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:07:21,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:07:21,961 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:07:21,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:07:21,962 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:07:21,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:07:25,716 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-20 10:07:25,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:07:25,716 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:07:25,716 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:07:25,716 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:07:25,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:07:25,716 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:07:25,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:07:25,724 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:07:25,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:07:25,787 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:07:25,804 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-20 10:07:25,804 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:07:38,360 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-20 10:07:38,378 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:07:38,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 102, 102] total 203 [2019-01-20 10:07:38,379 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:07:38,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-01-20 10:07:38,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-01-20 10:07:38,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2019-01-20 10:07:38,381 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 103 states. [2019-01-20 10:07:38,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:07:38,563 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2019-01-20 10:07:38,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-01-20 10:07:38,563 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 103 [2019-01-20 10:07:38,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:07:38,564 INFO L225 Difference]: With dead ends: 107 [2019-01-20 10:07:38,565 INFO L226 Difference]: Without dead ends: 105 [2019-01-20 10:07:38,566 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.1s TimeCoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2019-01-20 10:07:38,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-01-20 10:07:38,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-01-20 10:07:38,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-01-20 10:07:38,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2019-01-20 10:07:38,569 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 103 [2019-01-20 10:07:38,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:07:38,569 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2019-01-20 10:07:38,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-01-20 10:07:38,569 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2019-01-20 10:07:38,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-01-20 10:07:38,570 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:07:38,570 INFO L402 BasicCegarLoop]: trace histogram [101, 1, 1, 1] [2019-01-20 10:07:38,570 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:07:38,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:07:38,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1496681940, now seen corresponding path program 101 times [2019-01-20 10:07:38,571 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:07:38,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:07:38,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:07:38,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:07:38,572 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:07:38,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:07:42,150 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-20 10:07:42,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:07:42,150 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:07:42,150 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:07:42,150 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:07:42,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:07:42,151 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:07:42,158 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:07:42,159 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:07:44,088 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2019-01-20 10:07:44,088 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:07:44,094 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:07:44,111 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-20 10:07:44,112 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:07:56,729 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-20 10:07:56,750 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:07:56,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 103, 103] total 205 [2019-01-20 10:07:56,751 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:07:56,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-01-20 10:07:56,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-01-20 10:07:56,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2019-01-20 10:07:56,754 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 104 states. [2019-01-20 10:07:57,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:07:57,096 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2019-01-20 10:07:57,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-01-20 10:07:57,096 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 104 [2019-01-20 10:07:57,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:07:57,097 INFO L225 Difference]: With dead ends: 108 [2019-01-20 10:07:57,097 INFO L226 Difference]: Without dead ends: 106 [2019-01-20 10:07:57,099 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.0s TimeCoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2019-01-20 10:07:57,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-01-20 10:07:57,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2019-01-20 10:07:57,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-01-20 10:07:57,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2019-01-20 10:07:57,102 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 104 [2019-01-20 10:07:57,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:07:57,102 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2019-01-20 10:07:57,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-01-20 10:07:57,102 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2019-01-20 10:07:57,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-01-20 10:07:57,103 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:07:57,103 INFO L402 BasicCegarLoop]: trace histogram [102, 1, 1, 1] [2019-01-20 10:07:57,103 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:07:57,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:07:57,104 INFO L82 PathProgramCache]: Analyzing trace with hash 847501923, now seen corresponding path program 102 times [2019-01-20 10:07:57,104 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:07:57,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:07:57,104 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:07:57,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:07:57,105 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:07:57,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:08:01,175 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-20 10:08:01,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:08:01,176 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:08:01,176 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:08:01,176 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:08:01,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:08:01,176 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:08:01,184 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:08:01,185 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:08:01,246 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:08:01,246 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:08:01,251 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:08:01,277 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-20 10:08:01,277 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:08:14,154 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-20 10:08:14,173 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:08:14,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104, 104, 104] total 207 [2019-01-20 10:08:14,174 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:08:14,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-01-20 10:08:14,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-01-20 10:08:14,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2019-01-20 10:08:14,177 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 105 states. [2019-01-20 10:08:14,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:08:14,468 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2019-01-20 10:08:14,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-01-20 10:08:14,468 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 105 [2019-01-20 10:08:14,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:08:14,469 INFO L225 Difference]: With dead ends: 109 [2019-01-20 10:08:14,469 INFO L226 Difference]: Without dead ends: 107 [2019-01-20 10:08:14,470 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.8s TimeCoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2019-01-20 10:08:14,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-01-20 10:08:14,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-01-20 10:08:14,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-01-20 10:08:14,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2019-01-20 10:08:14,473 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 105 [2019-01-20 10:08:14,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:08:14,473 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2019-01-20 10:08:14,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-01-20 10:08:14,473 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2019-01-20 10:08:14,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-01-20 10:08:14,474 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:08:14,474 INFO L402 BasicCegarLoop]: trace histogram [103, 1, 1, 1] [2019-01-20 10:08:14,474 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:08:14,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:08:14,475 INFO L82 PathProgramCache]: Analyzing trace with hash 502757644, now seen corresponding path program 103 times [2019-01-20 10:08:14,475 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:08:14,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:08:14,475 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:08:14,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:08:14,476 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:08:14,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:08:18,443 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-20 10:08:18,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:08:18,444 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:08:18,444 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:08:18,444 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:08:18,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:08:18,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 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:08:18,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:08:18,453 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:08:18,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:08:18,520 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:08:18,544 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-20 10:08:18,545 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:08:31,755 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-20 10:08:31,773 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:08:31,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105, 105, 105] total 209 [2019-01-20 10:08:31,774 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:08:31,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-01-20 10:08:31,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-01-20 10:08:31,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2019-01-20 10:08:31,776 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 106 states. [2019-01-20 10:08:32,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:08:32,012 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2019-01-20 10:08:32,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-01-20 10:08:32,019 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 106 [2019-01-20 10:08:32,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:08:32,019 INFO L225 Difference]: With dead ends: 110 [2019-01-20 10:08:32,019 INFO L226 Difference]: Without dead ends: 108 [2019-01-20 10:08:32,020 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.0s TimeCoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2019-01-20 10:08:32,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-01-20 10:08:32,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-01-20 10:08:32,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-01-20 10:08:32,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2019-01-20 10:08:32,022 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 106 [2019-01-20 10:08:32,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:08:32,023 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2019-01-20 10:08:32,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-01-20 10:08:32,023 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2019-01-20 10:08:32,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-01-20 10:08:32,024 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:08:32,024 INFO L402 BasicCegarLoop]: trace histogram [104, 1, 1, 1] [2019-01-20 10:08:32,024 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:08:32,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:08:32,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1594380413, now seen corresponding path program 104 times [2019-01-20 10:08:32,024 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:08:32,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:08:32,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:08:32,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:08:32,025 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:08:32,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:08:36,091 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-20 10:08:36,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:08:36,091 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:08:36,092 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:08:36,092 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:08:36,092 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:08:36,092 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:08:36,101 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:08:36,101 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:08:38,190 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 53 check-sat command(s) [2019-01-20 10:08:38,190 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:08:38,196 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:08:38,222 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-20 10:08:38,223 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:08:51,715 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-20 10:08:51,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:08:51,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106, 106, 106] total 211 [2019-01-20 10:08:51,737 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:08:51,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-01-20 10:08:51,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-01-20 10:08:51,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2019-01-20 10:08:51,739 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 107 states. [2019-01-20 10:08:51,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:08:51,982 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2019-01-20 10:08:51,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-01-20 10:08:51,983 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 107 [2019-01-20 10:08:51,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:08:51,983 INFO L225 Difference]: With dead ends: 111 [2019-01-20 10:08:51,983 INFO L226 Difference]: Without dead ends: 109 [2019-01-20 10:08:51,984 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.4s TimeCoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2019-01-20 10:08:51,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-01-20 10:08:51,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-01-20 10:08:51,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-01-20 10:08:51,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2019-01-20 10:08:51,987 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 107 [2019-01-20 10:08:51,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:08:51,987 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2019-01-20 10:08:51,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-01-20 10:08:51,987 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2019-01-20 10:08:51,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-01-20 10:08:51,988 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:08:51,988 INFO L402 BasicCegarLoop]: trace histogram [105, 1, 1, 1] [2019-01-20 10:08:51,988 INFO L423 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:08:51,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:08:51,989 INFO L82 PathProgramCache]: Analyzing trace with hash 2113816556, now seen corresponding path program 105 times [2019-01-20 10:08:51,989 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:08:51,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:08:51,989 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:08:51,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:08:51,989 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:08:52,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:08:56,111 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-20 10:08:56,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:08:56,111 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:08:56,111 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:08:56,111 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:08:56,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:08:56,112 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:08:56,119 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:08:56,120 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:08:56,184 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:08:56,184 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:08:56,188 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:08:56,205 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-20 10:08:56,206 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:09:10,340 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-20 10:09:10,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:09:10,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107, 107, 107] total 213 [2019-01-20 10:09:10,358 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:09:10,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-01-20 10:09:10,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-01-20 10:09:10,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22791, Invalid=22791, Unknown=0, NotChecked=0, Total=45582 [2019-01-20 10:09:10,361 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 108 states. [2019-01-20 10:09:10,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:09:10,624 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2019-01-20 10:09:10,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2019-01-20 10:09:10,624 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 108 [2019-01-20 10:09:10,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:09:10,625 INFO L225 Difference]: With dead ends: 112 [2019-01-20 10:09:10,625 INFO L226 Difference]: Without dead ends: 110 [2019-01-20 10:09:10,626 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 18.1s TimeCoverageRelationStatistics Valid=22791, Invalid=22791, Unknown=0, NotChecked=0, Total=45582 [2019-01-20 10:09:10,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-01-20 10:09:10,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2019-01-20 10:09:10,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-01-20 10:09:10,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2019-01-20 10:09:10,629 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 108 [2019-01-20 10:09:10,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:09:10,629 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2019-01-20 10:09:10,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-01-20 10:09:10,629 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2019-01-20 10:09:10,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-01-20 10:09:10,630 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:09:10,630 INFO L402 BasicCegarLoop]: trace histogram [106, 1, 1, 1] [2019-01-20 10:09:10,630 INFO L423 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:09:10,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:09:10,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1103805603, now seen corresponding path program 106 times [2019-01-20 10:09:10,631 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:09:10,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:10,631 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:09:10,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:10,631 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:09:10,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:14,667 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-20 10:09:14,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:14,667 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:09:14,667 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:09:14,667 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:09:14,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:14,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 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-20 10:09:14,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:09:14,675 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:09:14,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:14,742 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:09:14,760 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-20 10:09:14,761 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:09:28,538 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-20 10:09:28,556 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:09:28,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108, 108, 108] total 215 [2019-01-20 10:09:28,556 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:09:28,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 109 states [2019-01-20 10:09:28,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2019-01-20 10:09:28,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23220, Invalid=23220, Unknown=0, NotChecked=0, Total=46440 [2019-01-20 10:09:28,559 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 109 states. [2019-01-20 10:09:28,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:09:28,834 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2019-01-20 10:09:28,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2019-01-20 10:09:28,834 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 109 [2019-01-20 10:09:28,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:09:28,834 INFO L225 Difference]: With dead ends: 113 [2019-01-20 10:09:28,835 INFO L226 Difference]: Without dead ends: 111 [2019-01-20 10:09:28,836 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.7s TimeCoverageRelationStatistics Valid=23220, Invalid=23220, Unknown=0, NotChecked=0, Total=46440 [2019-01-20 10:09:28,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-01-20 10:09:28,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-01-20 10:09:28,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-01-20 10:09:28,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2019-01-20 10:09:28,839 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 109 [2019-01-20 10:09:28,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:09:28,839 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2019-01-20 10:09:28,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has 109 states. [2019-01-20 10:09:28,839 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2019-01-20 10:09:28,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-01-20 10:09:28,839 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:09:28,840 INFO L402 BasicCegarLoop]: trace histogram [107, 1, 1, 1] [2019-01-20 10:09:28,840 INFO L423 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:09:28,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:09:28,840 INFO L82 PathProgramCache]: Analyzing trace with hash -141762868, now seen corresponding path program 107 times [2019-01-20 10:09:28,840 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:09:28,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:28,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:09:28,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:28,841 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:09:28,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:33,177 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-20 10:09:33,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:33,177 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:09:33,178 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:09:33,178 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:09:33,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:33,178 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-20 10:09:33,185 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:09:33,185 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:09:35,620 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 55 check-sat command(s) [2019-01-20 10:09:35,621 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:09:35,628 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:09:35,646 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-20 10:09:35,646 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:09:49,540 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-20 10:09:49,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:09:49,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109, 109, 109] total 217 [2019-01-20 10:09:49,561 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:09:49,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-01-20 10:09:49,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-01-20 10:09:49,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23653, Invalid=23653, Unknown=0, NotChecked=0, Total=47306 [2019-01-20 10:09:49,565 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 110 states. [2019-01-20 10:09:49,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:09:49,911 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2019-01-20 10:09:49,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2019-01-20 10:09:49,911 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 110 [2019-01-20 10:09:49,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:09:49,912 INFO L225 Difference]: With dead ends: 114 [2019-01-20 10:09:49,912 INFO L226 Difference]: Without dead ends: 112 [2019-01-20 10:09:49,913 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 18.1s TimeCoverageRelationStatistics Valid=23653, Invalid=23653, Unknown=0, NotChecked=0, Total=47306 [2019-01-20 10:09:49,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-01-20 10:09:49,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2019-01-20 10:09:49,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-01-20 10:09:49,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2019-01-20 10:09:49,916 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 110 [2019-01-20 10:09:49,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:09:49,916 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2019-01-20 10:09:49,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2019-01-20 10:09:49,917 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2019-01-20 10:09:49,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-01-20 10:09:49,917 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:09:49,917 INFO L402 BasicCegarLoop]: trace histogram [108, 1, 1, 1] [2019-01-20 10:09:49,917 INFO L423 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:09:49,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:09:49,918 INFO L82 PathProgramCache]: Analyzing trace with hash -99679805, now seen corresponding path program 108 times [2019-01-20 10:09:49,918 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:09:49,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:49,918 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:09:49,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:49,919 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:09:49,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:54,389 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-20 10:09:54,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:54,389 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:09:54,389 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:09:54,389 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:09:54,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:54,389 INFO 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-20 10:09:54,398 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:09:54,398 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:09:54,466 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:09:54,466 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:09:54,470 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:09:54,489 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-20 10:09:54,489 INFO L316 TraceCheckSpWp]: Computing backward predicates...