java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit02.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1de736e-m [2019-02-15 11:12:00,019 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-15 11:12:00,021 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-15 11:12:00,035 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-15 11:12:00,035 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-15 11:12:00,036 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-15 11:12:00,037 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-15 11:12:00,039 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-15 11:12:00,041 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-15 11:12:00,042 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-15 11:12:00,043 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-15 11:12:00,043 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-15 11:12:00,044 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-15 11:12:00,045 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-15 11:12:00,046 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-15 11:12:00,047 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-15 11:12:00,047 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-15 11:12:00,052 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-15 11:12:00,058 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-15 11:12:00,059 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-15 11:12:00,060 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-15 11:12:00,061 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-15 11:12:00,068 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-15 11:12:00,068 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-15 11:12:00,068 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-15 11:12:00,069 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-15 11:12:00,074 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-15 11:12:00,074 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-15 11:12:00,077 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-15 11:12:00,078 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-15 11:12:00,079 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-15 11:12:00,079 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-15 11:12:00,079 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-15 11:12:00,079 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-15 11:12:00,082 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-15 11:12:00,083 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-15 11:12:00,084 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2019-02-15 11:12:00,101 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-15 11:12:00,102 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-15 11:12:00,103 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-15 11:12:00,103 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-15 11:12:00,103 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-15 11:12:00,103 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-15 11:12:00,103 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-15 11:12:00,104 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-15 11:12:00,104 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-15 11:12:00,104 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-02-15 11:12:00,104 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-02-15 11:12:00,104 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-15 11:12:00,104 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-15 11:12:00,105 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-15 11:12:00,105 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-15 11:12:00,105 INFO L133 SettingsManager]: * Use SBE=true [2019-02-15 11:12:00,106 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-15 11:12:00,106 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-15 11:12:00,106 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-15 11:12:00,106 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-15 11:12:00,107 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-15 11:12:00,107 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-15 11:12:00,107 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-15 11:12:00,107 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-15 11:12:00,107 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-15 11:12:00,107 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-15 11:12:00,108 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-15 11:12:00,108 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-15 11:12:00,108 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-15 11:12:00,108 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-15 11:12:00,108 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-15 11:12:00,109 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-15 11:12:00,109 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-15 11:12:00,109 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-15 11:12:00,109 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-15 11:12:00,109 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-15 11:12:00,110 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-02-15 11:12:00,110 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-15 11:12:00,110 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-15 11:12:00,146 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-15 11:12:00,158 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-15 11:12:00,162 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-15 11:12:00,165 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-15 11:12:00,165 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-15 11:12:00,166 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit02.bpl [2019-02-15 11:12:00,166 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit02.bpl' [2019-02-15 11:12:00,208 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-15 11:12:00,209 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-15 11:12:00,210 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-15 11:12:00,210 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-15 11:12:00,211 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-15 11:12:00,227 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:12:00" (1/1) ... [2019-02-15 11:12:00,237 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:12:00" (1/1) ... [2019-02-15 11:12:00,247 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-15 11:12:00,247 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-15 11:12:00,247 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-15 11:12:00,248 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-15 11:12:00,257 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:12:00" (1/1) ... [2019-02-15 11:12:00,257 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:12:00" (1/1) ... [2019-02-15 11:12:00,257 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:12:00" (1/1) ... [2019-02-15 11:12:00,258 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:12:00" (1/1) ... [2019-02-15 11:12:00,260 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:12:00" (1/1) ... [2019-02-15 11:12:00,265 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:12:00" (1/1) ... [2019-02-15 11:12:00,266 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:12:00" (1/1) ... [2019-02-15 11:12:00,267 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-15 11:12:00,268 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-15 11:12:00,268 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-15 11:12:00,268 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-15 11:12:00,269 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:12:00" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-15 11:12:00,329 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-02-15 11:12:00,330 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-15 11:12:00,330 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-15 11:12:00,663 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-15 11:12:00,663 INFO L286 CfgBuilder]: Removed 0 assue(true) statements. [2019-02-15 11:12:00,664 INFO L202 PluginConnector]: Adding new model ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 11:12:00 BoogieIcfgContainer [2019-02-15 11:12:00,665 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-15 11:12:00,666 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-15 11:12:00,666 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-15 11:12:00,669 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-15 11:12:00,669 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:12:00" (1/2) ... [2019-02-15 11:12:00,670 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bfe91e4 and model type ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 11:12:00, skipping insertion in model container [2019-02-15 11:12:00,671 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 11:12:00" (2/2) ... [2019-02-15 11:12:00,672 INFO L112 eAbstractionObserver]: Analyzing ICFG ArrayInit02.bpl [2019-02-15 11:12:00,682 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-15 11:12:00,689 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-02-15 11:12:00,703 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-02-15 11:12:00,734 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-15 11:12:00,734 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-15 11:12:00,734 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-15 11:12:00,734 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-15 11:12:00,735 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-15 11:12:00,735 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-15 11:12:00,735 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-15 11:12:00,735 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-15 11:12:00,750 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states. [2019-02-15 11:12:00,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 11:12:00,756 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:12:00,757 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 11:12:00,760 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:12:00,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:12:00,766 INFO L82 PathProgramCache]: Analyzing trace with hash 900035954, now seen corresponding path program 1 times [2019-02-15 11:12:00,768 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:12:00,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:00,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:12:00,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:00,812 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:12:00,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:01,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:01,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-15 11:12:01,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-02-15 11:12:01,014 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 11:12:01,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-15 11:12:01,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-15 11:12:01,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-02-15 11:12:01,030 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 4 states. [2019-02-15 11:12:01,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:12:01,183 INFO L93 Difference]: Finished difference Result 26 states and 34 transitions. [2019-02-15 11:12:01,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-15 11:12:01,185 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-02-15 11:12:01,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:12:01,198 INFO L225 Difference]: With dead ends: 26 [2019-02-15 11:12:01,198 INFO L226 Difference]: Without dead ends: 13 [2019-02-15 11:12:01,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-02-15 11:12:01,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-02-15 11:12:01,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 11. [2019-02-15 11:12:01,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-02-15 11:12:01,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2019-02-15 11:12:01,237 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 14 transitions. Word has length 6 [2019-02-15 11:12:01,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:12:01,237 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-02-15 11:12:01,238 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-15 11:12:01,238 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 14 transitions. [2019-02-15 11:12:01,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-15 11:12:01,238 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:12:01,238 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:12:01,239 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:12:01,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:12:01,239 INFO L82 PathProgramCache]: Analyzing trace with hash 429804648, now seen corresponding path program 1 times [2019-02-15 11:12:01,239 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:12:01,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:01,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:12:01,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:01,241 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:12:01,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:01,344 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:01,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-15 11:12:01,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-02-15 11:12:01,346 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 11:12:01,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-15 11:12:01,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-15 11:12:01,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-02-15 11:12:01,348 INFO L87 Difference]: Start difference. First operand 11 states and 14 transitions. Second operand 4 states. [2019-02-15 11:12:01,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:12:01,441 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2019-02-15 11:12:01,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-15 11:12:01,442 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-02-15 11:12:01,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:12:01,444 INFO L225 Difference]: With dead ends: 25 [2019-02-15 11:12:01,444 INFO L226 Difference]: Without dead ends: 23 [2019-02-15 11:12:01,445 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-02-15 11:12:01,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-02-15 11:12:01,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 19. [2019-02-15 11:12:01,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-02-15 11:12:01,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2019-02-15 11:12:01,451 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 26 transitions. Word has length 9 [2019-02-15 11:12:01,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:12:01,452 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 26 transitions. [2019-02-15 11:12:01,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-15 11:12:01,452 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 26 transitions. [2019-02-15 11:12:01,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-15 11:12:01,453 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:12:01,453 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:12:01,453 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:12:01,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:12:01,454 INFO L82 PathProgramCache]: Analyzing trace with hash 429806570, now seen corresponding path program 1 times [2019-02-15 11:12:01,454 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:12:01,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:01,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:12:01,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:01,456 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:12:01,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:01,522 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:12:01,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-15 11:12:01,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-02-15 11:12:01,522 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 11:12:01,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-15 11:12:01,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-15 11:12:01,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-15 11:12:01,524 INFO L87 Difference]: Start difference. First operand 19 states and 26 transitions. Second operand 3 states. [2019-02-15 11:12:01,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:12:01,582 INFO L93 Difference]: Finished difference Result 24 states and 31 transitions. [2019-02-15 11:12:01,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-15 11:12:01,583 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-02-15 11:12:01,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:12:01,585 INFO L225 Difference]: With dead ends: 24 [2019-02-15 11:12:01,585 INFO L226 Difference]: Without dead ends: 13 [2019-02-15 11:12:01,586 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-15 11:12:01,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-02-15 11:12:01,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2019-02-15 11:12:01,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-02-15 11:12:01,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2019-02-15 11:12:01,589 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 9 [2019-02-15 11:12:01,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:12:01,589 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2019-02-15 11:12:01,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-15 11:12:01,590 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2019-02-15 11:12:01,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-15 11:12:01,590 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:12:01,591 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:12:01,591 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:12:01,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:12:01,591 INFO L82 PathProgramCache]: Analyzing trace with hash -2090155286, now seen corresponding path program 1 times [2019-02-15 11:12:01,591 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:12:01,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:01,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:12:01,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:01,593 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:12:01,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:01,907 WARN L181 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2019-02-15 11:12:01,946 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:01,946 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:01,947 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:12:01,948 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-02-15 11:12:01,950 INFO L207 CegarAbsIntRunner]: [0], [4], [9], [11], [13], [17], [20], [26], [27] [2019-02-15 11:12:02,019 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:12:02,020 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:12:02,208 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:12:02,210 INFO L272 AbstractInterpreter]: Visited 9 different actions 46 times. Merged at 8 different actions 36 times. Widened at 1 different actions 3 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-15 11:12:02,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:12:02,217 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:12:02,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:02,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 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:12:02,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:12:02,233 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:12:02,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:02,264 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:12:02,531 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-02-15 11:12:02,537 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:02,538 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:12:02,630 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:02,651 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:12:02,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2019-02-15 11:12:02,651 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:12:02,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-02-15 11:12:02,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-02-15 11:12:02,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-02-15 11:12:02,653 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand 7 states. [2019-02-15 11:12:02,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:12:02,859 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2019-02-15 11:12:02,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 11:12:02,861 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2019-02-15 11:12:02,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:12:02,861 INFO L225 Difference]: With dead ends: 26 [2019-02-15 11:12:02,861 INFO L226 Difference]: Without dead ends: 19 [2019-02-15 11:12:02,862 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-02-15 11:12:02,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-02-15 11:12:02,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 14. [2019-02-15 11:12:02,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-02-15 11:12:02,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2019-02-15 11:12:02,866 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 9 [2019-02-15 11:12:02,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:12:02,867 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2019-02-15 11:12:02,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-02-15 11:12:02,867 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2019-02-15 11:12:02,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-02-15 11:12:02,868 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:12:02,868 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:12:02,868 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:12:02,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:12:02,869 INFO L82 PathProgramCache]: Analyzing trace with hash -368470767, now seen corresponding path program 1 times [2019-02-15 11:12:02,869 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:12:02,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:02,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:12:02,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:02,870 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:12:02,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:02,949 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:02,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:02,949 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:12:02,950 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 14 with the following transitions: [2019-02-15 11:12:02,950 INFO L207 CegarAbsIntRunner]: [0], [4], [9], [11], [13], [17], [20], [22], [26], [27], [30], [32] [2019-02-15 11:12:02,953 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:12:02,953 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:12:03,132 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:12:03,132 INFO L272 AbstractInterpreter]: Visited 12 different actions 102 times. Merged at 11 different actions 74 times. Widened at 3 different actions 7 times. Found 18 fixpoints after 6 different actions. Largest state had 0 variables. [2019-02-15 11:12:03,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:12:03,133 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:12:03,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:03,133 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:12:03,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:12:03,154 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:12:03,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:03,179 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:12:03,286 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:03,286 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:12:03,323 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:03,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:12:03,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2019-02-15 11:12:03,343 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:12:03,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 11:12:03,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 11:12:03,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-02-15 11:12:03,344 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand 8 states. [2019-02-15 11:12:03,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:12:03,755 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2019-02-15 11:12:03,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 11:12:03,756 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2019-02-15 11:12:03,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:12:03,757 INFO L225 Difference]: With dead ends: 31 [2019-02-15 11:12:03,757 INFO L226 Difference]: Without dead ends: 19 [2019-02-15 11:12:03,758 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-02-15 11:12:03,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-02-15 11:12:03,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2019-02-15 11:12:03,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-02-15 11:12:03,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2019-02-15 11:12:03,762 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 13 [2019-02-15 11:12:03,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:12:03,763 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-02-15 11:12:03,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 11:12:03,763 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2019-02-15 11:12:03,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-02-15 11:12:03,763 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:12:03,763 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:12:03,764 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:12:03,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:12:03,764 INFO L82 PathProgramCache]: Analyzing trace with hash -256855911, now seen corresponding path program 2 times [2019-02-15 11:12:03,764 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:12:03,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:03,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:12:03,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:03,766 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:12:03,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:04,077 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:04,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:04,077 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:12:04,077 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:12:04,078 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:12:04,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:04,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 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:12:04,096 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:12:04,096 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:12:04,103 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-15 11:12:04,104 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:12:04,105 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:12:04,182 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:04,182 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:12:04,243 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:04,262 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:12:04,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 10 [2019-02-15 11:12:04,262 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:12:04,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-15 11:12:04,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-15 11:12:04,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-02-15 11:12:04,333 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 11 states. [2019-02-15 11:12:04,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:12:04,643 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2019-02-15 11:12:04,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-15 11:12:04,643 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 [2019-02-15 11:12:04,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:12:04,644 INFO L225 Difference]: With dead ends: 35 [2019-02-15 11:12:04,644 INFO L226 Difference]: Without dead ends: 28 [2019-02-15 11:12:04,645 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2019-02-15 11:12:04,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-02-15 11:12:04,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 21. [2019-02-15 11:12:04,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-02-15 11:12:04,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2019-02-15 11:12:04,650 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 16 [2019-02-15 11:12:04,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:12:04,650 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2019-02-15 11:12:04,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-15 11:12:04,650 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2019-02-15 11:12:04,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-02-15 11:12:04,651 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:12:04,651 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-02-15 11:12:04,651 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:12:04,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:12:04,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1110643520, now seen corresponding path program 3 times [2019-02-15 11:12:04,652 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:12:04,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:04,653 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:12:04,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:04,653 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:12:04,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:04,779 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:04,779 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:04,780 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:12:04,780 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:12:04,780 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:12:04,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:04,780 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:12:04,789 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:12:04,789 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:12:04,794 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:12:04,794 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:12:04,796 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:12:04,851 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:04,852 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:12:04,900 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:04,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:12:04,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2019-02-15 11:12:04,918 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:12:04,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-15 11:12:04,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-15 11:12:04,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-02-15 11:12:04,920 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 11 states. [2019-02-15 11:12:05,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:12:05,039 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2019-02-15 11:12:05,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 11:12:05,040 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2019-02-15 11:12:05,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:12:05,041 INFO L225 Difference]: With dead ends: 45 [2019-02-15 11:12:05,041 INFO L226 Difference]: Without dead ends: 26 [2019-02-15 11:12:05,042 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 31 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2019-02-15 11:12:05,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-02-15 11:12:05,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2019-02-15 11:12:05,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-02-15 11:12:05,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-02-15 11:12:05,046 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 20 [2019-02-15 11:12:05,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:12:05,047 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-02-15 11:12:05,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-15 11:12:05,047 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-02-15 11:12:05,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-02-15 11:12:05,048 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:12:05,048 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1] [2019-02-15 11:12:05,048 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:12:05,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:12:05,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1324912968, now seen corresponding path program 4 times [2019-02-15 11:12:05,049 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:12:05,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:05,050 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:12:05,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:05,050 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:12:05,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:05,256 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:05,256 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:05,257 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:12:05,257 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:12:05,257 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:12:05,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:05,257 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:12:05,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:12:05,267 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:12:05,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:05,276 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:12:05,372 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:05,372 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:12:05,415 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:05,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:12:05,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 13 [2019-02-15 11:12:05,434 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:12:05,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-02-15 11:12:05,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-02-15 11:12:05,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2019-02-15 11:12:05,436 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 14 states. [2019-02-15 11:12:05,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:12:05,790 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2019-02-15 11:12:05,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-02-15 11:12:05,791 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 23 [2019-02-15 11:12:05,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:12:05,793 INFO L225 Difference]: With dead ends: 49 [2019-02-15 11:12:05,793 INFO L226 Difference]: Without dead ends: 39 [2019-02-15 11:12:05,794 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2019-02-15 11:12:05,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-02-15 11:12:05,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 28. [2019-02-15 11:12:05,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-02-15 11:12:05,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2019-02-15 11:12:05,801 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 23 [2019-02-15 11:12:05,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:12:05,801 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2019-02-15 11:12:05,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-02-15 11:12:05,801 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2019-02-15 11:12:05,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-02-15 11:12:05,802 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:12:05,802 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2019-02-15 11:12:05,803 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:12:05,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:12:05,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1588570591, now seen corresponding path program 5 times [2019-02-15 11:12:05,803 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:12:05,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:05,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:12:05,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:05,805 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:12:05,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:06,004 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:06,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:06,005 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:12:06,005 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:12:06,005 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:12:06,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:06,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 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:12:06,016 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:12:06,016 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:12:06,033 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-02-15 11:12:06,033 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:12:06,036 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:12:06,104 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:06,104 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:12:06,230 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:06,259 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:12:06,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2019-02-15 11:12:06,260 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:12:06,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-02-15 11:12:06,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-02-15 11:12:06,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-02-15 11:12:06,261 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 14 states. [2019-02-15 11:12:06,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:12:06,542 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2019-02-15 11:12:06,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-15 11:12:06,543 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 27 [2019-02-15 11:12:06,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:12:06,544 INFO L225 Difference]: With dead ends: 60 [2019-02-15 11:12:06,544 INFO L226 Difference]: Without dead ends: 33 [2019-02-15 11:12:06,545 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 42 SyntacticMatches, 7 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2019-02-15 11:12:06,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-02-15 11:12:06,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2019-02-15 11:12:06,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-02-15 11:12:06,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2019-02-15 11:12:06,552 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 27 [2019-02-15 11:12:06,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:12:06,552 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2019-02-15 11:12:06,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-02-15 11:12:06,552 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2019-02-15 11:12:06,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-02-15 11:12:06,553 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:12:06,553 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1] [2019-02-15 11:12:06,553 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:12:06,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:12:06,554 INFO L82 PathProgramCache]: Analyzing trace with hash 366737255, now seen corresponding path program 6 times [2019-02-15 11:12:06,554 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:12:06,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:06,555 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:12:06,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:06,555 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:12:06,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:06,770 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:06,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:06,770 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:12:06,771 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:12:06,771 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:12:06,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:06,771 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:12:06,779 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:12:06,779 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:12:06,792 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:12:06,793 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:12:06,795 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:12:06,930 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:06,930 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:12:06,985 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:07,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:12:07,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 16 [2019-02-15 11:12:07,003 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:12:07,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-02-15 11:12:07,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-02-15 11:12:07,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2019-02-15 11:12:07,005 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 17 states. [2019-02-15 11:12:07,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:12:07,718 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2019-02-15 11:12:07,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-02-15 11:12:07,725 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 30 [2019-02-15 11:12:07,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:12:07,726 INFO L225 Difference]: With dead ends: 64 [2019-02-15 11:12:07,726 INFO L226 Difference]: Without dead ends: 50 [2019-02-15 11:12:07,727 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2019-02-15 11:12:07,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-02-15 11:12:07,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 35. [2019-02-15 11:12:07,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-02-15 11:12:07,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2019-02-15 11:12:07,733 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 30 [2019-02-15 11:12:07,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:12:07,734 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2019-02-15 11:12:07,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-02-15 11:12:07,734 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2019-02-15 11:12:07,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-02-15 11:12:07,735 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:12:07,735 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2019-02-15 11:12:07,735 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:12:07,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:12:07,736 INFO L82 PathProgramCache]: Analyzing trace with hash -1079885042, now seen corresponding path program 7 times [2019-02-15 11:12:07,736 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:12:07,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:07,737 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:12:07,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:07,737 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:12:07,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:08,112 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 36 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:08,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:08,113 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:12:08,113 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:12:08,113 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:12:08,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:08,113 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:12:08,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:12:08,122 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:12:08,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:08,131 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:12:08,290 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 36 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:08,290 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:12:08,409 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 36 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:08,428 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:12:08,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 16 [2019-02-15 11:12:08,428 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:12:08,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-02-15 11:12:08,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-02-15 11:12:08,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2019-02-15 11:12:08,431 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 17 states. [2019-02-15 11:12:08,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:12:08,690 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2019-02-15 11:12:08,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-02-15 11:12:08,691 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 34 [2019-02-15 11:12:08,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:12:08,692 INFO L225 Difference]: With dead ends: 75 [2019-02-15 11:12:08,692 INFO L226 Difference]: Without dead ends: 40 [2019-02-15 11:12:08,693 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 53 SyntacticMatches, 9 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2019-02-15 11:12:08,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-02-15 11:12:08,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2019-02-15 11:12:08,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-02-15 11:12:08,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2019-02-15 11:12:08,701 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 34 [2019-02-15 11:12:08,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:12:08,701 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2019-02-15 11:12:08,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-02-15 11:12:08,701 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2019-02-15 11:12:08,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-02-15 11:12:08,702 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:12:08,702 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1] [2019-02-15 11:12:08,703 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:12:08,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:12:08,703 INFO L82 PathProgramCache]: Analyzing trace with hash -921359226, now seen corresponding path program 8 times [2019-02-15 11:12:08,703 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:12:08,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:08,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:12:08,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:08,704 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:12:08,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:08,986 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 4 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:08,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:08,986 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:12:08,986 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:12:08,986 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:12:08,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:08,986 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:12:08,995 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:12:08,996 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:12:09,008 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-02-15 11:12:09,009 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:12:09,011 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:12:09,453 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 32 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:09,453 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:12:10,138 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 28 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:10,157 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:12:10,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 33 [2019-02-15 11:12:10,157 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:12:10,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-02-15 11:12:10,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-02-15 11:12:10,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=961, Unknown=0, NotChecked=0, Total=1122 [2019-02-15 11:12:10,159 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 27 states. [2019-02-15 11:12:12,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:12:12,212 INFO L93 Difference]: Finished difference Result 97 states and 103 transitions. [2019-02-15 11:12:12,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-02-15 11:12:12,212 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 37 [2019-02-15 11:12:12,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:12:12,214 INFO L225 Difference]: With dead ends: 97 [2019-02-15 11:12:12,214 INFO L226 Difference]: Without dead ends: 58 [2019-02-15 11:12:12,218 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 47 SyntacticMatches, 6 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 855 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=499, Invalid=3533, Unknown=0, NotChecked=0, Total=4032 [2019-02-15 11:12:12,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-02-15 11:12:12,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 45. [2019-02-15 11:12:12,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-02-15 11:12:12,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2019-02-15 11:12:12,225 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 37 [2019-02-15 11:12:12,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:12:12,225 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2019-02-15 11:12:12,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-02-15 11:12:12,225 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2019-02-15 11:12:12,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-02-15 11:12:12,226 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:12:12,227 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1] [2019-02-15 11:12:12,227 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:12:12,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:12:12,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1868574667, now seen corresponding path program 9 times [2019-02-15 11:12:12,227 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:12:12,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:12,228 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:12:12,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:12,229 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:12:12,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:12,646 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 5 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:12,646 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:12,646 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:12:12,646 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:12:12,647 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:12:12,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:12,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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:12:12,656 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:12:12,656 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:12:12,664 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:12:12,665 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:12:12,667 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:12:12,880 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 5 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:12,880 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:12:12,917 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 5 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:12,935 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:12:12,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 22 [2019-02-15 11:12:12,936 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:12:12,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-02-15 11:12:12,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-02-15 11:12:12,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2019-02-15 11:12:12,937 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand 23 states. [2019-02-15 11:12:14,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:12:14,191 INFO L93 Difference]: Finished difference Result 94 states and 99 transitions. [2019-02-15 11:12:14,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-02-15 11:12:14,192 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 44 [2019-02-15 11:12:14,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:12:14,193 INFO L225 Difference]: With dead ends: 94 [2019-02-15 11:12:14,193 INFO L226 Difference]: Without dead ends: 72 [2019-02-15 11:12:14,195 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 77 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=149, Invalid=1041, Unknown=0, NotChecked=0, Total=1190 [2019-02-15 11:12:14,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-02-15 11:12:14,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 49. [2019-02-15 11:12:14,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-02-15 11:12:14,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2019-02-15 11:12:14,204 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 44 [2019-02-15 11:12:14,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:12:14,205 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 51 transitions. [2019-02-15 11:12:14,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-02-15 11:12:14,205 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2019-02-15 11:12:14,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-02-15 11:12:14,206 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:12:14,206 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1] [2019-02-15 11:12:14,206 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:12:14,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:12:14,207 INFO L82 PathProgramCache]: Analyzing trace with hash 269550812, now seen corresponding path program 10 times [2019-02-15 11:12:14,207 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:12:14,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:14,208 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:12:14,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:14,208 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:12:14,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:14,366 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 78 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:14,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:14,366 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:12:14,366 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:12:14,367 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:12:14,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:14,367 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:12:14,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:12:14,375 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:12:14,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:14,388 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:12:14,565 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 78 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:14,566 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:12:14,662 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 78 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:14,682 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:12:14,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 22 [2019-02-15 11:12:14,683 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:12:14,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-02-15 11:12:14,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-02-15 11:12:14,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2019-02-15 11:12:14,684 INFO L87 Difference]: Start difference. First operand 49 states and 51 transitions. Second operand 23 states. [2019-02-15 11:12:15,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:12:15,256 INFO L93 Difference]: Finished difference Result 105 states and 109 transitions. [2019-02-15 11:12:15,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-02-15 11:12:15,256 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 48 [2019-02-15 11:12:15,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:12:15,258 INFO L225 Difference]: With dead ends: 105 [2019-02-15 11:12:15,258 INFO L226 Difference]: Without dead ends: 54 [2019-02-15 11:12:15,260 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 75 SyntacticMatches, 13 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=232, Invalid=638, Unknown=0, NotChecked=0, Total=870 [2019-02-15 11:12:15,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-02-15 11:12:15,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2019-02-15 11:12:15,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-02-15 11:12:15,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2019-02-15 11:12:15,274 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 48 [2019-02-15 11:12:15,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:12:15,274 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2019-02-15 11:12:15,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-02-15 11:12:15,275 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2019-02-15 11:12:15,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-02-15 11:12:15,276 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:12:15,276 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1] [2019-02-15 11:12:15,276 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:12:15,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:12:15,276 INFO L82 PathProgramCache]: Analyzing trace with hash 2089942100, now seen corresponding path program 11 times [2019-02-15 11:12:15,277 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:12:15,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:15,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:12:15,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:15,278 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:12:15,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:15,679 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 6 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:15,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:15,679 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:12:15,680 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:12:15,680 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:12:15,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:15,680 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:12:15,688 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:12:15,689 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:12:15,703 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-02-15 11:12:15,703 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:12:15,705 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:12:15,930 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 6 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:15,930 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:12:15,969 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 6 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:15,988 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:12:15,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 25 [2019-02-15 11:12:15,988 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:12:15,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-02-15 11:12:15,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-02-15 11:12:15,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2019-02-15 11:12:15,989 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 26 states. [2019-02-15 11:12:17,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:12:17,224 INFO L93 Difference]: Finished difference Result 109 states and 114 transitions. [2019-02-15 11:12:17,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-02-15 11:12:17,225 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 51 [2019-02-15 11:12:17,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:12:17,226 INFO L225 Difference]: With dead ends: 109 [2019-02-15 11:12:17,226 INFO L226 Difference]: Without dead ends: 83 [2019-02-15 11:12:17,228 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 90 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=179, Invalid=1381, Unknown=0, NotChecked=0, Total=1560 [2019-02-15 11:12:17,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-02-15 11:12:17,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 56. [2019-02-15 11:12:17,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-02-15 11:12:17,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2019-02-15 11:12:17,236 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 51 [2019-02-15 11:12:17,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:12:17,237 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2019-02-15 11:12:17,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-02-15 11:12:17,237 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2019-02-15 11:12:17,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-02-15 11:12:17,238 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:12:17,238 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1] [2019-02-15 11:12:17,238 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:12:17,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:12:17,239 INFO L82 PathProgramCache]: Analyzing trace with hash 549587323, now seen corresponding path program 12 times [2019-02-15 11:12:17,239 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:12:17,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:17,240 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:12:17,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:17,240 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:12:17,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:17,627 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 105 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:17,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:17,628 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:12:17,628 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:12:17,628 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:12:17,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:17,628 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:12:17,637 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:12:17,638 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:12:17,647 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:12:17,647 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:12:17,651 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:12:17,826 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 105 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:17,826 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:12:17,920 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 105 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:17,938 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:12:17,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 25 [2019-02-15 11:12:17,938 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:12:17,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-02-15 11:12:17,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-02-15 11:12:17,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=481, Unknown=0, NotChecked=0, Total=650 [2019-02-15 11:12:17,939 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 26 states. [2019-02-15 11:12:18,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:12:18,253 INFO L93 Difference]: Finished difference Result 120 states and 124 transitions. [2019-02-15 11:12:18,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-02-15 11:12:18,255 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 55 [2019-02-15 11:12:18,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:12:18,256 INFO L225 Difference]: With dead ends: 120 [2019-02-15 11:12:18,256 INFO L226 Difference]: Without dead ends: 61 [2019-02-15 11:12:18,257 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 86 SyntacticMatches, 15 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=293, Invalid=829, Unknown=0, NotChecked=0, Total=1122 [2019-02-15 11:12:18,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-02-15 11:12:18,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2019-02-15 11:12:18,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-02-15 11:12:18,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2019-02-15 11:12:18,267 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 55 [2019-02-15 11:12:18,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:12:18,267 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2019-02-15 11:12:18,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-02-15 11:12:18,268 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2019-02-15 11:12:18,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-02-15 11:12:18,271 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:12:18,271 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 1, 1, 1, 1, 1] [2019-02-15 11:12:18,272 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:12:18,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:12:18,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1743111421, now seen corresponding path program 13 times [2019-02-15 11:12:18,272 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:12:18,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:18,273 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:12:18,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:18,273 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:12:18,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:18,664 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 7 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:18,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:18,665 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:12:18,665 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:12:18,665 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:12:18,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:18,665 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:12:18,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:12:18,677 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:12:18,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:18,690 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:12:18,914 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 7 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:18,915 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:12:19,002 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 7 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:19,022 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:12:19,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 28 [2019-02-15 11:12:19,022 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:12:19,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-02-15 11:12:19,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-02-15 11:12:19,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=738, Unknown=0, NotChecked=0, Total=812 [2019-02-15 11:12:19,023 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 29 states. [2019-02-15 11:12:20,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:12:20,800 INFO L93 Difference]: Finished difference Result 124 states and 129 transitions. [2019-02-15 11:12:20,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-02-15 11:12:20,801 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 58 [2019-02-15 11:12:20,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:12:20,801 INFO L225 Difference]: With dead ends: 124 [2019-02-15 11:12:20,802 INFO L226 Difference]: Without dead ends: 94 [2019-02-15 11:12:20,803 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 103 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=211, Invalid=1769, Unknown=0, NotChecked=0, Total=1980 [2019-02-15 11:12:20,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-02-15 11:12:20,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 63. [2019-02-15 11:12:20,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-02-15 11:12:20,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2019-02-15 11:12:20,814 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 58 [2019-02-15 11:12:20,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:12:20,814 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2019-02-15 11:12:20,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-02-15 11:12:20,815 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2019-02-15 11:12:20,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-02-15 11:12:20,816 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:12:20,816 INFO L402 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1] [2019-02-15 11:12:20,816 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:12:20,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:12:20,816 INFO L82 PathProgramCache]: Analyzing trace with hash -1415751510, now seen corresponding path program 14 times [2019-02-15 11:12:20,817 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:12:20,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:20,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:12:20,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:20,818 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:12:20,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:21,065 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 136 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:21,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:21,066 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:12:21,066 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:12:21,066 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:12:21,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:21,066 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:12:21,076 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:12:21,076 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:12:21,092 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-02-15 11:12:21,092 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:12:21,095 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:12:21,343 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 136 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:21,344 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:12:21,476 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 136 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:21,494 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:12:21,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 28 [2019-02-15 11:12:21,494 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:12:21,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-02-15 11:12:21,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-02-15 11:12:21,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=604, Unknown=0, NotChecked=0, Total=812 [2019-02-15 11:12:21,496 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand 29 states. [2019-02-15 11:12:21,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:12:21,916 INFO L93 Difference]: Finished difference Result 135 states and 139 transitions. [2019-02-15 11:12:21,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-02-15 11:12:21,916 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 62 [2019-02-15 11:12:21,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:12:21,917 INFO L225 Difference]: With dead ends: 135 [2019-02-15 11:12:21,917 INFO L226 Difference]: Without dead ends: 68 [2019-02-15 11:12:21,918 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 97 SyntacticMatches, 17 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=361, Invalid=1045, Unknown=0, NotChecked=0, Total=1406 [2019-02-15 11:12:21,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-02-15 11:12:21,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2019-02-15 11:12:21,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-02-15 11:12:21,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 68 transitions. [2019-02-15 11:12:21,926 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 68 transitions. Word has length 62 [2019-02-15 11:12:21,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:12:21,927 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 68 transitions. [2019-02-15 11:12:21,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-02-15 11:12:21,927 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2019-02-15 11:12:21,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-02-15 11:12:21,928 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:12:21,928 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 1, 1, 1, 1, 1] [2019-02-15 11:12:21,928 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:12:21,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:12:21,929 INFO L82 PathProgramCache]: Analyzing trace with hash 175889954, now seen corresponding path program 15 times [2019-02-15 11:12:21,929 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:12:21,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:21,930 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:12:21,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:21,930 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:12:21,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:22,368 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 8 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:22,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:22,369 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:12:22,369 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:12:22,369 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:12:22,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:22,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 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:12:22,378 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:12:22,378 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:12:22,392 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:12:22,392 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:12:22,394 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:12:22,698 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 8 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:22,698 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:12:22,743 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 8 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:22,762 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:12:22,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 31 [2019-02-15 11:12:22,763 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:12:22,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-02-15 11:12:22,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-02-15 11:12:22,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=910, Unknown=0, NotChecked=0, Total=992 [2019-02-15 11:12:22,764 INFO L87 Difference]: Start difference. First operand 66 states and 68 transitions. Second operand 32 states. [2019-02-15 11:12:24,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:12:24,528 INFO L93 Difference]: Finished difference Result 139 states and 144 transitions. [2019-02-15 11:12:24,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-02-15 11:12:24,529 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 65 [2019-02-15 11:12:24,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:12:24,531 INFO L225 Difference]: With dead ends: 139 [2019-02-15 11:12:24,531 INFO L226 Difference]: Without dead ends: 105 [2019-02-15 11:12:24,532 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 116 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=245, Invalid=2205, Unknown=0, NotChecked=0, Total=2450 [2019-02-15 11:12:24,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-02-15 11:12:24,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 70. [2019-02-15 11:12:24,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-02-15 11:12:24,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2019-02-15 11:12:24,541 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 65 [2019-02-15 11:12:24,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:12:24,541 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2019-02-15 11:12:24,541 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-02-15 11:12:24,542 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2019-02-15 11:12:24,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-02-15 11:12:24,542 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:12:24,542 INFO L402 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1] [2019-02-15 11:12:24,543 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:12:24,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:12:24,543 INFO L82 PathProgramCache]: Analyzing trace with hash 2774089, now seen corresponding path program 16 times [2019-02-15 11:12:24,543 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:12:24,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:24,544 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:12:24,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:24,544 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:12:24,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:25,206 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 171 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:25,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:25,206 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:12:25,206 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:12:25,207 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:12:25,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:25,207 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:12:25,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:12:25,218 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:12:25,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:25,233 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:12:25,653 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 171 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:25,653 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:12:25,899 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 171 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:25,917 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:12:25,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 31 [2019-02-15 11:12:25,917 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:12:25,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-02-15 11:12:25,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-02-15 11:12:25,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=741, Unknown=0, NotChecked=0, Total=992 [2019-02-15 11:12:25,918 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand 32 states. [2019-02-15 11:12:26,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:12:26,298 INFO L93 Difference]: Finished difference Result 150 states and 154 transitions. [2019-02-15 11:12:26,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-02-15 11:12:26,298 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 69 [2019-02-15 11:12:26,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:12:26,299 INFO L225 Difference]: With dead ends: 150 [2019-02-15 11:12:26,299 INFO L226 Difference]: Without dead ends: 75 [2019-02-15 11:12:26,300 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 108 SyntacticMatches, 19 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 522 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=436, Invalid=1286, Unknown=0, NotChecked=0, Total=1722 [2019-02-15 11:12:26,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-02-15 11:12:26,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2019-02-15 11:12:26,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-02-15 11:12:26,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 75 transitions. [2019-02-15 11:12:26,309 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 75 transitions. Word has length 69 [2019-02-15 11:12:26,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:12:26,309 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 75 transitions. [2019-02-15 11:12:26,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-02-15 11:12:26,310 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2019-02-15 11:12:26,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-02-15 11:12:26,310 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:12:26,310 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 9, 9, 1, 1, 1, 1, 1] [2019-02-15 11:12:26,311 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:12:26,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:12:26,311 INFO L82 PathProgramCache]: Analyzing trace with hash 2036938705, now seen corresponding path program 17 times [2019-02-15 11:12:26,311 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:12:26,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:26,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:12:26,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:26,312 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:12:26,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:27,397 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 9 proven. 307 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:27,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:27,398 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:12:27,398 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:12:27,398 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:12:27,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:27,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 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:12:27,413 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:12:27,413 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:12:27,430 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-02-15 11:12:27,431 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:12:27,433 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:12:28,330 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 162 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:28,330 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:12:29,059 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 153 proven. 163 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:29,078 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:12:29,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24, 24] total 58 [2019-02-15 11:12:29,078 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:12:29,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-02-15 11:12:29,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-02-15 11:12:29,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=421, Invalid=3001, Unknown=0, NotChecked=0, Total=3422 [2019-02-15 11:12:29,080 INFO L87 Difference]: Start difference. First operand 73 states and 75 transitions. Second operand 47 states. [2019-02-15 11:12:30,207 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 25 [2019-02-15 11:12:31,773 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-02-15 11:12:33,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:12:33,736 INFO L93 Difference]: Finished difference Result 192 states and 198 transitions. [2019-02-15 11:12:33,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-02-15 11:12:33,737 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 72 [2019-02-15 11:12:33,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:12:33,738 INFO L225 Difference]: With dead ends: 192 [2019-02-15 11:12:33,738 INFO L226 Difference]: Without dead ends: 113 [2019-02-15 11:12:33,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 97 SyntacticMatches, 11 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3015 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=1319, Invalid=12723, Unknown=0, NotChecked=0, Total=14042 [2019-02-15 11:12:33,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-02-15 11:12:33,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 80. [2019-02-15 11:12:33,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-02-15 11:12:33,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 82 transitions. [2019-02-15 11:12:33,753 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 82 transitions. Word has length 72 [2019-02-15 11:12:33,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:12:33,753 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 82 transitions. [2019-02-15 11:12:33,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-02-15 11:12:33,753 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 82 transitions. [2019-02-15 11:12:33,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-02-15 11:12:33,753 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:12:33,753 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 1, 1, 1, 1, 1] [2019-02-15 11:12:33,754 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:12:33,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:12:33,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1070649840, now seen corresponding path program 18 times [2019-02-15 11:12:33,754 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:12:33,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:33,755 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:12:33,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:33,755 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:12:33,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:34,244 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 10 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:34,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:34,245 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:12:34,245 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:12:34,245 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:12:34,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:34,245 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:12:34,254 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:12:34,254 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:12:34,268 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:12:34,268 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:12:34,271 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:12:34,814 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 10 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:34,814 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:12:34,871 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 10 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:34,890 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:12:34,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 37 [2019-02-15 11:12:34,890 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:12:34,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-02-15 11:12:34,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-02-15 11:12:34,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1308, Unknown=0, NotChecked=0, Total=1406 [2019-02-15 11:12:34,891 INFO L87 Difference]: Start difference. First operand 80 states and 82 transitions. Second operand 38 states. [2019-02-15 11:12:37,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:12:37,227 INFO L93 Difference]: Finished difference Result 169 states and 174 transitions. [2019-02-15 11:12:37,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-02-15 11:12:37,230 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 79 [2019-02-15 11:12:37,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:12:37,231 INFO L225 Difference]: With dead ends: 169 [2019-02-15 11:12:37,231 INFO L226 Difference]: Without dead ends: 127 [2019-02-15 11:12:37,232 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 142 SyntacticMatches, 3 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=319, Invalid=3221, Unknown=0, NotChecked=0, Total=3540 [2019-02-15 11:12:37,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-02-15 11:12:37,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 84. [2019-02-15 11:12:37,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-02-15 11:12:37,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 86 transitions. [2019-02-15 11:12:37,240 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 86 transitions. Word has length 79 [2019-02-15 11:12:37,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:12:37,241 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 86 transitions. [2019-02-15 11:12:37,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-02-15 11:12:37,241 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2019-02-15 11:12:37,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-02-15 11:12:37,241 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:12:37,242 INFO L402 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1] [2019-02-15 11:12:37,242 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:12:37,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:12:37,242 INFO L82 PathProgramCache]: Analyzing trace with hash -685461225, now seen corresponding path program 19 times [2019-02-15 11:12:37,242 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:12:37,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:37,243 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:12:37,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:37,243 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:12:37,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:37,516 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 253 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:37,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:37,516 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:12:37,517 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:12:37,517 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:12:37,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:37,517 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:12:37,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:12:37,526 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:12:37,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:37,545 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:12:37,845 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 253 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:37,845 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:12:38,032 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 253 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:38,050 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:12:38,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 37 [2019-02-15 11:12:38,050 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:12:38,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-02-15 11:12:38,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-02-15 11:12:38,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=349, Invalid=1057, Unknown=0, NotChecked=0, Total=1406 [2019-02-15 11:12:38,052 INFO L87 Difference]: Start difference. First operand 84 states and 86 transitions. Second operand 38 states. [2019-02-15 11:12:38,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:12:38,561 INFO L93 Difference]: Finished difference Result 180 states and 184 transitions. [2019-02-15 11:12:38,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-02-15 11:12:38,562 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 83 [2019-02-15 11:12:38,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:12:38,563 INFO L225 Difference]: With dead ends: 180 [2019-02-15 11:12:38,563 INFO L226 Difference]: Without dead ends: 89 [2019-02-15 11:12:38,565 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 130 SyntacticMatches, 23 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 770 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=607, Invalid=1843, Unknown=0, NotChecked=0, Total=2450 [2019-02-15 11:12:38,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-02-15 11:12:38,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2019-02-15 11:12:38,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-02-15 11:12:38,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 89 transitions. [2019-02-15 11:12:38,577 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 89 transitions. Word has length 83 [2019-02-15 11:12:38,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:12:38,577 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 89 transitions. [2019-02-15 11:12:38,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-02-15 11:12:38,578 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 89 transitions. [2019-02-15 11:12:38,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-02-15 11:12:38,578 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:12:38,578 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 11, 11, 11, 1, 1, 1, 1, 1] [2019-02-15 11:12:38,579 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:12:38,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:12:38,579 INFO L82 PathProgramCache]: Analyzing trace with hash -1750415713, now seen corresponding path program 20 times [2019-02-15 11:12:38,579 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:12:38,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:38,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:12:38,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:38,580 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:12:38,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:39,179 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 11 proven. 452 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:39,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:39,180 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:12:39,180 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:12:39,180 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:12:39,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:39,180 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:12:39,190 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:12:39,191 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:12:39,214 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-02-15 11:12:39,214 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:12:39,216 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:12:40,286 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 242 proven. 221 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:40,286 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:12:41,510 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 231 proven. 232 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:41,529 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:12:41,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 28, 28] total 68 [2019-02-15 11:12:41,529 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:12:41,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-02-15 11:12:41,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-02-15 11:12:41,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=560, Invalid=4132, Unknown=0, NotChecked=0, Total=4692 [2019-02-15 11:12:41,531 INFO L87 Difference]: Start difference. First operand 87 states and 89 transitions. Second operand 55 states. [2019-02-15 11:12:47,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:12:47,835 INFO L93 Difference]: Finished difference Result 230 states and 236 transitions. [2019-02-15 11:12:47,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-02-15 11:12:47,835 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 86 [2019-02-15 11:12:47,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:12:47,837 INFO L225 Difference]: With dead ends: 230 [2019-02-15 11:12:47,837 INFO L226 Difference]: Without dead ends: 135 [2019-02-15 11:12:47,841 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 117 SyntacticMatches, 13 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4250 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=1745, Invalid=17995, Unknown=0, NotChecked=0, Total=19740 [2019-02-15 11:12:47,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-02-15 11:12:47,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 94. [2019-02-15 11:12:47,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-02-15 11:12:47,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 96 transitions. [2019-02-15 11:12:47,852 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 96 transitions. Word has length 86 [2019-02-15 11:12:47,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:12:47,852 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 96 transitions. [2019-02-15 11:12:47,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-02-15 11:12:47,852 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 96 transitions. [2019-02-15 11:12:47,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-02-15 11:12:47,853 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:12:47,853 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 1, 1, 1, 1, 1] [2019-02-15 11:12:47,853 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:12:47,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:12:47,854 INFO L82 PathProgramCache]: Analyzing trace with hash 2005850046, now seen corresponding path program 21 times [2019-02-15 11:12:47,854 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:12:47,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:47,855 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:12:47,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:47,855 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:12:47,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:48,508 INFO L134 CoverageAnalysis]: Checked inductivity of 547 backedges. 12 proven. 535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:48,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:48,509 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:12:48,509 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:12:48,509 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:12:48,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:48,509 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:12:48,518 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:12:48,518 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:12:48,533 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:12:48,533 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:12:48,536 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:12:49,049 INFO L134 CoverageAnalysis]: Checked inductivity of 547 backedges. 12 proven. 535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:49,049 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:12:49,123 INFO L134 CoverageAnalysis]: Checked inductivity of 547 backedges. 12 proven. 535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:49,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:12:49,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28, 28] total 43 [2019-02-15 11:12:49,141 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:12:49,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-02-15 11:12:49,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-02-15 11:12:49,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1778, Unknown=0, NotChecked=0, Total=1892 [2019-02-15 11:12:49,142 INFO L87 Difference]: Start difference. First operand 94 states and 96 transitions. Second operand 44 states. [2019-02-15 11:12:52,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:12:52,492 INFO L93 Difference]: Finished difference Result 199 states and 204 transitions. [2019-02-15 11:12:52,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-02-15 11:12:52,492 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 93 [2019-02-15 11:12:52,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:12:52,494 INFO L225 Difference]: With dead ends: 199 [2019-02-15 11:12:52,494 INFO L226 Difference]: Without dead ends: 149 [2019-02-15 11:12:52,495 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 168 SyntacticMatches, 3 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 764 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=401, Invalid=4429, Unknown=0, NotChecked=0, Total=4830 [2019-02-15 11:12:52,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-02-15 11:12:52,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 98. [2019-02-15 11:12:52,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-02-15 11:12:52,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 100 transitions. [2019-02-15 11:12:52,507 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 100 transitions. Word has length 93 [2019-02-15 11:12:52,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:12:52,508 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 100 transitions. [2019-02-15 11:12:52,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-02-15 11:12:52,508 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 100 transitions. [2019-02-15 11:12:52,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-02-15 11:12:52,509 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:12:52,509 INFO L402 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1] [2019-02-15 11:12:52,509 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:12:52,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:12:52,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1370431461, now seen corresponding path program 22 times [2019-02-15 11:12:52,509 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:12:52,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:52,510 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:12:52,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:52,510 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:12:52,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:52,987 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 351 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:52,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:52,987 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:12:52,988 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:12:52,988 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:12:52,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:52,988 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:12:52,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:12:52,997 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:12:53,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:53,017 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:12:53,375 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 351 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:53,376 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:12:54,673 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 351 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:54,691 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:12:54,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 43 [2019-02-15 11:12:54,691 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:12:54,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-02-15 11:12:54,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-02-15 11:12:54,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=463, Invalid=1429, Unknown=0, NotChecked=0, Total=1892 [2019-02-15 11:12:54,693 INFO L87 Difference]: Start difference. First operand 98 states and 100 transitions. Second operand 44 states. [2019-02-15 11:12:55,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:12:55,377 INFO L93 Difference]: Finished difference Result 210 states and 214 transitions. [2019-02-15 11:12:55,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-02-15 11:12:55,378 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 97 [2019-02-15 11:12:55,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:12:55,379 INFO L225 Difference]: With dead ends: 210 [2019-02-15 11:12:55,379 INFO L226 Difference]: Without dead ends: 103 [2019-02-15 11:12:55,379 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 152 SyntacticMatches, 27 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1066 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=806, Invalid=2500, Unknown=0, NotChecked=0, Total=3306 [2019-02-15 11:12:55,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-02-15 11:12:55,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2019-02-15 11:12:55,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-02-15 11:12:55,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 103 transitions. [2019-02-15 11:12:55,394 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 103 transitions. Word has length 97 [2019-02-15 11:12:55,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:12:55,395 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 103 transitions. [2019-02-15 11:12:55,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-02-15 11:12:55,395 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 103 transitions. [2019-02-15 11:12:55,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-02-15 11:12:55,395 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:12:55,395 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 1, 1, 1, 1, 1] [2019-02-15 11:12:55,396 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:12:55,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:12:55,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1811736429, now seen corresponding path program 23 times [2019-02-15 11:12:55,396 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:12:55,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:55,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:12:55,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:12:55,397 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:12:55,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:12:56,473 INFO L134 CoverageAnalysis]: Checked inductivity of 638 backedges. 13 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:56,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:56,473 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:12:56,473 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:12:56,473 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:12:56,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:12:56,473 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:12:56,481 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:12:56,482 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:12:56,510 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-02-15 11:12:56,510 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:12:56,512 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:12:57,195 INFO L134 CoverageAnalysis]: Checked inductivity of 638 backedges. 13 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:57,196 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:12:57,275 INFO L134 CoverageAnalysis]: Checked inductivity of 638 backedges. 13 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:12:57,302 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:12:57,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30, 30] total 46 [2019-02-15 11:12:57,303 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:12:57,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-02-15 11:12:57,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-02-15 11:12:57,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=2040, Unknown=0, NotChecked=0, Total=2162 [2019-02-15 11:12:57,304 INFO L87 Difference]: Start difference. First operand 101 states and 103 transitions. Second operand 47 states. [2019-02-15 11:13:00,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:13:00,772 INFO L93 Difference]: Finished difference Result 214 states and 219 transitions. [2019-02-15 11:13:00,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-02-15 11:13:00,773 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 100 [2019-02-15 11:13:00,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:13:00,774 INFO L225 Difference]: With dead ends: 214 [2019-02-15 11:13:00,774 INFO L226 Difference]: Without dead ends: 160 [2019-02-15 11:13:00,775 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 181 SyntacticMatches, 3 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 878 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=445, Invalid=5105, Unknown=0, NotChecked=0, Total=5550 [2019-02-15 11:13:00,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-02-15 11:13:00,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 105. [2019-02-15 11:13:00,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-02-15 11:13:00,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 107 transitions. [2019-02-15 11:13:00,791 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 107 transitions. Word has length 100 [2019-02-15 11:13:00,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:13:00,791 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 107 transitions. [2019-02-15 11:13:00,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-02-15 11:13:00,791 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 107 transitions. [2019-02-15 11:13:00,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-02-15 11:13:00,792 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:13:00,792 INFO L402 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1] [2019-02-15 11:13:00,792 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:13:00,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:13:00,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1008713748, now seen corresponding path program 24 times [2019-02-15 11:13:00,792 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:13:00,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:13:00,793 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:13:00,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:13:00,793 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:13:00,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:13:01,361 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 406 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:13:01,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:13:01,362 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:13:01,362 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:13:01,362 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:13:01,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:13:01,362 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:13:01,372 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:13:01,372 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:13:01,388 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:13:01,389 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:13:01,390 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:13:01,784 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 406 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:13:01,784 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:13:02,062 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 406 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:13:02,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:13:02,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 46 [2019-02-15 11:13:02,081 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:13:02,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-02-15 11:13:02,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-02-15 11:13:02,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=526, Invalid=1636, Unknown=0, NotChecked=0, Total=2162 [2019-02-15 11:13:02,082 INFO L87 Difference]: Start difference. First operand 105 states and 107 transitions. Second operand 47 states. [2019-02-15 11:13:02,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:13:02,687 INFO L93 Difference]: Finished difference Result 225 states and 229 transitions. [2019-02-15 11:13:02,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-02-15 11:13:02,687 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 104 [2019-02-15 11:13:02,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:13:02,688 INFO L225 Difference]: With dead ends: 225 [2019-02-15 11:13:02,688 INFO L226 Difference]: Without dead ends: 110 [2019-02-15 11:13:02,689 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 163 SyntacticMatches, 29 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1232 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=916, Invalid=2866, Unknown=0, NotChecked=0, Total=3782 [2019-02-15 11:13:02,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-02-15 11:13:02,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2019-02-15 11:13:02,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-02-15 11:13:02,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 110 transitions. [2019-02-15 11:13:02,708 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 110 transitions. Word has length 104 [2019-02-15 11:13:02,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:13:02,708 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 110 transitions. [2019-02-15 11:13:02,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-02-15 11:13:02,708 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 110 transitions. [2019-02-15 11:13:02,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-02-15 11:13:02,709 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:13:02,709 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 14, 14, 14, 1, 1, 1, 1, 1] [2019-02-15 11:13:02,709 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:13:02,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:13:02,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1699483764, now seen corresponding path program 25 times [2019-02-15 11:13:02,710 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:13:02,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:13:02,710 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:13:02,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:13:02,711 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:13:02,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:13:03,527 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 14 proven. 722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:13:03,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:13:03,527 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:13:03,527 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:13:03,527 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:13:03,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:13:03,528 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:13:03,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:13:03,537 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:13:03,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:13:03,560 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:13:04,183 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 14 proven. 722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:13:04,183 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:13:04,262 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 14 proven. 722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:13:04,281 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:13:04,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 32, 32] total 49 [2019-02-15 11:13:04,281 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:13:04,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-02-15 11:13:04,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-02-15 11:13:04,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=2320, Unknown=0, NotChecked=0, Total=2450 [2019-02-15 11:13:04,282 INFO L87 Difference]: Start difference. First operand 108 states and 110 transitions. Second operand 50 states. [2019-02-15 11:13:09,092 WARN L181 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-02-15 11:13:09,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:13:09,393 INFO L93 Difference]: Finished difference Result 229 states and 234 transitions. [2019-02-15 11:13:09,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-02-15 11:13:09,394 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 107 [2019-02-15 11:13:09,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:13:09,394 INFO L225 Difference]: With dead ends: 229 [2019-02-15 11:13:09,395 INFO L226 Difference]: Without dead ends: 171 [2019-02-15 11:13:09,396 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 194 SyntacticMatches, 3 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1000 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=491, Invalid=5829, Unknown=0, NotChecked=0, Total=6320 [2019-02-15 11:13:09,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-02-15 11:13:09,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 112. [2019-02-15 11:13:09,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-02-15 11:13:09,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 114 transitions. [2019-02-15 11:13:09,417 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 114 transitions. Word has length 107 [2019-02-15 11:13:09,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:13:09,417 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 114 transitions. [2019-02-15 11:13:09,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-02-15 11:13:09,417 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 114 transitions. [2019-02-15 11:13:09,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-02-15 11:13:09,418 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:13:09,418 INFO L402 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1] [2019-02-15 11:13:09,418 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:13:09,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:13:09,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1446534989, now seen corresponding path program 26 times [2019-02-15 11:13:09,419 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:13:09,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:13:09,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:13:09,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:13:09,420 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:13:09,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:13:09,874 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 465 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:13:09,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:13:09,874 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:13:09,874 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:13:09,874 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:13:09,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:13:09,875 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:13:09,886 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:13:09,886 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:13:09,913 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-02-15 11:13:09,913 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:13:09,917 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:13:10,362 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 465 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:13:10,362 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:13:10,673 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 465 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:13:10,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:13:10,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 49 [2019-02-15 11:13:10,693 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:13:10,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-02-15 11:13:10,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-02-15 11:13:10,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=593, Invalid=1857, Unknown=0, NotChecked=0, Total=2450 [2019-02-15 11:13:10,694 INFO L87 Difference]: Start difference. First operand 112 states and 114 transitions. Second operand 50 states. [2019-02-15 11:13:11,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:13:11,397 INFO L93 Difference]: Finished difference Result 240 states and 244 transitions. [2019-02-15 11:13:11,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-02-15 11:13:11,398 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 111 [2019-02-15 11:13:11,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:13:11,399 INFO L225 Difference]: With dead ends: 240 [2019-02-15 11:13:11,399 INFO L226 Difference]: Without dead ends: 117 [2019-02-15 11:13:11,400 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 174 SyntacticMatches, 31 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1410 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1033, Invalid=3257, Unknown=0, NotChecked=0, Total=4290 [2019-02-15 11:13:11,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-02-15 11:13:11,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2019-02-15 11:13:11,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-02-15 11:13:11,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 117 transitions. [2019-02-15 11:13:11,418 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 117 transitions. Word has length 111 [2019-02-15 11:13:11,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:13:11,418 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 117 transitions. [2019-02-15 11:13:11,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-02-15 11:13:11,418 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 117 transitions. [2019-02-15 11:13:11,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-02-15 11:13:11,419 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:13:11,419 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 15, 15, 15, 1, 1, 1, 1, 1] [2019-02-15 11:13:11,419 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:13:11,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:13:11,420 INFO L82 PathProgramCache]: Analyzing trace with hash -2055366085, now seen corresponding path program 27 times [2019-02-15 11:13:11,420 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:13:11,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:13:11,421 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:13:11,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:13:11,421 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:13:11,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:13:12,258 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 15 proven. 826 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:13:12,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:13:12,258 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:13:12,258 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:13:12,258 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:13:12,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:13:12,258 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:13:12,268 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:13:12,268 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:13:12,289 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:13:12,289 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:13:12,292 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:13:13,012 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 15 proven. 826 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:13:13,012 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:13:13,096 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 15 proven. 826 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:13:13,116 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:13:13,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34, 34] total 52 [2019-02-15 11:13:13,116 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:13:13,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-02-15 11:13:13,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-02-15 11:13:13,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=2618, Unknown=0, NotChecked=0, Total=2756 [2019-02-15 11:13:13,117 INFO L87 Difference]: Start difference. First operand 115 states and 117 transitions. Second operand 53 states. [2019-02-15 11:13:18,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:13:18,283 INFO L93 Difference]: Finished difference Result 244 states and 249 transitions. [2019-02-15 11:13:18,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-02-15 11:13:18,284 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 114 [2019-02-15 11:13:18,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:13:18,286 INFO L225 Difference]: With dead ends: 244 [2019-02-15 11:13:18,286 INFO L226 Difference]: Without dead ends: 182 [2019-02-15 11:13:18,287 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 207 SyntacticMatches, 3 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1130 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=539, Invalid=6601, Unknown=0, NotChecked=0, Total=7140 [2019-02-15 11:13:18,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-02-15 11:13:18,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 119. [2019-02-15 11:13:18,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-02-15 11:13:18,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 121 transitions. [2019-02-15 11:13:18,309 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 121 transitions. Word has length 114 [2019-02-15 11:13:18,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:13:18,310 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 121 transitions. [2019-02-15 11:13:18,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-02-15 11:13:18,310 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 121 transitions. [2019-02-15 11:13:18,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-02-15 11:13:18,311 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:13:18,311 INFO L402 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1] [2019-02-15 11:13:18,311 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:13:18,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:13:18,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1833851874, now seen corresponding path program 28 times [2019-02-15 11:13:18,312 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:13:18,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:13:18,312 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:13:18,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:13:18,313 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:13:18,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:13:18,889 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 528 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:13:18,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:13:18,889 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:13:18,889 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:13:18,889 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:13:18,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:13:18,889 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:13:18,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:13:18,900 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:13:18,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:13:18,921 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:13:19,413 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 528 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:13:19,413 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:13:19,817 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 528 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:13:19,837 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:13:19,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 52 [2019-02-15 11:13:19,837 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:13:19,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-02-15 11:13:19,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-02-15 11:13:19,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=664, Invalid=2092, Unknown=0, NotChecked=0, Total=2756 [2019-02-15 11:13:19,838 INFO L87 Difference]: Start difference. First operand 119 states and 121 transitions. Second operand 53 states. [2019-02-15 11:13:20,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:13:20,751 INFO L93 Difference]: Finished difference Result 255 states and 259 transitions. [2019-02-15 11:13:20,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-02-15 11:13:20,751 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 118 [2019-02-15 11:13:20,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:13:20,752 INFO L225 Difference]: With dead ends: 255 [2019-02-15 11:13:20,752 INFO L226 Difference]: Without dead ends: 124 [2019-02-15 11:13:20,753 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 185 SyntacticMatches, 33 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1600 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1157, Invalid=3673, Unknown=0, NotChecked=0, Total=4830 [2019-02-15 11:13:20,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-02-15 11:13:20,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2019-02-15 11:13:20,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-02-15 11:13:20,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 124 transitions. [2019-02-15 11:13:20,771 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 124 transitions. Word has length 118 [2019-02-15 11:13:20,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:13:20,771 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 124 transitions. [2019-02-15 11:13:20,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-02-15 11:13:20,771 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 124 transitions. [2019-02-15 11:13:20,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-02-15 11:13:20,772 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:13:20,772 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 16, 16, 16, 1, 1, 1, 1, 1] [2019-02-15 11:13:20,772 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:13:20,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:13:20,773 INFO L82 PathProgramCache]: Analyzing trace with hash 540940634, now seen corresponding path program 29 times [2019-02-15 11:13:20,773 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:13:20,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:13:20,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:13:20,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:13:20,774 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:13:20,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:13:21,875 INFO L134 CoverageAnalysis]: Checked inductivity of 953 backedges. 16 proven. 937 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:13:21,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:13:21,875 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:13:21,875 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:13:21,875 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:13:21,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:13:21,875 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:13:21,885 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:13:21,885 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:13:21,916 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-02-15 11:13:21,917 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:13:21,919 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:13:23,852 INFO L134 CoverageAnalysis]: Checked inductivity of 953 backedges. 512 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:13:23,852 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:13:25,627 INFO L134 CoverageAnalysis]: Checked inductivity of 953 backedges. 496 proven. 457 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:13:25,645 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:13:25,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 38, 38] total 93 [2019-02-15 11:13:25,645 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:13:25,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-02-15 11:13:25,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-02-15 11:13:25,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=995, Invalid=7747, Unknown=0, NotChecked=0, Total=8742 [2019-02-15 11:13:25,646 INFO L87 Difference]: Start difference. First operand 122 states and 124 transitions. Second operand 75 states. [2019-02-15 11:13:36,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:13:36,036 INFO L93 Difference]: Finished difference Result 325 states and 331 transitions. [2019-02-15 11:13:36,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2019-02-15 11:13:36,037 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 121 [2019-02-15 11:13:36,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:13:36,038 INFO L225 Difference]: With dead ends: 325 [2019-02-15 11:13:36,038 INFO L226 Difference]: Without dead ends: 190 [2019-02-15 11:13:36,041 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 167 SyntacticMatches, 18 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8265 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=3055, Invalid=35165, Unknown=0, NotChecked=0, Total=38220 [2019-02-15 11:13:36,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-02-15 11:13:36,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 129. [2019-02-15 11:13:36,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-02-15 11:13:36,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 131 transitions. [2019-02-15 11:13:36,058 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 131 transitions. Word has length 121 [2019-02-15 11:13:36,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:13:36,058 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 131 transitions. [2019-02-15 11:13:36,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-02-15 11:13:36,059 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 131 transitions. [2019-02-15 11:13:36,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-02-15 11:13:36,059 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:13:36,059 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 17, 17, 17, 1, 1, 1, 1, 1] [2019-02-15 11:13:36,059 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:13:36,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:13:36,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1991581943, now seen corresponding path program 30 times [2019-02-15 11:13:36,060 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:13:36,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:13:36,060 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:13:36,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:13:36,061 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:13:36,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:13:37,679 INFO L134 CoverageAnalysis]: Checked inductivity of 1072 backedges. 17 proven. 1055 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:13:37,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:13:37,680 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:13:37,680 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:13:37,680 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:13:37,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:13:37,680 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:13:37,701 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:13:37,701 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:13:37,735 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:13:37,735 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:13:37,739 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:13:38,689 INFO L134 CoverageAnalysis]: Checked inductivity of 1072 backedges. 17 proven. 1055 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:13:38,690 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:13:38,821 INFO L134 CoverageAnalysis]: Checked inductivity of 1072 backedges. 17 proven. 1055 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:13:38,840 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:13:38,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 38, 38] total 58 [2019-02-15 11:13:38,840 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:13:38,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-02-15 11:13:38,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-02-15 11:13:38,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=3268, Unknown=0, NotChecked=0, Total=3422 [2019-02-15 11:13:38,841 INFO L87 Difference]: Start difference. First operand 129 states and 131 transitions. Second operand 59 states. [2019-02-15 11:13:44,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:13:44,550 INFO L93 Difference]: Finished difference Result 274 states and 279 transitions. [2019-02-15 11:13:44,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-02-15 11:13:44,550 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 128 [2019-02-15 11:13:44,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:13:44,552 INFO L225 Difference]: With dead ends: 274 [2019-02-15 11:13:44,552 INFO L226 Difference]: Without dead ends: 204 [2019-02-15 11:13:44,553 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 233 SyntacticMatches, 3 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1414 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=641, Invalid=8289, Unknown=0, NotChecked=0, Total=8930 [2019-02-15 11:13:44,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-02-15 11:13:44,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 133. [2019-02-15 11:13:44,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-02-15 11:13:44,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 135 transitions. [2019-02-15 11:13:44,575 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 135 transitions. Word has length 128 [2019-02-15 11:13:44,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:13:44,575 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 135 transitions. [2019-02-15 11:13:44,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-02-15 11:13:44,575 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 135 transitions. [2019-02-15 11:13:44,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-02-15 11:13:44,576 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:13:44,576 INFO L402 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1] [2019-02-15 11:13:44,576 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:13:44,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:13:44,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1942976080, now seen corresponding path program 31 times [2019-02-15 11:13:44,576 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:13:44,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:13:44,577 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:13:44,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:13:44,577 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:13:44,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:13:45,566 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 666 proven. 477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:13:45,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:13:45,567 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:13:45,567 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:13:45,567 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:13:45,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:13:45,567 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:13:45,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:13:45,578 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:13:45,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:13:45,605 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:13:46,256 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 666 proven. 477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:13:46,256 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:13:46,687 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 666 proven. 477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:13:46,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:13:46,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 58 [2019-02-15 11:13:46,706 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:13:46,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-02-15 11:13:46,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-02-15 11:13:46,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=818, Invalid=2604, Unknown=0, NotChecked=0, Total=3422 [2019-02-15 11:13:46,707 INFO L87 Difference]: Start difference. First operand 133 states and 135 transitions. Second operand 59 states. [2019-02-15 11:13:47,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:13:47,881 INFO L93 Difference]: Finished difference Result 285 states and 289 transitions. [2019-02-15 11:13:47,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-02-15 11:13:47,882 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 132 [2019-02-15 11:13:47,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:13:47,883 INFO L225 Difference]: With dead ends: 285 [2019-02-15 11:13:47,883 INFO L226 Difference]: Without dead ends: 138 [2019-02-15 11:13:47,884 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 207 SyntacticMatches, 37 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2016 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1426, Invalid=4580, Unknown=0, NotChecked=0, Total=6006 [2019-02-15 11:13:47,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-02-15 11:13:47,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2019-02-15 11:13:47,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-02-15 11:13:47,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 138 transitions. [2019-02-15 11:13:47,909 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 138 transitions. Word has length 132 [2019-02-15 11:13:47,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:13:47,910 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 138 transitions. [2019-02-15 11:13:47,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-02-15 11:13:47,910 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 138 transitions. [2019-02-15 11:13:47,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-02-15 11:13:47,910 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:13:47,910 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 18, 18, 18, 1, 1, 1, 1, 1] [2019-02-15 11:13:47,911 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:13:47,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:13:47,911 INFO L82 PathProgramCache]: Analyzing trace with hash 220943656, now seen corresponding path program 32 times [2019-02-15 11:13:47,911 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:13:47,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:13:47,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:13:47,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:13:47,912 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:13:47,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:13:49,056 INFO L134 CoverageAnalysis]: Checked inductivity of 1198 backedges. 18 proven. 1180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:13:49,057 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:13:49,057 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:13:49,057 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:13:49,057 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:13:49,057 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:13:49,057 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:13:49,067 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:13:49,067 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:13:49,109 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-02-15 11:13:49,110 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:13:49,113 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:13:51,575 INFO L134 CoverageAnalysis]: Checked inductivity of 1198 backedges. 648 proven. 550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:13:51,575 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:13:54,013 INFO L134 CoverageAnalysis]: Checked inductivity of 1198 backedges. 630 proven. 568 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:13:54,032 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:13:54,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 42, 42] total 103 [2019-02-15 11:13:54,033 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:13:54,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-02-15 11:13:54,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-02-15 11:13:54,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1204, Invalid=9508, Unknown=0, NotChecked=0, Total=10712 [2019-02-15 11:13:54,034 INFO L87 Difference]: Start difference. First operand 136 states and 138 transitions. Second operand 83 states. [2019-02-15 11:14:05,162 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2019-02-15 11:14:05,457 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2019-02-15 11:14:08,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:14:08,132 INFO L93 Difference]: Finished difference Result 363 states and 369 transitions. [2019-02-15 11:14:08,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2019-02-15 11:14:08,132 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 135 [2019-02-15 11:14:08,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:14:08,134 INFO L225 Difference]: With dead ends: 363 [2019-02-15 11:14:08,134 INFO L226 Difference]: Without dead ends: 212 [2019-02-15 11:14:08,136 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 187 SyntacticMatches, 20 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10242 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=3677, Invalid=43629, Unknown=0, NotChecked=0, Total=47306 [2019-02-15 11:14:08,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-02-15 11:14:08,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 143. [2019-02-15 11:14:08,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-02-15 11:14:08,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 145 transitions. [2019-02-15 11:14:08,161 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 145 transitions. Word has length 135 [2019-02-15 11:14:08,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:14:08,161 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 145 transitions. [2019-02-15 11:14:08,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-02-15 11:14:08,161 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 145 transitions. [2019-02-15 11:14:08,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-02-15 11:14:08,162 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:14:08,162 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 19, 19, 19, 1, 1, 1, 1, 1] [2019-02-15 11:14:08,162 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:14:08,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:14:08,162 INFO L82 PathProgramCache]: Analyzing trace with hash 847427031, now seen corresponding path program 33 times [2019-02-15 11:14:08,162 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:14:08,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:14:08,163 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:14:08,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:14:08,163 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:14:08,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:14:09,534 INFO L134 CoverageAnalysis]: Checked inductivity of 1331 backedges. 19 proven. 1312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:14:09,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:14:09,534 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:14:09,534 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:14:09,534 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:14:09,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:14:09,534 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:14:09,556 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:14:09,557 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:14:09,591 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:14:09,591 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:14:09,596 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:14:10,708 INFO L134 CoverageAnalysis]: Checked inductivity of 1331 backedges. 19 proven. 1312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:14:10,708 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:14:10,852 INFO L134 CoverageAnalysis]: Checked inductivity of 1331 backedges. 19 proven. 1312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:14:10,869 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:14:10,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 42, 42] total 64 [2019-02-15 11:14:10,870 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:14:10,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-02-15 11:14:10,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-02-15 11:14:10,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=3990, Unknown=0, NotChecked=0, Total=4160 [2019-02-15 11:14:10,871 INFO L87 Difference]: Start difference. First operand 143 states and 145 transitions. Second operand 65 states. [2019-02-15 11:14:15,259 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2019-02-15 11:14:15,537 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2019-02-15 11:14:15,805 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2019-02-15 11:14:17,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:14:17,854 INFO L93 Difference]: Finished difference Result 304 states and 309 transitions. [2019-02-15 11:14:17,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-02-15 11:14:17,855 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 142 [2019-02-15 11:14:17,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:14:17,856 INFO L225 Difference]: With dead ends: 304 [2019-02-15 11:14:17,856 INFO L226 Difference]: Without dead ends: 226 [2019-02-15 11:14:17,856 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 259 SyntacticMatches, 3 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1730 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=751, Invalid=10169, Unknown=0, NotChecked=0, Total=10920 [2019-02-15 11:14:17,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-02-15 11:14:17,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 147. [2019-02-15 11:14:17,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-02-15 11:14:17,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 149 transitions. [2019-02-15 11:14:17,877 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 149 transitions. Word has length 142 [2019-02-15 11:14:17,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:14:17,878 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 149 transitions. [2019-02-15 11:14:17,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-02-15 11:14:17,878 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 149 transitions. [2019-02-15 11:14:17,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-02-15 11:14:17,879 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:14:17,879 INFO L402 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1] [2019-02-15 11:14:17,879 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:14:17,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:14:17,879 INFO L82 PathProgramCache]: Analyzing trace with hash -1796978306, now seen corresponding path program 34 times [2019-02-15 11:14:17,880 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:14:17,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:14:17,880 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:14:17,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:14:17,880 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:14:17,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:14:18,633 INFO L134 CoverageAnalysis]: Checked inductivity of 1410 backedges. 820 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:14:18,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:14:18,633 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:14:18,634 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:14:18,634 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:14:18,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:14:18,634 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:14:18,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:14:18,643 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:14:18,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:14:18,675 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:14:19,485 INFO L134 CoverageAnalysis]: Checked inductivity of 1410 backedges. 820 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:14:19,485 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:14:20,007 INFO L134 CoverageAnalysis]: Checked inductivity of 1410 backedges. 820 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:14:20,027 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:14:20,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 64 [2019-02-15 11:14:20,027 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:14:20,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-02-15 11:14:20,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-02-15 11:14:20,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=988, Invalid=3172, Unknown=0, NotChecked=0, Total=4160 [2019-02-15 11:14:20,028 INFO L87 Difference]: Start difference. First operand 147 states and 149 transitions. Second operand 65 states. [2019-02-15 11:14:21,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:14:21,395 INFO L93 Difference]: Finished difference Result 315 states and 319 transitions. [2019-02-15 11:14:21,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-02-15 11:14:21,396 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 146 [2019-02-15 11:14:21,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:14:21,397 INFO L225 Difference]: With dead ends: 315 [2019-02-15 11:14:21,397 INFO L226 Difference]: Without dead ends: 152 [2019-02-15 11:14:21,398 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 229 SyntacticMatches, 41 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2480 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1723, Invalid=5587, Unknown=0, NotChecked=0, Total=7310 [2019-02-15 11:14:21,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-02-15 11:14:21,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 150. [2019-02-15 11:14:21,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-02-15 11:14:21,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 152 transitions. [2019-02-15 11:14:21,432 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 152 transitions. Word has length 146 [2019-02-15 11:14:21,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:14:21,432 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 152 transitions. [2019-02-15 11:14:21,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-02-15 11:14:21,432 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 152 transitions. [2019-02-15 11:14:21,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-02-15 11:14:21,433 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:14:21,433 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 20, 20, 20, 1, 1, 1, 1, 1] [2019-02-15 11:14:21,434 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:14:21,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:14:21,434 INFO L82 PathProgramCache]: Analyzing trace with hash -193355018, now seen corresponding path program 35 times [2019-02-15 11:14:21,434 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:14:21,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:14:21,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:14:21,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:14:21,435 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:14:21,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:14:23,216 INFO L134 CoverageAnalysis]: Checked inductivity of 1471 backedges. 20 proven. 1451 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:14:23,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:14:23,217 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:14:23,217 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:14:23,217 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:14:23,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:14:23,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 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:14:23,227 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:14:23,227 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:14:23,268 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-02-15 11:14:23,269 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:14:23,272 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:14:26,125 INFO L134 CoverageAnalysis]: Checked inductivity of 1471 backedges. 800 proven. 671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:14:26,126 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:14:28,965 INFO L134 CoverageAnalysis]: Checked inductivity of 1471 backedges. 780 proven. 691 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:14:28,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:14:28,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 46, 46] total 113 [2019-02-15 11:14:28,984 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:14:28,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-02-15 11:14:28,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-02-15 11:14:28,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1433, Invalid=11449, Unknown=0, NotChecked=0, Total=12882 [2019-02-15 11:14:28,985 INFO L87 Difference]: Start difference. First operand 150 states and 152 transitions. Second operand 91 states. [2019-02-15 11:14:40,870 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2019-02-15 11:14:41,179 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2019-02-15 11:14:41,493 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2019-02-15 11:14:41,760 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-15 11:14:44,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:14:44,540 INFO L93 Difference]: Finished difference Result 401 states and 407 transitions. [2019-02-15 11:14:44,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2019-02-15 11:14:44,541 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 149 [2019-02-15 11:14:44,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:14:44,543 INFO L225 Difference]: With dead ends: 401 [2019-02-15 11:14:44,543 INFO L226 Difference]: Without dead ends: 234 [2019-02-15 11:14:44,545 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 467 GetRequests, 207 SyntacticMatches, 22 SemanticMatches, 238 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12431 ImplicationChecksByTransitivity, 19.1s TimeCoverageRelationStatistics Valid=4355, Invalid=53005, Unknown=0, NotChecked=0, Total=57360 [2019-02-15 11:14:44,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-02-15 11:14:44,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 157. [2019-02-15 11:14:44,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-02-15 11:14:44,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 159 transitions. [2019-02-15 11:14:44,573 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 159 transitions. Word has length 149 [2019-02-15 11:14:44,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:14:44,573 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 159 transitions. [2019-02-15 11:14:44,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-02-15 11:14:44,574 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 159 transitions. [2019-02-15 11:14:44,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-02-15 11:14:44,574 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:14:44,575 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 21, 21, 21, 1, 1, 1, 1, 1] [2019-02-15 11:14:44,575 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:14:44,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:14:44,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1380130469, now seen corresponding path program 36 times [2019-02-15 11:14:44,575 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:14:44,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:14:44,576 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:14:44,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:14:44,576 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:14:44,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:14:46,581 INFO L134 CoverageAnalysis]: Checked inductivity of 1618 backedges. 21 proven. 1597 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:14:46,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:14:46,581 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:14:46,581 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:14:46,581 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:14:46,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:14:46,581 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:14:46,592 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:14:46,592 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:14:46,620 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:14:46,620 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:14:46,624 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:14:48,795 INFO L134 CoverageAnalysis]: Checked inductivity of 1618 backedges. 21 proven. 1597 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:14:48,795 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:14:48,921 INFO L134 CoverageAnalysis]: Checked inductivity of 1618 backedges. 21 proven. 1597 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:14:48,939 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:14:48,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 46, 46] total 70 [2019-02-15 11:14:48,940 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:14:48,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-02-15 11:14:48,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-02-15 11:14:48,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=4784, Unknown=0, NotChecked=0, Total=4970 [2019-02-15 11:14:48,941 INFO L87 Difference]: Start difference. First operand 157 states and 159 transitions. Second operand 71 states. [2019-02-15 11:14:54,670 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-02-15 11:14:54,980 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-02-15 11:14:55,280 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2019-02-15 11:14:55,482 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-15 11:14:55,685 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-15 11:14:57,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:14:57,674 INFO L93 Difference]: Finished difference Result 334 states and 339 transitions. [2019-02-15 11:14:57,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-02-15 11:14:57,674 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 156 [2019-02-15 11:14:57,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:14:57,676 INFO L225 Difference]: With dead ends: 334 [2019-02-15 11:14:57,676 INFO L226 Difference]: Without dead ends: 248 [2019-02-15 11:14:57,677 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 285 SyntacticMatches, 3 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2078 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=869, Invalid=12241, Unknown=0, NotChecked=0, Total=13110 [2019-02-15 11:14:57,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-02-15 11:14:57,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 161. [2019-02-15 11:14:57,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-02-15 11:14:57,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 163 transitions. [2019-02-15 11:14:57,706 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 163 transitions. Word has length 156 [2019-02-15 11:14:57,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:14:57,706 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 163 transitions. [2019-02-15 11:14:57,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-02-15 11:14:57,706 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 163 transitions. [2019-02-15 11:14:57,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-02-15 11:14:57,707 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:14:57,707 INFO L402 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1] [2019-02-15 11:14:57,707 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:14:57,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:14:57,707 INFO L82 PathProgramCache]: Analyzing trace with hash -1719166132, now seen corresponding path program 37 times [2019-02-15 11:14:57,707 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:14:57,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:14:57,708 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:14:57,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:14:57,708 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:14:57,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:14:59,303 INFO L134 CoverageAnalysis]: Checked inductivity of 1705 backedges. 990 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:14:59,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:14:59,303 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:14:59,303 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:14:59,303 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:14:59,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:14:59,303 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:14:59,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:14:59,313 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:14:59,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:14:59,346 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:15:00,217 INFO L134 CoverageAnalysis]: Checked inductivity of 1705 backedges. 990 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:15:00,218 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:15:00,845 INFO L134 CoverageAnalysis]: Checked inductivity of 1705 backedges. 990 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:15:00,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:15:00,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 70 [2019-02-15 11:15:00,874 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:15:00,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-02-15 11:15:00,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-02-15 11:15:00,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1174, Invalid=3796, Unknown=0, NotChecked=0, Total=4970 [2019-02-15 11:15:00,875 INFO L87 Difference]: Start difference. First operand 161 states and 163 transitions. Second operand 71 states. [2019-02-15 11:15:02,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:15:02,465 INFO L93 Difference]: Finished difference Result 345 states and 349 transitions. [2019-02-15 11:15:02,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-02-15 11:15:02,467 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 160 [2019-02-15 11:15:02,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:15:02,468 INFO L225 Difference]: With dead ends: 345 [2019-02-15 11:15:02,468 INFO L226 Difference]: Without dead ends: 166 [2019-02-15 11:15:02,468 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 251 SyntacticMatches, 45 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2992 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=2048, Invalid=6694, Unknown=0, NotChecked=0, Total=8742 [2019-02-15 11:15:02,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-02-15 11:15:02,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 164. [2019-02-15 11:15:02,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-02-15 11:15:02,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 166 transitions. [2019-02-15 11:15:02,494 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 166 transitions. Word has length 160 [2019-02-15 11:15:02,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:15:02,494 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 166 transitions. [2019-02-15 11:15:02,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-02-15 11:15:02,494 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 166 transitions. [2019-02-15 11:15:02,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-02-15 11:15:02,495 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:15:02,495 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 22, 22, 22, 1, 1, 1, 1, 1] [2019-02-15 11:15:02,495 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:15:02,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:15:02,496 INFO L82 PathProgramCache]: Analyzing trace with hash -148438332, now seen corresponding path program 38 times [2019-02-15 11:15:02,496 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:15:02,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:15:02,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:15:02,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:15:02,497 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:15:02,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:15:04,301 INFO L134 CoverageAnalysis]: Checked inductivity of 1772 backedges. 22 proven. 1750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:15:04,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:15:04,302 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:15:04,302 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:15:04,302 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:15:04,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:15:04,302 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:15:04,312 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:15:04,312 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:15:04,395 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-02-15 11:15:04,395 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:15:04,398 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:15:05,751 INFO L134 CoverageAnalysis]: Checked inductivity of 1772 backedges. 22 proven. 1750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:15:05,751 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:15:05,899 INFO L134 CoverageAnalysis]: Checked inductivity of 1772 backedges. 22 proven. 1750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:15:05,917 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:15:05,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 48, 48] total 73 [2019-02-15 11:15:05,918 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:15:05,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-02-15 11:15:05,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-02-15 11:15:05,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=5208, Unknown=0, NotChecked=0, Total=5402 [2019-02-15 11:15:05,919 INFO L87 Difference]: Start difference. First operand 164 states and 166 transitions. Second operand 74 states. [2019-02-15 11:15:12,924 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2019-02-15 11:15:13,255 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2019-02-15 11:15:13,569 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-02-15 11:15:13,776 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-15 11:15:14,001 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-15 11:15:14,253 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-15 11:15:16,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:15:16,392 INFO L93 Difference]: Finished difference Result 349 states and 354 transitions. [2019-02-15 11:15:16,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-02-15 11:15:16,392 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 163 [2019-02-15 11:15:16,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:15:16,394 INFO L225 Difference]: With dead ends: 349 [2019-02-15 11:15:16,394 INFO L226 Difference]: Without dead ends: 259 [2019-02-15 11:15:16,395 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 298 SyntacticMatches, 3 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2264 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=931, Invalid=13349, Unknown=0, NotChecked=0, Total=14280 [2019-02-15 11:15:16,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-02-15 11:15:16,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 168. [2019-02-15 11:15:16,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-02-15 11:15:16,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 170 transitions. [2019-02-15 11:15:16,425 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 170 transitions. Word has length 163 [2019-02-15 11:15:16,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:15:16,425 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 170 transitions. [2019-02-15 11:15:16,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-02-15 11:15:16,425 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 170 transitions. [2019-02-15 11:15:16,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-02-15 11:15:16,426 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:15:16,426 INFO L402 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1] [2019-02-15 11:15:16,426 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:15:16,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:15:16,426 INFO L82 PathProgramCache]: Analyzing trace with hash -1550952469, now seen corresponding path program 39 times [2019-02-15 11:15:16,427 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:15:16,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:15:16,427 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:15:16,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:15:16,428 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:15:16,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:15:17,316 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 1081 proven. 782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:15:17,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:15:17,317 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:15:17,317 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:15:17,317 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:15:17,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:15:17,317 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:15:17,325 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:15:17,325 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:15:17,350 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:15:17,351 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:15:17,353 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:15:18,296 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 1081 proven. 782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:15:18,297 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:15:18,994 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 1081 proven. 782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:15:19,024 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:15:19,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 73 [2019-02-15 11:15:19,024 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:15:19,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-02-15 11:15:19,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-02-15 11:15:19,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1273, Invalid=4129, Unknown=0, NotChecked=0, Total=5402 [2019-02-15 11:15:19,026 INFO L87 Difference]: Start difference. First operand 168 states and 170 transitions. Second operand 74 states. [2019-02-15 11:15:20,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:15:20,933 INFO L93 Difference]: Finished difference Result 360 states and 364 transitions. [2019-02-15 11:15:20,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-02-15 11:15:20,934 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 167 [2019-02-15 11:15:20,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:15:20,935 INFO L225 Difference]: With dead ends: 360 [2019-02-15 11:15:20,935 INFO L226 Difference]: Without dead ends: 173 [2019-02-15 11:15:20,936 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 262 SyntacticMatches, 47 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3266 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=2221, Invalid=7285, Unknown=0, NotChecked=0, Total=9506 [2019-02-15 11:15:20,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-02-15 11:15:20,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 171. [2019-02-15 11:15:20,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-02-15 11:15:20,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 173 transitions. [2019-02-15 11:15:20,966 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 173 transitions. Word has length 167 [2019-02-15 11:15:20,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:15:20,966 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 173 transitions. [2019-02-15 11:15:20,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-02-15 11:15:20,967 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 173 transitions. [2019-02-15 11:15:20,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-02-15 11:15:20,967 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:15:20,967 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 23, 23, 23, 1, 1, 1, 1, 1] [2019-02-15 11:15:20,967 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:15:20,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:15:20,968 INFO L82 PathProgramCache]: Analyzing trace with hash -810935949, now seen corresponding path program 40 times [2019-02-15 11:15:20,968 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:15:20,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:15:20,968 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:15:20,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:15:20,969 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:15:20,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:15:22,885 INFO L134 CoverageAnalysis]: Checked inductivity of 1933 backedges. 23 proven. 1910 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:15:22,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:15:22,885 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:15:22,886 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:15:22,886 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:15:22,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:15:22,886 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:15:22,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:15:22,895 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:15:22,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:15:22,929 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:15:24,867 INFO L134 CoverageAnalysis]: Checked inductivity of 1933 backedges. 23 proven. 1910 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:15:24,867 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:15:25,015 INFO L134 CoverageAnalysis]: Checked inductivity of 1933 backedges. 23 proven. 1910 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:15:25,033 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:15:25,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 50, 50] total 76 [2019-02-15 11:15:25,034 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:15:25,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-02-15 11:15:25,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-02-15 11:15:25,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=5650, Unknown=0, NotChecked=0, Total=5852 [2019-02-15 11:15:25,035 INFO L87 Difference]: Start difference. First operand 171 states and 173 transitions. Second operand 77 states. [2019-02-15 11:15:32,512 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2019-02-15 11:15:32,860 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2019-02-15 11:15:33,200 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2019-02-15 11:15:33,428 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-15 11:15:33,653 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-15 11:15:33,867 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-15 11:15:34,065 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-15 11:15:34,448 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-02-15 11:15:34,703 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2019-02-15 11:15:36,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:15:36,291 INFO L93 Difference]: Finished difference Result 364 states and 369 transitions. [2019-02-15 11:15:36,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-02-15 11:15:36,292 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 170 [2019-02-15 11:15:36,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:15:36,293 INFO L225 Difference]: With dead ends: 364 [2019-02-15 11:15:36,293 INFO L226 Difference]: Without dead ends: 270 [2019-02-15 11:15:36,294 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 437 GetRequests, 311 SyntacticMatches, 3 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2458 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=995, Invalid=14505, Unknown=0, NotChecked=0, Total=15500 [2019-02-15 11:15:36,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-02-15 11:15:36,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 175. [2019-02-15 11:15:36,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-02-15 11:15:36,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 177 transitions. [2019-02-15 11:15:36,324 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 177 transitions. Word has length 170 [2019-02-15 11:15:36,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:15:36,325 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 177 transitions. [2019-02-15 11:15:36,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-02-15 11:15:36,325 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 177 transitions. [2019-02-15 11:15:36,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-02-15 11:15:36,325 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:15:36,326 INFO L402 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1] [2019-02-15 11:15:36,326 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:15:36,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:15:36,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1036484838, now seen corresponding path program 41 times [2019-02-15 11:15:36,326 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:15:36,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:15:36,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:15:36,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:15:36,327 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:15:36,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:15:37,662 INFO L134 CoverageAnalysis]: Checked inductivity of 2028 backedges. 1176 proven. 852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:15:37,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:15:37,662 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:15:37,662 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:15:37,662 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:15:37,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:15:37,663 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:15:37,676 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:15:37,677 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:15:37,781 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2019-02-15 11:15:37,781 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:15:37,784 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:15:39,076 INFO L134 CoverageAnalysis]: Checked inductivity of 2028 backedges. 1176 proven. 852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:15:39,076 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:15:40,150 INFO L134 CoverageAnalysis]: Checked inductivity of 2028 backedges. 1176 proven. 852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:15:40,169 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:15:40,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 76 [2019-02-15 11:15:40,170 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:15:40,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-02-15 11:15:40,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-02-15 11:15:40,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1376, Invalid=4476, Unknown=0, NotChecked=0, Total=5852 [2019-02-15 11:15:40,171 INFO L87 Difference]: Start difference. First operand 175 states and 177 transitions. Second operand 77 states. [2019-02-15 11:15:41,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:15:41,990 INFO L93 Difference]: Finished difference Result 375 states and 379 transitions. [2019-02-15 11:15:41,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-02-15 11:15:41,991 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 174 [2019-02-15 11:15:41,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:15:41,992 INFO L225 Difference]: With dead ends: 375 [2019-02-15 11:15:41,992 INFO L226 Difference]: Without dead ends: 180 [2019-02-15 11:15:41,992 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 273 SyntacticMatches, 49 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3552 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=2401, Invalid=7901, Unknown=0, NotChecked=0, Total=10302 [2019-02-15 11:15:41,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-02-15 11:15:42,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 178. [2019-02-15 11:15:42,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-02-15 11:15:42,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 180 transitions. [2019-02-15 11:15:42,021 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 180 transitions. Word has length 174 [2019-02-15 11:15:42,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:15:42,021 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 180 transitions. [2019-02-15 11:15:42,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-02-15 11:15:42,021 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 180 transitions. [2019-02-15 11:15:42,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-02-15 11:15:42,022 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:15:42,022 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 24, 24, 24, 1, 1, 1, 1, 1] [2019-02-15 11:15:42,022 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:15:42,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:15:42,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1003391854, now seen corresponding path program 42 times [2019-02-15 11:15:42,023 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:15:42,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:15:42,023 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:15:42,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:15:42,024 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:15:42,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:15:43,614 INFO L134 CoverageAnalysis]: Checked inductivity of 2101 backedges. 24 proven. 2077 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:15:43,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:15:43,615 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:15:43,615 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:15:43,615 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:15:43,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:15:43,615 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:15:43,636 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:15:43,636 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:15:43,672 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:15:43,672 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:15:43,676 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:15:45,559 INFO L134 CoverageAnalysis]: Checked inductivity of 2101 backedges. 24 proven. 2077 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:15:45,560 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:15:45,716 INFO L134 CoverageAnalysis]: Checked inductivity of 2101 backedges. 24 proven. 2077 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:15:45,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:15:45,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 52, 52] total 79 [2019-02-15 11:15:45,735 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:15:45,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-02-15 11:15:45,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-02-15 11:15:45,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=6110, Unknown=0, NotChecked=0, Total=6320 [2019-02-15 11:15:45,736 INFO L87 Difference]: Start difference. First operand 178 states and 180 transitions. Second operand 80 states. [2019-02-15 11:15:52,136 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2019-02-15 11:15:52,517 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2019-02-15 11:15:52,871 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2019-02-15 11:15:53,119 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-02-15 11:15:53,371 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-15 11:15:53,596 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-15 11:15:53,812 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-15 11:15:56,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:15:56,348 INFO L93 Difference]: Finished difference Result 379 states and 384 transitions. [2019-02-15 11:15:56,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-02-15 11:15:56,348 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 177 [2019-02-15 11:15:56,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:15:56,350 INFO L225 Difference]: With dead ends: 379 [2019-02-15 11:15:56,350 INFO L226 Difference]: Without dead ends: 281 [2019-02-15 11:15:56,351 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 324 SyntacticMatches, 3 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2660 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=1061, Invalid=15709, Unknown=0, NotChecked=0, Total=16770 [2019-02-15 11:15:56,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-02-15 11:15:56,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 182. [2019-02-15 11:15:56,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-02-15 11:15:56,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 184 transitions. [2019-02-15 11:15:56,387 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 184 transitions. Word has length 177 [2019-02-15 11:15:56,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:15:56,388 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 184 transitions. [2019-02-15 11:15:56,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-02-15 11:15:56,388 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 184 transitions. [2019-02-15 11:15:56,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-02-15 11:15:56,388 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:15:56,389 INFO L402 BasicCegarLoop]: trace histogram [26, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1] [2019-02-15 11:15:56,389 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:15:56,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:15:56,389 INFO L82 PathProgramCache]: Analyzing trace with hash 525284025, now seen corresponding path program 43 times [2019-02-15 11:15:56,389 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:15:56,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:15:56,390 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:15:56,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:15:56,390 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:15:56,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:15:57,397 INFO L134 CoverageAnalysis]: Checked inductivity of 2200 backedges. 1275 proven. 925 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:15:57,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:15:57,398 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:15:57,398 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:15:57,398 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:15:57,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:15:57,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 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:15:57,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:15:57,407 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:15:57,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:15:57,444 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:15:58,551 INFO L134 CoverageAnalysis]: Checked inductivity of 2200 backedges. 1275 proven. 925 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:15:58,551 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:15:59,346 INFO L134 CoverageAnalysis]: Checked inductivity of 2200 backedges. 1275 proven. 925 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:15:59,365 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:15:59,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 79 [2019-02-15 11:15:59,365 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:15:59,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-02-15 11:15:59,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-02-15 11:15:59,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1483, Invalid=4837, Unknown=0, NotChecked=0, Total=6320 [2019-02-15 11:15:59,366 INFO L87 Difference]: Start difference. First operand 182 states and 184 transitions. Second operand 80 states. [2019-02-15 11:16:01,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:16:01,479 INFO L93 Difference]: Finished difference Result 390 states and 394 transitions. [2019-02-15 11:16:01,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-02-15 11:16:01,480 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 181 [2019-02-15 11:16:01,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:16:01,481 INFO L225 Difference]: With dead ends: 390 [2019-02-15 11:16:01,481 INFO L226 Difference]: Without dead ends: 187 [2019-02-15 11:16:01,482 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 284 SyntacticMatches, 51 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3850 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=2588, Invalid=8542, Unknown=0, NotChecked=0, Total=11130 [2019-02-15 11:16:01,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-02-15 11:16:01,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 185. [2019-02-15 11:16:01,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-02-15 11:16:01,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 187 transitions. [2019-02-15 11:16:01,528 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 187 transitions. Word has length 181 [2019-02-15 11:16:01,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:16:01,528 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 187 transitions. [2019-02-15 11:16:01,528 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-02-15 11:16:01,528 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 187 transitions. [2019-02-15 11:16:01,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-02-15 11:16:01,529 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:16:01,530 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 25, 25, 25, 1, 1, 1, 1, 1] [2019-02-15 11:16:01,530 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:16:01,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:16:01,530 INFO L82 PathProgramCache]: Analyzing trace with hash -1479170495, now seen corresponding path program 44 times [2019-02-15 11:16:01,530 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:16:01,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:16:01,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:16:01,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:16:01,531 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:16:01,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:16:04,005 INFO L134 CoverageAnalysis]: Checked inductivity of 2276 backedges. 25 proven. 2251 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:16:04,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:16:04,005 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:16:04,005 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:16:04,005 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:16:04,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:16:04,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 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:16:04,016 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:16:04,016 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:16:04,069 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2019-02-15 11:16:04,069 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:16:04,073 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:16:08,651 INFO L134 CoverageAnalysis]: Checked inductivity of 2276 backedges. 1250 proven. 1026 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:16:08,651 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:16:12,998 INFO L134 CoverageAnalysis]: Checked inductivity of 2276 backedges. 1225 proven. 1051 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:16:13,018 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:16:13,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 56, 56] total 138 [2019-02-15 11:16:13,018 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:16:13,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-02-15 11:16:13,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-02-15 11:16:13,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2093, Invalid=17089, Unknown=0, NotChecked=0, Total=19182 [2019-02-15 11:16:13,020 INFO L87 Difference]: Start difference. First operand 185 states and 187 transitions. Second operand 111 states. [2019-02-15 11:16:31,008 WARN L181 SmtUtils]: Spent 229.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2019-02-15 11:16:31,491 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2019-02-15 11:16:31,959 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2019-02-15 11:16:32,357 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-02-15 11:16:32,742 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-02-15 11:16:33,097 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-15 11:16:33,442 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-15 11:16:33,768 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-15 11:16:34,089 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-15 11:16:37,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:16:37,349 INFO L93 Difference]: Finished difference Result 496 states and 502 transitions. [2019-02-15 11:16:37,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 184 states. [2019-02-15 11:16:37,350 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 184 [2019-02-15 11:16:37,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:16:37,352 INFO L225 Difference]: With dead ends: 496 [2019-02-15 11:16:37,352 INFO L226 Difference]: Without dead ends: 289 [2019-02-15 11:16:37,355 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 577 GetRequests, 257 SyntacticMatches, 27 SemanticMatches, 293 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18831 ImplicationChecksByTransitivity, 29.0s TimeCoverageRelationStatistics Valid=6295, Invalid=80435, Unknown=0, NotChecked=0, Total=86730 [2019-02-15 11:16:37,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-02-15 11:16:37,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 192. [2019-02-15 11:16:37,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-02-15 11:16:37,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 194 transitions. [2019-02-15 11:16:37,401 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 194 transitions. Word has length 184 [2019-02-15 11:16:37,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:16:37,401 INFO L480 AbstractCegarLoop]: Abstraction has 192 states and 194 transitions. [2019-02-15 11:16:37,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-02-15 11:16:37,401 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 194 transitions. [2019-02-15 11:16:37,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-02-15 11:16:37,402 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:16:37,402 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 26, 26, 26, 1, 1, 1, 1, 1] [2019-02-15 11:16:37,402 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:16:37,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:16:37,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1734936480, now seen corresponding path program 45 times [2019-02-15 11:16:37,402 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:16:37,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:16:37,403 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:16:37,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:16:37,403 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:16:37,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:16:39,195 INFO L134 CoverageAnalysis]: Checked inductivity of 2458 backedges. 26 proven. 2432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:16:39,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:16:39,196 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:16:39,196 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:16:39,196 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:16:39,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:16:39,196 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:16:39,204 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:16:39,204 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:16:39,232 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:16:39,233 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:16:39,236 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:16:41,192 INFO L134 CoverageAnalysis]: Checked inductivity of 2458 backedges. 26 proven. 2432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:16:41,193 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:16:41,574 INFO L134 CoverageAnalysis]: Checked inductivity of 2458 backedges. 26 proven. 2432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:16:41,593 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:16:41,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 56, 56] total 85 [2019-02-15 11:16:41,593 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:16:41,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-02-15 11:16:41,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-02-15 11:16:41,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=7084, Unknown=0, NotChecked=0, Total=7310 [2019-02-15 11:16:41,594 INFO L87 Difference]: Start difference. First operand 192 states and 194 transitions. Second operand 86 states. [2019-02-15 11:16:49,959 WARN L181 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2019-02-15 11:16:50,356 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2019-02-15 11:16:50,752 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2019-02-15 11:16:51,025 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-02-15 11:16:51,335 WARN L181 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-02-15 11:16:51,646 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-02-15 11:16:51,902 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-15 11:16:52,136 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-15 11:16:52,370 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-15 11:16:52,588 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-15 11:16:54,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:16:54,927 INFO L93 Difference]: Finished difference Result 409 states and 414 transitions. [2019-02-15 11:16:54,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-02-15 11:16:54,927 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 191 [2019-02-15 11:16:54,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:16:54,929 INFO L225 Difference]: With dead ends: 409 [2019-02-15 11:16:54,929 INFO L226 Difference]: Without dead ends: 303 [2019-02-15 11:16:54,930 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 491 GetRequests, 350 SyntacticMatches, 3 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3088 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=1199, Invalid=18261, Unknown=0, NotChecked=0, Total=19460 [2019-02-15 11:16:54,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2019-02-15 11:16:54,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 196. [2019-02-15 11:16:54,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-02-15 11:16:54,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 198 transitions. [2019-02-15 11:16:54,969 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 198 transitions. Word has length 191 [2019-02-15 11:16:54,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:16:54,969 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 198 transitions. [2019-02-15 11:16:54,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-02-15 11:16:54,970 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 198 transitions. [2019-02-15 11:16:54,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-02-15 11:16:54,970 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:16:54,970 INFO L402 BasicCegarLoop]: trace histogram [28, 27, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1] [2019-02-15 11:16:54,971 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:16:54,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:16:54,971 INFO L82 PathProgramCache]: Analyzing trace with hash 2056396679, now seen corresponding path program 46 times [2019-02-15 11:16:54,971 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:16:54,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:16:54,971 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:16:54,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:16:54,972 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:16:54,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:16:56,161 INFO L134 CoverageAnalysis]: Checked inductivity of 2565 backedges. 1485 proven. 1080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:16:56,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:16:56,161 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:16:56,161 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:16:56,161 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:16:56,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:16:56,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 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:16:56,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:16:56,171 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:16:56,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:16:56,209 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:16:59,522 INFO L134 CoverageAnalysis]: Checked inductivity of 2565 backedges. 1485 proven. 1080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:16:59,522 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:17:00,473 INFO L134 CoverageAnalysis]: Checked inductivity of 2565 backedges. 1485 proven. 1080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:17:00,492 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:17:00,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 85 [2019-02-15 11:17:00,492 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:17:00,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-02-15 11:17:00,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-02-15 11:17:00,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1709, Invalid=5601, Unknown=0, NotChecked=0, Total=7310 [2019-02-15 11:17:00,493 INFO L87 Difference]: Start difference. First operand 196 states and 198 transitions. Second operand 86 states. [2019-02-15 11:17:03,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:17:03,011 INFO L93 Difference]: Finished difference Result 420 states and 424 transitions. [2019-02-15 11:17:03,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-02-15 11:17:03,012 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 195 [2019-02-15 11:17:03,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:17:03,014 INFO L225 Difference]: With dead ends: 420 [2019-02-15 11:17:03,014 INFO L226 Difference]: Without dead ends: 201 [2019-02-15 11:17:03,015 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 473 GetRequests, 306 SyntacticMatches, 55 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4482 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=2983, Invalid=9899, Unknown=0, NotChecked=0, Total=12882 [2019-02-15 11:17:03,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-02-15 11:17:03,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 199. [2019-02-15 11:17:03,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-02-15 11:17:03,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 201 transitions. [2019-02-15 11:17:03,055 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 201 transitions. Word has length 195 [2019-02-15 11:17:03,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:17:03,056 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 201 transitions. [2019-02-15 11:17:03,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-02-15 11:17:03,056 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 201 transitions. [2019-02-15 11:17:03,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-02-15 11:17:03,056 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:17:03,057 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 27, 27, 27, 1, 1, 1, 1, 1] [2019-02-15 11:17:03,057 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:17:03,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:17:03,057 INFO L82 PathProgramCache]: Analyzing trace with hash -303839985, now seen corresponding path program 47 times [2019-02-15 11:17:03,057 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:17:03,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:17:03,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:17:03,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:17:03,058 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:17:03,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:17:04,934 INFO L134 CoverageAnalysis]: Checked inductivity of 2647 backedges. 27 proven. 2620 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:17:04,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:17:04,934 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:17:04,934 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:17:04,934 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:17:04,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:17:04,934 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:17:04,943 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:17:04,943 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:17:05,000 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2019-02-15 11:17:05,000 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:17:05,004 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:17:07,225 INFO L134 CoverageAnalysis]: Checked inductivity of 2647 backedges. 27 proven. 2620 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:17:07,225 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:17:07,409 INFO L134 CoverageAnalysis]: Checked inductivity of 2647 backedges. 27 proven. 2620 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:17:07,427 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:17:07,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 58, 58] total 88 [2019-02-15 11:17:07,428 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:17:07,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-02-15 11:17:07,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-02-15 11:17:07,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=7598, Unknown=0, NotChecked=0, Total=7832 [2019-02-15 11:17:07,429 INFO L87 Difference]: Start difference. First operand 199 states and 201 transitions. Second operand 89 states. [2019-02-15 11:17:15,872 WARN L181 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2019-02-15 11:17:16,276 WARN L181 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2019-02-15 11:17:16,682 WARN L181 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2019-02-15 11:17:17,004 WARN L181 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-02-15 11:17:17,310 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-02-15 11:17:17,582 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-02-15 11:17:17,852 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-02-15 11:17:18,107 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-15 11:17:18,370 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-15 11:17:18,610 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-15 11:17:18,833 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-15 11:17:21,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:17:21,221 INFO L93 Difference]: Finished difference Result 424 states and 429 transitions. [2019-02-15 11:17:21,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2019-02-15 11:17:21,222 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 198 [2019-02-15 11:17:21,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:17:21,224 INFO L225 Difference]: With dead ends: 424 [2019-02-15 11:17:21,224 INFO L226 Difference]: Without dead ends: 314 [2019-02-15 11:17:21,225 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 509 GetRequests, 363 SyntacticMatches, 3 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3314 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=1271, Invalid=19609, Unknown=0, NotChecked=0, Total=20880 [2019-02-15 11:17:21,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-02-15 11:17:21,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 203. [2019-02-15 11:17:21,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-02-15 11:17:21,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 205 transitions. [2019-02-15 11:17:21,270 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 205 transitions. Word has length 198 [2019-02-15 11:17:21,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:17:21,270 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 205 transitions. [2019-02-15 11:17:21,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-02-15 11:17:21,271 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 205 transitions. [2019-02-15 11:17:21,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-02-15 11:17:21,279 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:17:21,280 INFO L402 BasicCegarLoop]: trace histogram [29, 28, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1] [2019-02-15 11:17:21,280 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:17:21,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:17:21,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1908736842, now seen corresponding path program 48 times [2019-02-15 11:17:21,280 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:17:21,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:17:21,281 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:17:21,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:17:21,281 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:17:21,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:17:22,801 INFO L134 CoverageAnalysis]: Checked inductivity of 2758 backedges. 1596 proven. 1162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:17:22,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:17:22,802 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:17:22,802 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:17:22,802 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:17:22,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:17:22,802 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:17:22,810 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:17:22,810 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:17:22,842 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:17:22,842 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:17:22,845 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:17:24,223 INFO L134 CoverageAnalysis]: Checked inductivity of 2758 backedges. 1596 proven. 1162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:17:24,223 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:17:25,376 INFO L134 CoverageAnalysis]: Checked inductivity of 2758 backedges. 1596 proven. 1162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:17:25,394 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:17:25,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 88 [2019-02-15 11:17:25,394 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:17:25,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-02-15 11:17:25,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-02-15 11:17:25,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1828, Invalid=6004, Unknown=0, NotChecked=0, Total=7832 [2019-02-15 11:17:25,396 INFO L87 Difference]: Start difference. First operand 203 states and 205 transitions. Second operand 89 states. [2019-02-15 11:17:28,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:17:28,038 INFO L93 Difference]: Finished difference Result 435 states and 439 transitions. [2019-02-15 11:17:28,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-02-15 11:17:28,038 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 202 [2019-02-15 11:17:28,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:17:28,040 INFO L225 Difference]: With dead ends: 435 [2019-02-15 11:17:28,040 INFO L226 Difference]: Without dead ends: 208 [2019-02-15 11:17:28,041 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 490 GetRequests, 317 SyntacticMatches, 57 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4816 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=3191, Invalid=10615, Unknown=0, NotChecked=0, Total=13806 [2019-02-15 11:17:28,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-02-15 11:17:28,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 206. [2019-02-15 11:17:28,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-02-15 11:17:28,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 208 transitions. [2019-02-15 11:17:28,090 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 208 transitions. Word has length 202 [2019-02-15 11:17:28,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:17:28,091 INFO L480 AbstractCegarLoop]: Abstraction has 206 states and 208 transitions. [2019-02-15 11:17:28,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-02-15 11:17:28,091 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 208 transitions. [2019-02-15 11:17:28,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-02-15 11:17:28,092 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:17:28,092 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 28, 28, 28, 1, 1, 1, 1, 1] [2019-02-15 11:17:28,092 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:17:28,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:17:28,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1062571566, now seen corresponding path program 49 times [2019-02-15 11:17:28,093 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:17:28,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:17:28,093 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:17:28,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:17:28,093 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:17:28,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:17:30,087 INFO L134 CoverageAnalysis]: Checked inductivity of 2843 backedges. 28 proven. 2815 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:17:30,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:17:30,088 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:17:30,088 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:17:30,088 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:17:30,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:17:30,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 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:17:30,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:17:30,099 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:17:30,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:17:30,142 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:17:32,265 INFO L134 CoverageAnalysis]: Checked inductivity of 2843 backedges. 28 proven. 2815 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:17:32,265 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:17:32,632 INFO L134 CoverageAnalysis]: Checked inductivity of 2843 backedges. 28 proven. 2815 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:17:32,650 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:17:32,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 60, 60] total 91 [2019-02-15 11:17:32,650 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:17:32,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-02-15 11:17:32,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-02-15 11:17:32,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=8130, Unknown=0, NotChecked=0, Total=8372 [2019-02-15 11:17:32,652 INFO L87 Difference]: Start difference. First operand 206 states and 208 transitions. Second operand 92 states. [2019-02-15 11:17:41,614 WARN L181 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 148 [2019-02-15 11:17:42,031 WARN L181 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 148 [2019-02-15 11:17:42,454 WARN L181 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2019-02-15 11:17:42,823 WARN L181 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-02-15 11:17:43,115 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-02-15 11:17:43,402 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-02-15 11:17:43,683 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-02-15 11:17:43,950 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-02-15 11:17:44,211 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-15 11:17:44,461 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-15 11:17:44,702 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-15 11:17:44,950 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-15 11:17:47,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:17:47,426 INFO L93 Difference]: Finished difference Result 439 states and 444 transitions. [2019-02-15 11:17:47,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2019-02-15 11:17:47,427 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 205 [2019-02-15 11:17:47,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:17:47,428 INFO L225 Difference]: With dead ends: 439 [2019-02-15 11:17:47,428 INFO L226 Difference]: Without dead ends: 325 [2019-02-15 11:17:47,429 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 527 GetRequests, 376 SyntacticMatches, 3 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3548 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=1345, Invalid=21005, Unknown=0, NotChecked=0, Total=22350 [2019-02-15 11:17:47,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2019-02-15 11:17:47,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 210. [2019-02-15 11:17:47,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-02-15 11:17:47,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 212 transitions. [2019-02-15 11:17:47,479 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 212 transitions. Word has length 205 [2019-02-15 11:17:47,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:17:47,479 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 212 transitions. [2019-02-15 11:17:47,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-02-15 11:17:47,479 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 212 transitions. [2019-02-15 11:17:47,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-02-15 11:17:47,480 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:17:47,480 INFO L402 BasicCegarLoop]: trace histogram [30, 29, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1] [2019-02-15 11:17:47,481 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:17:47,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:17:47,481 INFO L82 PathProgramCache]: Analyzing trace with hash -782950827, now seen corresponding path program 50 times [2019-02-15 11:17:47,481 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:17:47,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:17:47,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:17:47,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:17:47,482 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:17:47,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:17:48,995 INFO L134 CoverageAnalysis]: Checked inductivity of 2958 backedges. 1711 proven. 1247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:17:48,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:17:48,996 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:17:48,996 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:17:48,996 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:17:48,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:17:48,997 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:17:49,005 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:17:49,005 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:17:49,062 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2019-02-15 11:17:49,062 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:17:49,066 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:17:50,562 INFO L134 CoverageAnalysis]: Checked inductivity of 2958 backedges. 1711 proven. 1247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:17:50,562 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:17:51,746 INFO L134 CoverageAnalysis]: Checked inductivity of 2958 backedges. 1711 proven. 1247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:17:51,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:17:51,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 91 [2019-02-15 11:17:51,765 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:17:51,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-02-15 11:17:51,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-02-15 11:17:51,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1951, Invalid=6421, Unknown=0, NotChecked=0, Total=8372 [2019-02-15 11:17:51,766 INFO L87 Difference]: Start difference. First operand 210 states and 212 transitions. Second operand 92 states. [2019-02-15 11:17:54,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:17:54,655 INFO L93 Difference]: Finished difference Result 450 states and 454 transitions. [2019-02-15 11:17:54,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-02-15 11:17:54,655 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 209 [2019-02-15 11:17:54,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:17:54,657 INFO L225 Difference]: With dead ends: 450 [2019-02-15 11:17:54,657 INFO L226 Difference]: Without dead ends: 215 [2019-02-15 11:17:54,659 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 507 GetRequests, 328 SyntacticMatches, 59 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5162 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=3406, Invalid=11356, Unknown=0, NotChecked=0, Total=14762 [2019-02-15 11:17:54,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-02-15 11:17:54,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 213. [2019-02-15 11:17:54,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-02-15 11:17:54,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 215 transitions. [2019-02-15 11:17:54,709 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 215 transitions. Word has length 209 [2019-02-15 11:17:54,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:17:54,709 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 215 transitions. [2019-02-15 11:17:54,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-02-15 11:17:54,709 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 215 transitions. [2019-02-15 11:17:54,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-02-15 11:17:54,710 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:17:54,711 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 29, 29, 29, 1, 1, 1, 1, 1] [2019-02-15 11:17:54,711 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:17:54,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:17:54,711 INFO L82 PathProgramCache]: Analyzing trace with hash -890079779, now seen corresponding path program 51 times [2019-02-15 11:17:54,711 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:17:54,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:17:54,712 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:17:54,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:17:54,712 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:17:54,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:17:56,821 INFO L134 CoverageAnalysis]: Checked inductivity of 3046 backedges. 29 proven. 3017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:17:56,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:17:56,822 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:17:56,822 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:17:56,822 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:17:56,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:17:56,822 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:17:56,834 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:17:56,834 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:17:56,875 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:17:56,875 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:17:56,881 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:17:59,575 INFO L134 CoverageAnalysis]: Checked inductivity of 3046 backedges. 29 proven. 3017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:17:59,576 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:17:59,800 INFO L134 CoverageAnalysis]: Checked inductivity of 3046 backedges. 29 proven. 3017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:17:59,818 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:17:59,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 62, 62] total 94 [2019-02-15 11:17:59,819 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:17:59,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-02-15 11:17:59,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-02-15 11:17:59,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=8680, Unknown=0, NotChecked=0, Total=8930 [2019-02-15 11:17:59,820 INFO L87 Difference]: Start difference. First operand 213 states and 215 transitions. Second operand 95 states. [2019-02-15 11:18:10,068 WARN L181 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 153 [2019-02-15 11:18:10,554 WARN L181 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 153 [2019-02-15 11:18:11,012 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 148 [2019-02-15 11:18:11,333 WARN L181 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-02-15 11:18:11,645 WARN L181 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-02-15 11:18:11,940 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-02-15 11:18:12,240 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-02-15 11:18:12,526 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-02-15 11:18:12,800 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-02-15 11:18:13,070 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-15 11:18:13,379 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-15 11:18:13,637 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-15 11:18:13,868 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-15 11:18:16,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:18:16,411 INFO L93 Difference]: Finished difference Result 454 states and 459 transitions. [2019-02-15 11:18:16,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2019-02-15 11:18:16,412 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 212 [2019-02-15 11:18:16,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:18:16,413 INFO L225 Difference]: With dead ends: 454 [2019-02-15 11:18:16,413 INFO L226 Difference]: Without dead ends: 336 [2019-02-15 11:18:16,414 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 545 GetRequests, 389 SyntacticMatches, 3 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3790 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=1421, Invalid=22449, Unknown=0, NotChecked=0, Total=23870 [2019-02-15 11:18:16,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-02-15 11:18:16,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 217. [2019-02-15 11:18:16,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-02-15 11:18:16,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 219 transitions. [2019-02-15 11:18:16,467 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 219 transitions. Word has length 212 [2019-02-15 11:18:16,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:18:16,467 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 219 transitions. [2019-02-15 11:18:16,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-02-15 11:18:16,467 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 219 transitions. [2019-02-15 11:18:16,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-02-15 11:18:16,468 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:18:16,468 INFO L402 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1] [2019-02-15 11:18:16,468 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:18:16,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:18:16,469 INFO L82 PathProgramCache]: Analyzing trace with hash -272066940, now seen corresponding path program 52 times [2019-02-15 11:18:16,469 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:18:16,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:18:16,469 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:18:16,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:18:16,469 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:18:16,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:18:17,723 INFO L134 CoverageAnalysis]: Checked inductivity of 3165 backedges. 1830 proven. 1335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:18:17,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:18:17,723 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:18:17,723 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:18:17,723 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:18:17,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:18:17,724 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:18:17,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:18:17,745 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:18:17,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:18:17,788 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:18:19,565 INFO L134 CoverageAnalysis]: Checked inductivity of 3165 backedges. 1830 proven. 1335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:18:19,566 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:18:20,700 INFO L134 CoverageAnalysis]: Checked inductivity of 3165 backedges. 1830 proven. 1335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:18:20,718 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:18:20,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 94 [2019-02-15 11:18:20,718 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:18:20,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-02-15 11:18:20,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-02-15 11:18:20,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2078, Invalid=6852, Unknown=0, NotChecked=0, Total=8930 [2019-02-15 11:18:20,720 INFO L87 Difference]: Start difference. First operand 217 states and 219 transitions. Second operand 95 states. [2019-02-15 11:18:23,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:18:23,587 INFO L93 Difference]: Finished difference Result 465 states and 469 transitions. [2019-02-15 11:18:23,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-02-15 11:18:23,587 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 216 [2019-02-15 11:18:23,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:18:23,588 INFO L225 Difference]: With dead ends: 465 [2019-02-15 11:18:23,588 INFO L226 Difference]: Without dead ends: 222 [2019-02-15 11:18:23,589 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 524 GetRequests, 339 SyntacticMatches, 61 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5520 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=3628, Invalid=12122, Unknown=0, NotChecked=0, Total=15750 [2019-02-15 11:18:23,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-02-15 11:18:23,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 220. [2019-02-15 11:18:23,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-02-15 11:18:23,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 222 transitions. [2019-02-15 11:18:23,631 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 222 transitions. Word has length 216 [2019-02-15 11:18:23,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:18:23,631 INFO L480 AbstractCegarLoop]: Abstraction has 220 states and 222 transitions. [2019-02-15 11:18:23,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-02-15 11:18:23,631 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 222 transitions. [2019-02-15 11:18:23,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-02-15 11:18:23,632 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:18:23,632 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 30, 30, 30, 1, 1, 1, 1, 1] [2019-02-15 11:18:23,632 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:18:23,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:18:23,632 INFO L82 PathProgramCache]: Analyzing trace with hash 292238844, now seen corresponding path program 53 times [2019-02-15 11:18:23,632 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:18:23,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:18:23,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:18:23,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:18:23,633 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:18:23,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:18:25,856 INFO L134 CoverageAnalysis]: Checked inductivity of 3256 backedges. 30 proven. 3226 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:18:25,856 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:18:25,857 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:18:25,857 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:18:25,857 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:18:25,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:18:25,857 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:18:25,869 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:18:25,870 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:18:25,933 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2019-02-15 11:18:25,934 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:18:25,939 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:18:31,940 INFO L134 CoverageAnalysis]: Checked inductivity of 3256 backedges. 1800 proven. 1456 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:18:31,941 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:18:37,555 INFO L134 CoverageAnalysis]: Checked inductivity of 3256 backedges. 1770 proven. 1486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:18:37,573 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:18:37,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 66, 66] total 163 [2019-02-15 11:18:37,574 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:18:37,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 131 states [2019-02-15 11:18:37,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2019-02-15 11:18:37,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2878, Invalid=23854, Unknown=0, NotChecked=0, Total=26732 [2019-02-15 11:18:37,575 INFO L87 Difference]: Start difference. First operand 220 states and 222 transitions. Second operand 131 states. [2019-02-15 11:19:01,898 WARN L181 SmtUtils]: Spent 226.00 ms on a formula simplification that was a NOOP. DAG size: 158 [2019-02-15 11:19:02,475 WARN L181 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 158 [2019-02-15 11:19:03,086 WARN L181 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 153 [2019-02-15 11:19:03,597 WARN L181 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-02-15 11:19:04,095 WARN L181 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-02-15 11:19:04,673 WARN L181 SmtUtils]: Spent 237.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-02-15 11:19:05,153 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-02-15 11:19:05,593 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-02-15 11:19:06,034 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-02-15 11:19:06,482 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-02-15 11:19:06,881 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-15 11:19:07,267 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-15 11:19:07,644 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-15 11:19:07,990 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-15 11:19:09,606 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2019-02-15 11:19:11,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:19:11,787 INFO L93 Difference]: Finished difference Result 591 states and 597 transitions. [2019-02-15 11:19:11,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 219 states. [2019-02-15 11:19:11,787 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 219 [2019-02-15 11:19:11,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:19:11,788 INFO L225 Difference]: With dead ends: 591 [2019-02-15 11:19:11,788 INFO L226 Difference]: Without dead ends: 344 [2019-02-15 11:19:11,791 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 687 GetRequests, 307 SyntacticMatches, 32 SemanticMatches, 348 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26556 ImplicationChecksByTransitivity, 38.7s TimeCoverageRelationStatistics Valid=8585, Invalid=113565, Unknown=0, NotChecked=0, Total=122150 [2019-02-15 11:19:11,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2019-02-15 11:19:11,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 227. [2019-02-15 11:19:11,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-02-15 11:19:11,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 229 transitions. [2019-02-15 11:19:11,837 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 229 transitions. Word has length 219 [2019-02-15 11:19:11,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:19:11,837 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 229 transitions. [2019-02-15 11:19:11,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 131 states. [2019-02-15 11:19:11,837 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 229 transitions. [2019-02-15 11:19:11,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-02-15 11:19:11,838 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:19:11,838 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 32, 32, 31, 31, 31, 1, 1, 1, 1, 1] [2019-02-15 11:19:11,838 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:19:11,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:19:11,838 INFO L82 PathProgramCache]: Analyzing trace with hash 2116008107, now seen corresponding path program 54 times [2019-02-15 11:19:11,838 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:19:11,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:19:11,839 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:19:11,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:19:11,839 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:19:11,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:19:14,353 INFO L134 CoverageAnalysis]: Checked inductivity of 3473 backedges. 31 proven. 3442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:19:14,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:19:14,354 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:19:14,354 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:19:14,354 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:19:14,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:19:14,354 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:19:14,363 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:19:14,363 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:19:14,397 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:19:14,398 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:19:14,402 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:19:17,140 INFO L134 CoverageAnalysis]: Checked inductivity of 3473 backedges. 31 proven. 3442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:19:17,140 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:19:17,370 INFO L134 CoverageAnalysis]: Checked inductivity of 3473 backedges. 31 proven. 3442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:19:17,389 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:19:17,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 66, 66] total 100 [2019-02-15 11:19:17,389 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:19:17,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-02-15 11:19:17,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-02-15 11:19:17,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=266, Invalid=9834, Unknown=0, NotChecked=0, Total=10100 [2019-02-15 11:19:17,391 INFO L87 Difference]: Start difference. First operand 227 states and 229 transitions. Second operand 101 states. [2019-02-15 11:19:30,255 WARN L181 SmtUtils]: Spent 281.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2019-02-15 11:19:30,799 WARN L181 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2019-02-15 11:19:31,299 WARN L181 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 158 [2019-02-15 11:19:31,672 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-02-15 11:19:32,012 WARN L181 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-02-15 11:19:32,341 WARN L181 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-02-15 11:19:32,682 WARN L181 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-02-15 11:19:33,010 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-02-15 11:19:33,319 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-02-15 11:19:33,624 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-02-15 11:19:33,920 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-02-15 11:19:34,185 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-15 11:19:34,453 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-15 11:19:34,711 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-15 11:19:34,961 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-15 11:19:35,229 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-02-15 11:19:35,522 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-02-15 11:19:37,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:19:37,764 INFO L93 Difference]: Finished difference Result 484 states and 489 transitions. [2019-02-15 11:19:37,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2019-02-15 11:19:37,765 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 226 [2019-02-15 11:19:37,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:19:37,766 INFO L225 Difference]: With dead ends: 484 [2019-02-15 11:19:37,766 INFO L226 Difference]: Without dead ends: 358 [2019-02-15 11:19:37,768 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 581 GetRequests, 415 SyntacticMatches, 3 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4298 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=1579, Invalid=25481, Unknown=0, NotChecked=0, Total=27060 [2019-02-15 11:19:37,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2019-02-15 11:19:37,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 231. [2019-02-15 11:19:37,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-02-15 11:19:37,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 233 transitions. [2019-02-15 11:19:37,817 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 233 transitions. Word has length 226 [2019-02-15 11:19:37,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:19:37,817 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 233 transitions. [2019-02-15 11:19:37,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-02-15 11:19:37,818 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 233 transitions. [2019-02-15 11:19:37,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-02-15 11:19:37,819 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:19:37,819 INFO L402 BasicCegarLoop]: trace histogram [33, 32, 32, 32, 32, 32, 32, 1, 1, 1, 1, 1] [2019-02-15 11:19:37,819 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:19:37,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:19:37,819 INFO L82 PathProgramCache]: Analyzing trace with hash -237256110, now seen corresponding path program 55 times [2019-02-15 11:19:37,820 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:19:37,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:19:37,820 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:19:37,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:19:37,820 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:19:37,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:19:39,301 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 2080 proven. 1520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:19:39,301 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:19:39,302 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:19:39,302 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:19:39,302 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:19:39,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:19:39,302 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:19:39,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:19:39,311 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:19:39,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:19:39,355 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:19:41,457 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 2080 proven. 1520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:19:41,457 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:19:42,990 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 2080 proven. 1520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:19:43,027 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:19:43,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 100 [2019-02-15 11:19:43,028 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:19:43,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-02-15 11:19:43,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-02-15 11:19:43,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2344, Invalid=7756, Unknown=0, NotChecked=0, Total=10100 [2019-02-15 11:19:43,029 INFO L87 Difference]: Start difference. First operand 231 states and 233 transitions. Second operand 101 states. [2019-02-15 11:19:45,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:19:45,426 INFO L93 Difference]: Finished difference Result 495 states and 499 transitions. [2019-02-15 11:19:45,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-02-15 11:19:45,426 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 230 [2019-02-15 11:19:45,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:19:45,427 INFO L225 Difference]: With dead ends: 495 [2019-02-15 11:19:45,427 INFO L226 Difference]: Without dead ends: 236 [2019-02-15 11:19:45,428 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 558 GetRequests, 361 SyntacticMatches, 65 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6272 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=4093, Invalid=13729, Unknown=0, NotChecked=0, Total=17822 [2019-02-15 11:19:45,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2019-02-15 11:19:45,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 234. [2019-02-15 11:19:45,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-02-15 11:19:45,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 236 transitions. [2019-02-15 11:19:45,485 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 236 transitions. Word has length 230 [2019-02-15 11:19:45,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:19:45,485 INFO L480 AbstractCegarLoop]: Abstraction has 234 states and 236 transitions. [2019-02-15 11:19:45,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-02-15 11:19:45,485 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 236 transitions. [2019-02-15 11:19:45,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-02-15 11:19:45,486 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:19:45,486 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 33, 33, 32, 32, 32, 1, 1, 1, 1, 1] [2019-02-15 11:19:45,487 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:19:45,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:19:45,487 INFO L82 PathProgramCache]: Analyzing trace with hash -170528822, now seen corresponding path program 56 times [2019-02-15 11:19:45,487 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:19:45,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:19:45,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:19:45,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:19:45,488 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:19:45,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:19:48,055 INFO L134 CoverageAnalysis]: Checked inductivity of 3697 backedges. 32 proven. 3665 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:19:48,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:19:48,055 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:19:48,055 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:19:48,055 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:19:48,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:19:48,055 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:19:48,065 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:19:48,065 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:19:48,131 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2019-02-15 11:19:48,131 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:19:48,135 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:19:54,780 INFO L134 CoverageAnalysis]: Checked inductivity of 3697 backedges. 2048 proven. 1649 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:19:54,781 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:20:01,368 INFO L134 CoverageAnalysis]: Checked inductivity of 3697 backedges. 2016 proven. 1681 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:20:01,386 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:20:01,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 70, 70] total 173 [2019-02-15 11:20:01,387 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:20:01,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 139 states [2019-02-15 11:20:01,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2019-02-15 11:20:01,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3227, Invalid=26875, Unknown=0, NotChecked=0, Total=30102 [2019-02-15 11:20:01,389 INFO L87 Difference]: Start difference. First operand 234 states and 236 transitions. Second operand 139 states. [2019-02-15 11:20:26,922 WARN L181 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2019-02-15 11:20:27,533 WARN L181 SmtUtils]: Spent 219.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2019-02-15 11:20:28,184 WARN L181 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2019-02-15 11:20:28,748 WARN L181 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-02-15 11:20:29,294 WARN L181 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-02-15 11:20:29,824 WARN L181 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-02-15 11:20:30,334 WARN L181 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-02-15 11:20:30,827 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-02-15 11:20:31,311 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-02-15 11:20:31,857 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-02-15 11:20:32,308 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-02-15 11:20:32,749 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-02-15 11:20:33,164 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-15 11:20:33,565 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-15 11:20:33,953 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-15 11:20:34,335 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-15 11:20:38,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:20:38,254 INFO L93 Difference]: Finished difference Result 629 states and 635 transitions. [2019-02-15 11:20:38,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 233 states. [2019-02-15 11:20:38,254 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 233 [2019-02-15 11:20:38,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:20:38,255 INFO L225 Difference]: With dead ends: 629 [2019-02-15 11:20:38,255 INFO L226 Difference]: Without dead ends: 366 [2019-02-15 11:20:38,259 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 731 GetRequests, 327 SyntacticMatches, 34 SemanticMatches, 370 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30017 ImplicationChecksByTransitivity, 43.9s TimeCoverageRelationStatistics Valid=9599, Invalid=128413, Unknown=0, NotChecked=0, Total=138012 [2019-02-15 11:20:38,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-02-15 11:20:38,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 241. [2019-02-15 11:20:38,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-02-15 11:20:38,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 243 transitions. [2019-02-15 11:20:38,311 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 243 transitions. Word has length 233 [2019-02-15 11:20:38,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:20:38,311 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 243 transitions. [2019-02-15 11:20:38,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 139 states. [2019-02-15 11:20:38,311 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 243 transitions. [2019-02-15 11:20:38,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-02-15 11:20:38,312 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:20:38,312 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 34, 34, 33, 33, 33, 1, 1, 1, 1, 1] [2019-02-15 11:20:38,312 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:20:38,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:20:38,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1552518521, now seen corresponding path program 57 times [2019-02-15 11:20:38,313 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:20:38,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:20:38,313 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:20:38,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:20:38,314 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:20:38,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:20:40,949 INFO L134 CoverageAnalysis]: Checked inductivity of 3928 backedges. 33 proven. 3895 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:20:40,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:20:40,949 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:20:40,949 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:20:40,949 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:20:40,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:20:40,949 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:20:40,959 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:20:40,959 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:20:40,996 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:20:40,996 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:20:41,001 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:20:43,979 INFO L134 CoverageAnalysis]: Checked inductivity of 3928 backedges. 33 proven. 3895 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:20:43,979 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:20:44,254 INFO L134 CoverageAnalysis]: Checked inductivity of 3928 backedges. 33 proven. 3895 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:20:44,272 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:20:44,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 70, 70] total 106 [2019-02-15 11:20:44,273 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:20:44,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-02-15 11:20:44,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-02-15 11:20:44,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=11060, Unknown=0, NotChecked=0, Total=11342 [2019-02-15 11:20:44,274 INFO L87 Difference]: Start difference. First operand 241 states and 243 transitions. Second operand 107 states. [2019-02-15 11:20:56,325 WARN L181 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2019-02-15 11:20:56,874 WARN L181 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2019-02-15 11:20:57,525 WARN L181 SmtUtils]: Spent 263.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2019-02-15 11:20:57,906 WARN L181 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2019-02-15 11:20:58,281 WARN L181 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-02-15 11:20:58,648 WARN L181 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-02-15 11:20:59,012 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-02-15 11:20:59,361 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-02-15 11:20:59,725 WARN L181 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-02-15 11:21:00,051 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-02-15 11:21:00,360 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-02-15 11:21:00,676 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-02-15 11:21:00,979 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-02-15 11:21:01,271 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-15 11:21:01,554 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-15 11:21:01,830 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-15 11:21:02,095 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-15 11:21:02,412 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-02-15 11:21:05,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:21:05,015 INFO L93 Difference]: Finished difference Result 514 states and 519 transitions. [2019-02-15 11:21:05,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2019-02-15 11:21:05,016 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 240 [2019-02-15 11:21:05,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:21:05,018 INFO L225 Difference]: With dead ends: 514 [2019-02-15 11:21:05,018 INFO L226 Difference]: Without dead ends: 380 [2019-02-15 11:21:05,019 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 617 GetRequests, 441 SyntacticMatches, 3 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4838 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=1745, Invalid=28705, Unknown=0, NotChecked=0, Total=30450 [2019-02-15 11:21:05,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-02-15 11:21:05,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 245. [2019-02-15 11:21:05,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-02-15 11:21:05,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 247 transitions. [2019-02-15 11:21:05,074 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 247 transitions. Word has length 240 [2019-02-15 11:21:05,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:21:05,074 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 247 transitions. [2019-02-15 11:21:05,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-02-15 11:21:05,075 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 247 transitions. [2019-02-15 11:21:05,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-02-15 11:21:05,075 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:21:05,075 INFO L402 BasicCegarLoop]: trace histogram [35, 34, 34, 34, 34, 34, 34, 1, 1, 1, 1, 1] [2019-02-15 11:21:05,076 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:21:05,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:21:05,076 INFO L82 PathProgramCache]: Analyzing trace with hash 714244128, now seen corresponding path program 58 times [2019-02-15 11:21:05,076 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:21:05,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:21:05,076 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:21:05,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:21:05,077 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:21:05,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:21:06,615 INFO L134 CoverageAnalysis]: Checked inductivity of 4063 backedges. 2346 proven. 1717 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:21:06,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:21:06,615 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:21:06,615 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:21:06,615 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:21:06,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:21:06,615 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:21:06,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:21:06,624 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:21:06,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:21:06,671 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:21:08,840 INFO L134 CoverageAnalysis]: Checked inductivity of 4063 backedges. 2346 proven. 1717 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:21:08,840 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:21:10,320 INFO L134 CoverageAnalysis]: Checked inductivity of 4063 backedges. 2346 proven. 1717 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:21:10,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:21:10,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 106 [2019-02-15 11:21:10,338 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:21:10,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-02-15 11:21:10,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-02-15 11:21:10,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2626, Invalid=8716, Unknown=0, NotChecked=0, Total=11342 [2019-02-15 11:21:10,339 INFO L87 Difference]: Start difference. First operand 245 states and 247 transitions. Second operand 107 states. [2019-02-15 11:21:13,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:21:13,157 INFO L93 Difference]: Finished difference Result 525 states and 529 transitions. [2019-02-15 11:21:13,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-02-15 11:21:13,158 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 244 [2019-02-15 11:21:13,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:21:13,159 INFO L225 Difference]: With dead ends: 525 [2019-02-15 11:21:13,159 INFO L226 Difference]: Without dead ends: 250 [2019-02-15 11:21:13,160 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 592 GetRequests, 383 SyntacticMatches, 69 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7072 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=4586, Invalid=15436, Unknown=0, NotChecked=0, Total=20022 [2019-02-15 11:21:13,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-02-15 11:21:13,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 248. [2019-02-15 11:21:13,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-02-15 11:21:13,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 250 transitions. [2019-02-15 11:21:13,216 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 250 transitions. Word has length 244 [2019-02-15 11:21:13,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:21:13,216 INFO L480 AbstractCegarLoop]: Abstraction has 248 states and 250 transitions. [2019-02-15 11:21:13,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-02-15 11:21:13,216 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 250 transitions. [2019-02-15 11:21:13,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-02-15 11:21:13,217 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:21:13,217 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 35, 35, 34, 34, 34, 1, 1, 1, 1, 1] [2019-02-15 11:21:13,218 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:21:13,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:21:13,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1637071768, now seen corresponding path program 59 times [2019-02-15 11:21:13,218 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:21:13,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:21:13,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:21:13,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:21:13,219 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:21:13,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:21:15,946 INFO L134 CoverageAnalysis]: Checked inductivity of 4166 backedges. 34 proven. 4132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:21:15,946 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:21:15,946 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:21:15,946 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:21:15,946 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:21:15,946 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:21:15,946 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:21:15,956 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:21:15,956 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:21:16,027 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2019-02-15 11:21:16,028 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:21:16,031 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:21:23,680 INFO L134 CoverageAnalysis]: Checked inductivity of 4166 backedges. 2312 proven. 1854 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:21:23,680 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:21:31,708 INFO L134 CoverageAnalysis]: Checked inductivity of 4166 backedges. 2278 proven. 1888 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:21:31,726 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:21:31,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 74, 74] total 183 [2019-02-15 11:21:31,727 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:21:31,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 147 states [2019-02-15 11:21:31,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2019-02-15 11:21:31,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3596, Invalid=30076, Unknown=0, NotChecked=0, Total=33672 [2019-02-15 11:21:31,729 INFO L87 Difference]: Start difference. First operand 248 states and 250 transitions. Second operand 147 states. [2019-02-15 11:21:59,708 WARN L181 SmtUtils]: Spent 245.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2019-02-15 11:22:00,361 WARN L181 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2019-02-15 11:22:01,026 WARN L181 SmtUtils]: Spent 232.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2019-02-15 11:22:01,651 WARN L181 SmtUtils]: Spent 222.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-02-15 11:22:02,258 WARN L181 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2019-02-15 11:22:02,854 WARN L181 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-02-15 11:22:03,424 WARN L181 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-02-15 11:22:04,006 WARN L181 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-02-15 11:22:04,553 WARN L181 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-02-15 11:22:05,115 WARN L181 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-02-15 11:22:05,618 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-02-15 11:22:06,113 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-02-15 11:22:06,578 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-02-15 11:22:07,038 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-02-15 11:22:07,483 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-15 11:22:07,912 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-15 11:22:08,321 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-15 11:22:08,723 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-15 11:22:12,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:22:12,826 INFO L93 Difference]: Finished difference Result 667 states and 673 transitions. [2019-02-15 11:22:12,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 247 states. [2019-02-15 11:22:12,827 INFO L78 Accepts]: Start accepts. Automaton has 147 states. Word has length 247 [2019-02-15 11:22:12,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:22:12,829 INFO L225 Difference]: With dead ends: 667 [2019-02-15 11:22:12,829 INFO L226 Difference]: Without dead ends: 388 [2019-02-15 11:22:12,835 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 775 GetRequests, 347 SyntacticMatches, 36 SemanticMatches, 392 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33690 ImplicationChecksByTransitivity, 50.2s TimeCoverageRelationStatistics Valid=10669, Invalid=144173, Unknown=0, NotChecked=0, Total=154842 [2019-02-15 11:22:12,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2019-02-15 11:22:12,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 255. [2019-02-15 11:22:12,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-02-15 11:22:12,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 257 transitions. [2019-02-15 11:22:12,930 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 257 transitions. Word has length 247 [2019-02-15 11:22:12,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:22:12,930 INFO L480 AbstractCegarLoop]: Abstraction has 255 states and 257 transitions. [2019-02-15 11:22:12,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has 147 states. [2019-02-15 11:22:12,930 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 257 transitions. [2019-02-15 11:22:12,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-02-15 11:22:12,932 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:22:12,932 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 35, 35, 35, 1, 1, 1, 1, 1] [2019-02-15 11:22:12,932 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:22:12,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:22:12,932 INFO L82 PathProgramCache]: Analyzing trace with hash -783420345, now seen corresponding path program 60 times [2019-02-15 11:22:12,933 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:22:12,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:22:12,933 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:22:12,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:22:12,933 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:22:12,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:22:15,823 INFO L134 CoverageAnalysis]: Checked inductivity of 4411 backedges. 35 proven. 4376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:22:15,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:22:15,823 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:22:15,823 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:22:15,823 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:22:15,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:22:15,823 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:22:15,835 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:22:15,835 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:22:15,874 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:22:15,874 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:22:15,878 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:22:19,019 INFO L134 CoverageAnalysis]: Checked inductivity of 4411 backedges. 35 proven. 4376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:22:19,019 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:22:19,470 INFO L134 CoverageAnalysis]: Checked inductivity of 4411 backedges. 35 proven. 4376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:22:19,489 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:22:19,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 74, 74] total 112 [2019-02-15 11:22:19,489 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:22:19,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-02-15 11:22:19,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-02-15 11:22:19,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=298, Invalid=12358, Unknown=0, NotChecked=0, Total=12656 [2019-02-15 11:22:19,491 INFO L87 Difference]: Start difference. First operand 255 states and 257 transitions. Second operand 113 states. [2019-02-15 11:22:33,504 WARN L181 SmtUtils]: Spent 242.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2019-02-15 11:22:34,089 WARN L181 SmtUtils]: Spent 249.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2019-02-15 11:22:34,728 WARN L181 SmtUtils]: Spent 281.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2019-02-15 11:22:35,146 WARN L181 SmtUtils]: Spent 228.00 ms on a formula simplification that was a NOOP. DAG size: 174 [2019-02-15 11:22:35,565 WARN L181 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-02-15 11:22:35,963 WARN L181 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2019-02-15 11:22:36,376 WARN L181 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-02-15 11:22:36,762 WARN L181 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-02-15 11:22:37,116 WARN L181 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-02-15 11:22:37,482 WARN L181 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-02-15 11:22:37,835 WARN L181 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-02-15 11:22:38,173 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-02-15 11:22:38,494 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-02-15 11:22:38,815 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-02-15 11:22:39,136 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-02-15 11:22:39,455 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-15 11:22:39,813 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-15 11:22:40,094 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-15 11:22:40,373 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-15 11:22:43,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:22:43,387 INFO L93 Difference]: Finished difference Result 544 states and 549 transitions. [2019-02-15 11:22:43,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2019-02-15 11:22:43,388 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 254 [2019-02-15 11:22:43,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:22:43,389 INFO L225 Difference]: With dead ends: 544 [2019-02-15 11:22:43,389 INFO L226 Difference]: Without dead ends: 402 [2019-02-15 11:22:43,391 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 653 GetRequests, 467 SyntacticMatches, 3 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5410 ImplicationChecksByTransitivity, 17.6s TimeCoverageRelationStatistics Valid=1919, Invalid=32121, Unknown=0, NotChecked=0, Total=34040 [2019-02-15 11:22:43,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2019-02-15 11:22:43,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 259. [2019-02-15 11:22:43,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-02-15 11:22:43,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 261 transitions. [2019-02-15 11:22:43,453 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 261 transitions. Word has length 254 [2019-02-15 11:22:43,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:22:43,453 INFO L480 AbstractCegarLoop]: Abstraction has 259 states and 261 transitions. [2019-02-15 11:22:43,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-02-15 11:22:43,454 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 261 transitions. [2019-02-15 11:22:43,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-02-15 11:22:43,455 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:22:43,455 INFO L402 BasicCegarLoop]: trace histogram [37, 36, 36, 36, 36, 36, 36, 1, 1, 1, 1, 1] [2019-02-15 11:22:43,455 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:22:43,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:22:43,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1175113710, now seen corresponding path program 61 times [2019-02-15 11:22:43,455 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:22:43,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:22:43,456 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:22:43,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:22:43,456 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:22:43,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:22:45,393 INFO L134 CoverageAnalysis]: Checked inductivity of 4554 backedges. 2628 proven. 1926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:22:45,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:22:45,393 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:22:45,394 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:22:45,394 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:22:45,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:22:45,394 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:22:45,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:22:45,404 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:22:45,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:22:45,453 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:22:47,594 INFO L134 CoverageAnalysis]: Checked inductivity of 4554 backedges. 2628 proven. 1926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:22:47,595 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:22:49,198 INFO L134 CoverageAnalysis]: Checked inductivity of 4554 backedges. 2628 proven. 1926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:22:49,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:22:49,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 112 [2019-02-15 11:22:49,217 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:22:49,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-02-15 11:22:49,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-02-15 11:22:49,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2924, Invalid=9732, Unknown=0, NotChecked=0, Total=12656 [2019-02-15 11:22:49,218 INFO L87 Difference]: Start difference. First operand 259 states and 261 transitions. Second operand 113 states. [2019-02-15 11:22:52,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:22:52,262 INFO L93 Difference]: Finished difference Result 555 states and 559 transitions. [2019-02-15 11:22:52,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-02-15 11:22:52,263 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 258 [2019-02-15 11:22:52,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:22:52,264 INFO L225 Difference]: With dead ends: 555 [2019-02-15 11:22:52,264 INFO L226 Difference]: Without dead ends: 264 [2019-02-15 11:22:52,266 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 626 GetRequests, 405 SyntacticMatches, 73 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7920 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=5107, Invalid=17243, Unknown=0, NotChecked=0, Total=22350 [2019-02-15 11:22:52,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-02-15 11:22:52,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 262. [2019-02-15 11:22:52,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-02-15 11:22:52,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 264 transitions. [2019-02-15 11:22:52,329 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 264 transitions. Word has length 258 [2019-02-15 11:22:52,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:22:52,330 INFO L480 AbstractCegarLoop]: Abstraction has 262 states and 264 transitions. [2019-02-15 11:22:52,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-02-15 11:22:52,330 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 264 transitions. [2019-02-15 11:22:52,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-02-15 11:22:52,331 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:22:52,331 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 37, 37, 36, 36, 36, 1, 1, 1, 1, 1] [2019-02-15 11:22:52,331 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:22:52,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:22:52,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1470273894, now seen corresponding path program 62 times [2019-02-15 11:22:52,331 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:22:52,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:22:52,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:22:52,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:22:52,332 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:22:52,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:22:55,531 INFO L134 CoverageAnalysis]: Checked inductivity of 4663 backedges. 36 proven. 4627 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:22:55,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:22:55,532 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:22:55,532 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:22:55,532 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:22:55,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:22:55,532 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:22:55,554 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:22:55,554 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:22:55,680 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2019-02-15 11:22:55,680 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:22:55,684 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:23:03,910 INFO L134 CoverageAnalysis]: Checked inductivity of 4663 backedges. 2592 proven. 2071 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:23:03,910 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:23:11,785 INFO L134 CoverageAnalysis]: Checked inductivity of 4663 backedges. 2556 proven. 2107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:23:11,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:23:11,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 78, 78] total 193 [2019-02-15 11:23:11,805 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:23:11,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 155 states [2019-02-15 11:23:11,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 155 interpolants. [2019-02-15 11:23:11,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3985, Invalid=33457, Unknown=0, NotChecked=0, Total=37442 [2019-02-15 11:23:11,807 INFO L87 Difference]: Start difference. First operand 262 states and 264 transitions. Second operand 155 states. [2019-02-15 11:23:43,146 WARN L181 SmtUtils]: Spent 258.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2019-02-15 11:23:43,905 WARN L181 SmtUtils]: Spent 257.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2019-02-15 11:23:44,678 WARN L181 SmtUtils]: Spent 250.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2019-02-15 11:23:45,404 WARN L181 SmtUtils]: Spent 236.00 ms on a formula simplification that was a NOOP. DAG size: 179 [2019-02-15 11:23:46,117 WARN L181 SmtUtils]: Spent 269.00 ms on a formula simplification that was a NOOP. DAG size: 174 [2019-02-15 11:23:46,788 WARN L181 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-02-15 11:23:47,415 WARN L181 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2019-02-15 11:23:48,022 WARN L181 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-02-15 11:23:48,623 WARN L181 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-02-15 11:23:49,199 WARN L181 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-02-15 11:23:49,763 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-02-15 11:23:50,310 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-02-15 11:23:50,830 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-02-15 11:23:51,433 WARN L181 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-02-15 11:23:51,942 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-02-15 11:23:52,415 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-02-15 11:23:52,869 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-15 11:23:53,313 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-15 11:23:53,755 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-15 11:23:54,152 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-15 11:23:58,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:23:58,541 INFO L93 Difference]: Finished difference Result 705 states and 711 transitions. [2019-02-15 11:23:58,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 261 states. [2019-02-15 11:23:58,542 INFO L78 Accepts]: Start accepts. Automaton has 155 states. Word has length 261 [2019-02-15 11:23:58,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:23:58,543 INFO L225 Difference]: With dead ends: 705 [2019-02-15 11:23:58,543 INFO L226 Difference]: Without dead ends: 410 [2019-02-15 11:23:58,547 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 819 GetRequests, 367 SyntacticMatches, 38 SemanticMatches, 414 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37575 ImplicationChecksByTransitivity, 55.2s TimeCoverageRelationStatistics Valid=11795, Invalid=160845, Unknown=0, NotChecked=0, Total=172640 [2019-02-15 11:23:58,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2019-02-15 11:23:58,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 269. [2019-02-15 11:23:58,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-02-15 11:23:58,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 271 transitions. [2019-02-15 11:23:58,621 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 271 transitions. Word has length 261 [2019-02-15 11:23:58,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:23:58,622 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 271 transitions. [2019-02-15 11:23:58,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has 155 states. [2019-02-15 11:23:58,622 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 271 transitions. [2019-02-15 11:23:58,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-02-15 11:23:58,623 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:23:58,623 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 38, 38, 37, 37, 37, 1, 1, 1, 1, 1] [2019-02-15 11:23:58,623 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:23:58,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:23:58,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1569385749, now seen corresponding path program 63 times [2019-02-15 11:23:58,623 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:23:58,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:23:58,624 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:23:58,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:23:58,624 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:23:58,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:24:02,010 INFO L134 CoverageAnalysis]: Checked inductivity of 4922 backedges. 37 proven. 4885 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:24:02,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:24:02,011 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:24:02,011 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:24:02,011 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:24:02,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:24:02,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 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:24:02,024 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:24:02,024 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:24:02,068 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:24:02,068 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:24:02,073 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:24:05,561 INFO L134 CoverageAnalysis]: Checked inductivity of 4922 backedges. 37 proven. 4885 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:24:05,561 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:24:05,840 INFO L134 CoverageAnalysis]: Checked inductivity of 4922 backedges. 37 proven. 4885 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:24:05,859 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:24:05,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 78, 78] total 118 [2019-02-15 11:24:05,860 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:24:05,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 119 states [2019-02-15 11:24:05,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2019-02-15 11:24:05,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=314, Invalid=13728, Unknown=0, NotChecked=0, Total=14042 [2019-02-15 11:24:05,861 INFO L87 Difference]: Start difference. First operand 269 states and 271 transitions. Second operand 119 states. [2019-02-15 11:24:22,273 WARN L181 SmtUtils]: Spent 299.00 ms on a formula simplification that was a NOOP. DAG size: 193 [2019-02-15 11:24:22,932 WARN L181 SmtUtils]: Spent 259.00 ms on a formula simplification that was a NOOP. DAG size: 193 [2019-02-15 11:24:23,552 WARN L181 SmtUtils]: Spent 258.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2019-02-15 11:24:23,994 WARN L181 SmtUtils]: Spent 237.00 ms on a formula simplification that was a NOOP. DAG size: 184 [2019-02-15 11:24:24,439 WARN L181 SmtUtils]: Spent 236.00 ms on a formula simplification that was a NOOP. DAG size: 179 [2019-02-15 11:24:24,880 WARN L181 SmtUtils]: Spent 233.00 ms on a formula simplification that was a NOOP. DAG size: 174 [2019-02-15 11:24:25,321 WARN L181 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-02-15 11:24:25,736 WARN L181 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2019-02-15 11:24:26,139 WARN L181 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-02-15 11:24:26,535 WARN L181 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-02-15 11:24:26,924 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-02-15 11:24:27,338 WARN L181 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-02-15 11:24:27,708 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-02-15 11:24:28,073 WARN L181 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-02-15 11:24:28,420 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-02-15 11:24:28,768 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-02-15 11:24:29,103 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-02-15 11:24:29,419 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-15 11:24:29,714 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-15 11:24:30,011 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-15 11:24:30,307 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-15 11:24:33,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:24:33,626 INFO L93 Difference]: Finished difference Result 574 states and 579 transitions. [2019-02-15 11:24:33,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2019-02-15 11:24:33,626 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 268 [2019-02-15 11:24:33,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:24:33,628 INFO L225 Difference]: With dead ends: 574 [2019-02-15 11:24:33,628 INFO L226 Difference]: Without dead ends: 424 [2019-02-15 11:24:33,629 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 689 GetRequests, 493 SyntacticMatches, 3 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6014 ImplicationChecksByTransitivity, 19.9s TimeCoverageRelationStatistics Valid=2101, Invalid=35729, Unknown=0, NotChecked=0, Total=37830 [2019-02-15 11:24:33,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2019-02-15 11:24:33,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 273. [2019-02-15 11:24:33,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2019-02-15 11:24:33,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 275 transitions. [2019-02-15 11:24:33,712 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 275 transitions. Word has length 268 [2019-02-15 11:24:33,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:24:33,712 INFO L480 AbstractCegarLoop]: Abstraction has 273 states and 275 transitions. [2019-02-15 11:24:33,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 119 states. [2019-02-15 11:24:33,712 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 275 transitions. [2019-02-15 11:24:33,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2019-02-15 11:24:33,713 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:24:33,713 INFO L402 BasicCegarLoop]: trace histogram [39, 38, 38, 38, 38, 38, 38, 1, 1, 1, 1, 1] [2019-02-15 11:24:33,713 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:24:33,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:24:33,714 INFO L82 PathProgramCache]: Analyzing trace with hash 107131324, now seen corresponding path program 64 times [2019-02-15 11:24:33,714 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:24:33,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:24:33,714 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:24:33,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:24:33,714 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:24:33,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:24:35,598 INFO L134 CoverageAnalysis]: Checked inductivity of 5073 backedges. 2926 proven. 2147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:24:35,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:24:35,599 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:24:35,599 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:24:35,599 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:24:35,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:24:35,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 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:24:35,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:24:35,608 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:24:35,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:24:35,660 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:24:38,230 INFO L134 CoverageAnalysis]: Checked inductivity of 5073 backedges. 2926 proven. 2147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:24:38,230 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:24:40,018 INFO L134 CoverageAnalysis]: Checked inductivity of 5073 backedges. 2926 proven. 2147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:24:40,037 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:24:40,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 118 [2019-02-15 11:24:40,038 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:24:40,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 119 states [2019-02-15 11:24:40,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2019-02-15 11:24:40,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3238, Invalid=10804, Unknown=0, NotChecked=0, Total=14042 [2019-02-15 11:24:40,039 INFO L87 Difference]: Start difference. First operand 273 states and 275 transitions. Second operand 119 states. [2019-02-15 11:24:43,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:24:43,492 INFO L93 Difference]: Finished difference Result 585 states and 589 transitions. [2019-02-15 11:24:43,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-02-15 11:24:43,492 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 272 [2019-02-15 11:24:43,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:24:43,493 INFO L225 Difference]: With dead ends: 585 [2019-02-15 11:24:43,494 INFO L226 Difference]: Without dead ends: 278 [2019-02-15 11:24:43,495 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 660 GetRequests, 427 SyntacticMatches, 77 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8816 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=5656, Invalid=19150, Unknown=0, NotChecked=0, Total=24806 [2019-02-15 11:24:43,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-02-15 11:24:43,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 276. [2019-02-15 11:24:43,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-02-15 11:24:43,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 278 transitions. [2019-02-15 11:24:43,571 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 278 transitions. Word has length 272 [2019-02-15 11:24:43,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:24:43,572 INFO L480 AbstractCegarLoop]: Abstraction has 276 states and 278 transitions. [2019-02-15 11:24:43,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 119 states. [2019-02-15 11:24:43,572 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 278 transitions. [2019-02-15 11:24:43,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2019-02-15 11:24:43,573 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:24:43,573 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 39, 39, 38, 38, 38, 1, 1, 1, 1, 1] [2019-02-15 11:24:43,573 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:24:43,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:24:43,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1761642804, now seen corresponding path program 65 times [2019-02-15 11:24:43,573 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:24:43,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:24:43,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:24:43,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:24:43,574 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:24:43,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:24:46,848 INFO L134 CoverageAnalysis]: Checked inductivity of 5188 backedges. 38 proven. 5150 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:24:46,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:24:46,848 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:24:46,848 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:24:46,849 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:24:46,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:24:46,849 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:24:46,857 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:24:46,857 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:24:46,946 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2019-02-15 11:24:46,946 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:24:46,950 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:24:56,071 INFO L134 CoverageAnalysis]: Checked inductivity of 5188 backedges. 2888 proven. 2300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:24:56,071 INFO L316 TraceCheckSpWp]: Computing backward predicates...